java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/product-lines/email_spec11_product20.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:50:21,870 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:50:21,872 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:50:21,884 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:50:21,885 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:50:21,886 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:50:21,887 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:50:21,889 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:50:21,891 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:50:21,891 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:50:21,892 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:50:21,894 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:50:21,894 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:50:21,895 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:50:21,896 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:50:21,897 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:50:21,898 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:50:21,899 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:50:21,900 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:50:21,905 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:50:21,907 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:50:21,908 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:50:21,909 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:50:21,909 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:50:21,911 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:50:21,912 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:50:21,912 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:50:21,913 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:50:21,913 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:50:21,914 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:50:21,914 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:50:21,915 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:50:21,916 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:50:21,917 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:50:21,918 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:50:21,918 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:50:21,919 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:50:21,919 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:50:21,919 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:50:21,920 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:50:21,920 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:50:21,921 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 02:50:21,936 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:50:21,937 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:50:21,937 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:50:21,937 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:50:21,938 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:50:21,938 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:50:21,938 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:50:21,938 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:50:21,939 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:50:21,939 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:50:21,940 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:50:21,940 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:50:21,940 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:50:21,940 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:50:21,940 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:50:21,941 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:50:21,941 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:50:21,941 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:50:21,941 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:50:21,941 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:50:21,942 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:50:21,942 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:50:21,942 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:50:21,942 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:50:21,942 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:50:21,943 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:50:21,943 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:50:21,943 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:50:21,943 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:50:21,943 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:50:21,972 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:50:21,985 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:50:21,988 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:50:21,990 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:50:21,990 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:50:21,991 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec11_product20.cil.c [2019-10-03 02:50:22,055 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1cb75b0e/c24c70ad45654a5983f95b08beba80ea/FLAG060993cbc [2019-10-03 02:50:22,718 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:50:22,722 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec11_product20.cil.c [2019-10-03 02:50:22,765 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1cb75b0e/c24c70ad45654a5983f95b08beba80ea/FLAG060993cbc [2019-10-03 02:50:22,926 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1cb75b0e/c24c70ad45654a5983f95b08beba80ea [2019-10-03 02:50:22,943 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:50:22,945 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:50:22,950 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:50:22,950 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:50:22,954 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:50:22,956 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:50:22" (1/1) ... [2019-10-03 02:50:22,959 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50a380d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:22, skipping insertion in model container [2019-10-03 02:50:22,959 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:50:22" (1/1) ... [2019-10-03 02:50:22,969 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:50:23,063 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:50:23,845 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:50:23,864 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:50:23,985 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:50:24,074 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:50:24,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:24 WrapperNode [2019-10-03 02:50:24,074 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:50:24,075 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:50:24,075 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:50:24,076 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:50:24,090 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:24" (1/1) ... [2019-10-03 02:50:24,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:24" (1/1) ... [2019-10-03 02:50:24,123 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:24" (1/1) ... [2019-10-03 02:50:24,123 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:24" (1/1) ... [2019-10-03 02:50:24,210 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:24" (1/1) ... [2019-10-03 02:50:24,266 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:24" (1/1) ... [2019-10-03 02:50:24,286 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:24" (1/1) ... [2019-10-03 02:50:24,304 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:50:24,305 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:50:24,305 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:50:24,305 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:50:24,307 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:50:24,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:50:24,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:50:24,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-03 02:50:24,381 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-03 02:50:24,381 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-03 02:50:24,382 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-03 02:50:24,382 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-03 02:50:24,382 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-03 02:50:24,382 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-03 02:50:24,382 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-03 02:50:24,383 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-03 02:50:24,383 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-03 02:50:24,383 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-03 02:50:24,383 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:50:24,383 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-03 02:50:24,384 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-03 02:50:24,384 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-03 02:50:24,384 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-03 02:50:24,384 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-03 02:50:24,385 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-03 02:50:24,385 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-03 02:50:24,385 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-03 02:50:24,385 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-03 02:50:24,385 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-03 02:50:24,386 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-03 02:50:24,386 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-03 02:50:24,386 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-03 02:50:24,386 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-03 02:50:24,386 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-03 02:50:24,386 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-03 02:50:24,387 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-03 02:50:24,387 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-03 02:50:24,387 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-03 02:50:24,387 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-03 02:50:24,387 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-03 02:50:24,387 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-03 02:50:24,388 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-03 02:50:24,388 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-03 02:50:24,388 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-03 02:50:24,388 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-03 02:50:24,388 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-03 02:50:24,388 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-03 02:50:24,388 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-03 02:50:24,389 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-03 02:50:24,389 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-03 02:50:24,389 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-03 02:50:24,389 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-03 02:50:24,389 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-03 02:50:24,389 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-03 02:50:24,390 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-03 02:50:24,390 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-03 02:50:24,390 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-03 02:50:24,390 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-03 02:50:24,390 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-03 02:50:24,390 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-03 02:50:24,390 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-03 02:50:24,391 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-03 02:50:24,391 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-03 02:50:24,391 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-03 02:50:24,391 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-03 02:50:24,391 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-03 02:50:24,391 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-03 02:50:24,391 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-03 02:50:24,392 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-03 02:50:24,392 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__DecryptAutoResponder_spec__1 [2019-10-03 02:50:24,392 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-03 02:50:24,392 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-03 02:50:24,392 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-03 02:50:24,392 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-10-03 02:50:24,393 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-03 02:50:24,393 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-03 02:50:24,393 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-10-03 02:50:24,393 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AddressBook [2019-10-03 02:50:24,393 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-03 02:50:24,393 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-03 02:50:24,393 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-03 02:50:24,394 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-03 02:50:24,394 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-03 02:50:24,394 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-03 02:50:24,394 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-03 02:50:24,394 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-03 02:50:24,394 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-03 02:50:24,395 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-03 02:50:24,395 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-03 02:50:24,395 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-03 02:50:24,395 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-03 02:50:24,395 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-03 02:50:24,395 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-03 02:50:24,396 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-03 02:50:24,396 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-03 02:50:24,396 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-03 02:50:24,396 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-03 02:50:24,396 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-03 02:50:24,396 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-03 02:50:24,396 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-03 02:50:24,397 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-03 02:50:24,397 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-03 02:50:24,397 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-03 02:50:24,397 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-03 02:50:24,397 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-03 02:50:24,397 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-03 02:50:24,397 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-03 02:50:24,398 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-03 02:50:24,398 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-03 02:50:24,398 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-03 02:50:24,398 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-03 02:50:24,398 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-03 02:50:24,398 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-03 02:50:24,398 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-03 02:50:24,399 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-03 02:50:24,399 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-03 02:50:24,399 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-03 02:50:24,399 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:50:24,399 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:50:24,399 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-03 02:50:24,400 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-03 02:50:24,400 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-03 02:50:24,400 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-03 02:50:24,400 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-03 02:50:24,400 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-03 02:50:24,400 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-03 02:50:24,401 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-03 02:50:24,401 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-03 02:50:24,401 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-03 02:50:24,401 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-03 02:50:24,401 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-03 02:50:24,401 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-03 02:50:24,401 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-03 02:50:24,402 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-03 02:50:24,402 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-03 02:50:24,402 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-03 02:50:24,402 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-03 02:50:24,402 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-03 02:50:24,402 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-03 02:50:24,403 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-03 02:50:24,403 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-03 02:50:24,403 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-03 02:50:24,403 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-03 02:50:24,403 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-03 02:50:24,403 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-03 02:50:24,404 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-03 02:50:24,404 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-03 02:50:24,404 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-03 02:50:24,404 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-03 02:50:24,404 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:50:24,404 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-03 02:50:24,404 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-03 02:50:24,404 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-03 02:50:24,405 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-03 02:50:24,405 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-03 02:50:24,405 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-03 02:50:24,405 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-03 02:50:24,405 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-03 02:50:24,405 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-03 02:50:24,406 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-03 02:50:24,406 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-03 02:50:24,406 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-03 02:50:24,406 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-03 02:50:24,406 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-03 02:50:24,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:50:24,406 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-03 02:50:24,407 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-03 02:50:24,407 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-03 02:50:24,407 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-03 02:50:24,407 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-03 02:50:24,407 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-03 02:50:24,407 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-03 02:50:24,408 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-03 02:50:24,408 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-03 02:50:24,408 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-03 02:50:24,408 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-03 02:50:24,408 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-03 02:50:24,408 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-03 02:50:24,409 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-03 02:50:24,409 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-03 02:50:24,409 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-03 02:50:24,409 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-03 02:50:24,409 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-03 02:50:24,409 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-03 02:50:24,410 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-03 02:50:24,410 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:50:24,410 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:50:24,410 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-03 02:50:24,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:50:24,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:50:24,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:50:24,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:50:24,411 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-03 02:50:24,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:50:24,411 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-03 02:50:24,411 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-03 02:50:24,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:50:24,412 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-03 02:50:24,412 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-03 02:50:24,412 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-03 02:50:24,412 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-03 02:50:24,412 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__DecryptAutoResponder_spec__1 [2019-10-03 02:50:24,413 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-03 02:50:24,413 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-03 02:50:24,413 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-03 02:50:24,413 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-03 02:50:24,413 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-03 02:50:24,413 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-03 02:50:24,414 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-03 02:50:24,414 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-03 02:50:24,414 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-03 02:50:24,414 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-03 02:50:24,414 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-03 02:50:24,414 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-03 02:50:24,415 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-03 02:50:24,415 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-03 02:50:24,415 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-03 02:50:24,415 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-03 02:50:24,415 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-03 02:50:24,416 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-03 02:50:24,416 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-03 02:50:24,416 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-10-03 02:50:24,416 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-10-03 02:50:24,416 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AddressBook [2019-10-03 02:50:24,416 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-03 02:50:24,417 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-03 02:50:24,417 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-03 02:50:24,417 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-03 02:50:24,417 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-03 02:50:24,417 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-03 02:50:24,417 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-03 02:50:24,418 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-03 02:50:24,418 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-03 02:50:24,418 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-03 02:50:24,418 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-03 02:50:24,418 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-03 02:50:24,418 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-03 02:50:24,419 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-03 02:50:24,419 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-03 02:50:24,419 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-03 02:50:24,419 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-03 02:50:24,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:50:24,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:50:24,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:50:26,405 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:50:26,406 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-03 02:50:26,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:50:26 BoogieIcfgContainer [2019-10-03 02:50:26,408 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:50:26,409 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:50:26,409 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:50:26,413 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:50:26,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:50:22" (1/3) ... [2019-10-03 02:50:26,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@447f5397 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:50:26, skipping insertion in model container [2019-10-03 02:50:26,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:24" (2/3) ... [2019-10-03 02:50:26,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@447f5397 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:50:26, skipping insertion in model container [2019-10-03 02:50:26,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:50:26" (3/3) ... [2019-10-03 02:50:26,416 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec11_product20.cil.c [2019-10-03 02:50:26,427 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:50:26,438 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:50:26,456 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:50:26,484 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:50:26,484 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:50:26,484 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:50:26,484 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:50:26,485 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:50:26,485 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:50:26,485 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:50:26,485 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:50:26,516 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states. [2019-10-03 02:50:26,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-03 02:50:26,546 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:26,548 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:26,550 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:26,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:26,557 INFO L82 PathProgramCache]: Analyzing trace with hash 598149460, now seen corresponding path program 1 times [2019-10-03 02:50:26,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:26,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:26,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:26,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:26,627 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:27,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:27,311 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-03 02:50:27,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:27,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-03 02:50:27,315 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:27,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:50:27,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:50:27,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:50:27,342 INFO L87 Difference]: Start difference. First operand 556 states. Second operand 2 states. [2019-10-03 02:50:27,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:27,397 INFO L93 Difference]: Finished difference Result 523 states and 715 transitions. [2019-10-03 02:50:27,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:50:27,399 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 193 [2019-10-03 02:50:27,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:27,472 INFO L225 Difference]: With dead ends: 523 [2019-10-03 02:50:27,473 INFO L226 Difference]: Without dead ends: 514 [2019-10-03 02:50:27,475 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:50:27,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-10-03 02:50:27,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 514. [2019-10-03 02:50:27,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2019-10-03 02:50:27,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 704 transitions. [2019-10-03 02:50:27,568 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 704 transitions. Word has length 193 [2019-10-03 02:50:27,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:27,570 INFO L475 AbstractCegarLoop]: Abstraction has 514 states and 704 transitions. [2019-10-03 02:50:27,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:50:27,570 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 704 transitions. [2019-10-03 02:50:27,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-10-03 02:50:27,576 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:27,576 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:27,577 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:27,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:27,578 INFO L82 PathProgramCache]: Analyzing trace with hash -736139474, now seen corresponding path program 1 times [2019-10-03 02:50:27,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:27,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:27,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:27,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:27,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:27,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:27,923 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-03 02:50:27,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:27,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:50:27,924 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:27,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:50:27,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:50:27,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:27,934 INFO L87 Difference]: Start difference. First operand 514 states and 704 transitions. Second operand 3 states. [2019-10-03 02:50:28,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:28,012 INFO L93 Difference]: Finished difference Result 517 states and 707 transitions. [2019-10-03 02:50:28,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:50:28,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2019-10-03 02:50:28,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:28,024 INFO L225 Difference]: With dead ends: 517 [2019-10-03 02:50:28,024 INFO L226 Difference]: Without dead ends: 517 [2019-10-03 02:50:28,025 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:28,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2019-10-03 02:50:28,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 516. [2019-10-03 02:50:28,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-10-03 02:50:28,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 706 transitions. [2019-10-03 02:50:28,076 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 706 transitions. Word has length 194 [2019-10-03 02:50:28,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:28,079 INFO L475 AbstractCegarLoop]: Abstraction has 516 states and 706 transitions. [2019-10-03 02:50:28,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:50:28,079 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 706 transitions. [2019-10-03 02:50:28,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-03 02:50:28,088 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:28,088 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:28,089 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:28,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:28,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1382957214, now seen corresponding path program 1 times [2019-10-03 02:50:28,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:28,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:28,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:28,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:28,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:28,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:28,296 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-03 02:50:28,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:28,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:50:28,297 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:28,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:50:28,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:50:28,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:28,299 INFO L87 Difference]: Start difference. First operand 516 states and 706 transitions. Second operand 3 states. [2019-10-03 02:50:28,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:28,323 INFO L93 Difference]: Finished difference Result 559 states and 779 transitions. [2019-10-03 02:50:28,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:50:28,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-10-03 02:50:28,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:28,328 INFO L225 Difference]: With dead ends: 559 [2019-10-03 02:50:28,328 INFO L226 Difference]: Without dead ends: 559 [2019-10-03 02:50:28,328 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:28,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-10-03 02:50:28,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 558. [2019-10-03 02:50:28,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2019-10-03 02:50:28,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 778 transitions. [2019-10-03 02:50:28,357 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 778 transitions. Word has length 204 [2019-10-03 02:50:28,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:28,359 INFO L475 AbstractCegarLoop]: Abstraction has 558 states and 778 transitions. [2019-10-03 02:50:28,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:50:28,360 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 778 transitions. [2019-10-03 02:50:28,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-10-03 02:50:28,367 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:28,367 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:28,367 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:28,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:28,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1870197346, now seen corresponding path program 1 times [2019-10-03 02:50:28,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:28,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:28,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:28,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:28,373 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:28,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:28,543 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-03 02:50:28,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:28,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:50:28,544 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:28,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:50:28,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:50:28,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:28,546 INFO L87 Difference]: Start difference. First operand 558 states and 778 transitions. Second operand 3 states. [2019-10-03 02:50:28,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:28,587 INFO L93 Difference]: Finished difference Result 640 states and 917 transitions. [2019-10-03 02:50:28,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:50:28,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-10-03 02:50:28,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:28,597 INFO L225 Difference]: With dead ends: 640 [2019-10-03 02:50:28,597 INFO L226 Difference]: Without dead ends: 640 [2019-10-03 02:50:28,598 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:28,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-10-03 02:50:28,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 639. [2019-10-03 02:50:28,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-10-03 02:50:28,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 916 transitions. [2019-10-03 02:50:28,630 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 916 transitions. Word has length 205 [2019-10-03 02:50:28,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:28,631 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 916 transitions. [2019-10-03 02:50:28,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:50:28,631 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 916 transitions. [2019-10-03 02:50:28,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-10-03 02:50:28,638 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:28,638 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:28,639 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:28,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:28,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1813440642, now seen corresponding path program 1 times [2019-10-03 02:50:28,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:28,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:28,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:28,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:28,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:28,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:28,850 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-03 02:50:28,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:28,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:50:28,851 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:28,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:50:28,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:50:28,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:28,853 INFO L87 Difference]: Start difference. First operand 639 states and 916 transitions. Second operand 3 states. [2019-10-03 02:50:28,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:28,881 INFO L93 Difference]: Finished difference Result 796 states and 1181 transitions. [2019-10-03 02:50:28,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:50:28,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2019-10-03 02:50:28,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:28,890 INFO L225 Difference]: With dead ends: 796 [2019-10-03 02:50:28,891 INFO L226 Difference]: Without dead ends: 796 [2019-10-03 02:50:28,891 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:28,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2019-10-03 02:50:28,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 795. [2019-10-03 02:50:28,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2019-10-03 02:50:28,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1180 transitions. [2019-10-03 02:50:28,932 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1180 transitions. Word has length 206 [2019-10-03 02:50:28,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:28,933 INFO L475 AbstractCegarLoop]: Abstraction has 795 states and 1180 transitions. [2019-10-03 02:50:28,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:50:28,933 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1180 transitions. [2019-10-03 02:50:28,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-10-03 02:50:28,941 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:28,941 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:28,941 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:28,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:28,942 INFO L82 PathProgramCache]: Analyzing trace with hash -786715774, now seen corresponding path program 1 times [2019-10-03 02:50:28,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:28,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:28,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:28,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:28,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:29,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:29,200 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-03 02:50:29,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:29,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:50:29,201 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:29,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:50:29,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:50:29,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:29,202 INFO L87 Difference]: Start difference. First operand 795 states and 1180 transitions. Second operand 3 states. [2019-10-03 02:50:29,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:29,232 INFO L93 Difference]: Finished difference Result 1096 states and 1685 transitions. [2019-10-03 02:50:29,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:50:29,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 207 [2019-10-03 02:50:29,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:29,241 INFO L225 Difference]: With dead ends: 1096 [2019-10-03 02:50:29,242 INFO L226 Difference]: Without dead ends: 1096 [2019-10-03 02:50:29,242 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:29,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2019-10-03 02:50:29,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 1095. [2019-10-03 02:50:29,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1095 states. [2019-10-03 02:50:29,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1684 transitions. [2019-10-03 02:50:29,276 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1684 transitions. Word has length 207 [2019-10-03 02:50:29,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:29,277 INFO L475 AbstractCegarLoop]: Abstraction has 1095 states and 1684 transitions. [2019-10-03 02:50:29,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:50:29,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1684 transitions. [2019-10-03 02:50:29,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-10-03 02:50:29,284 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:29,285 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:29,285 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:29,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:29,286 INFO L82 PathProgramCache]: Analyzing trace with hash -709603746, now seen corresponding path program 1 times [2019-10-03 02:50:29,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:29,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:29,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:29,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:29,290 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:29,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:29,449 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-03 02:50:29,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:29,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:50:29,450 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:29,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:50:29,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:50:29,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:29,451 INFO L87 Difference]: Start difference. First operand 1095 states and 1684 transitions. Second operand 3 states. [2019-10-03 02:50:29,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:29,480 INFO L93 Difference]: Finished difference Result 1672 states and 2645 transitions. [2019-10-03 02:50:29,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:50:29,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2019-10-03 02:50:29,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:29,492 INFO L225 Difference]: With dead ends: 1672 [2019-10-03 02:50:29,492 INFO L226 Difference]: Without dead ends: 1672 [2019-10-03 02:50:29,493 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:29,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2019-10-03 02:50:29,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 1671. [2019-10-03 02:50:29,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1671 states. [2019-10-03 02:50:29,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2644 transitions. [2019-10-03 02:50:29,546 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2644 transitions. Word has length 208 [2019-10-03 02:50:29,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:29,547 INFO L475 AbstractCegarLoop]: Abstraction has 1671 states and 2644 transitions. [2019-10-03 02:50:29,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:50:29,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2644 transitions. [2019-10-03 02:50:29,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-03 02:50:29,558 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:29,558 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:29,559 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:29,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:29,559 INFO L82 PathProgramCache]: Analyzing trace with hash 324914454, now seen corresponding path program 1 times [2019-10-03 02:50:29,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:29,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:29,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:29,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:29,564 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:29,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:30,039 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:50:30,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:30,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-03 02:50:30,040 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:30,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-03 02:50:30,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-03 02:50:30,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-10-03 02:50:30,043 INFO L87 Difference]: Start difference. First operand 1671 states and 2644 transitions. Second operand 19 states. [2019-10-03 02:50:35,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:35,004 INFO L93 Difference]: Finished difference Result 3825 states and 6088 transitions. [2019-10-03 02:50:35,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-03 02:50:35,005 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 210 [2019-10-03 02:50:35,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:35,031 INFO L225 Difference]: With dead ends: 3825 [2019-10-03 02:50:35,031 INFO L226 Difference]: Without dead ends: 3825 [2019-10-03 02:50:35,033 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=287, Invalid=2683, Unknown=0, NotChecked=0, Total=2970 [2019-10-03 02:50:35,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3825 states. [2019-10-03 02:50:35,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3825 to 3788. [2019-10-03 02:50:35,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3788 states. [2019-10-03 02:50:35,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3788 states to 3788 states and 6041 transitions. [2019-10-03 02:50:35,204 INFO L78 Accepts]: Start accepts. Automaton has 3788 states and 6041 transitions. Word has length 210 [2019-10-03 02:50:35,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:35,205 INFO L475 AbstractCegarLoop]: Abstraction has 3788 states and 6041 transitions. [2019-10-03 02:50:35,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-03 02:50:35,206 INFO L276 IsEmpty]: Start isEmpty. Operand 3788 states and 6041 transitions. [2019-10-03 02:50:35,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-10-03 02:50:35,236 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:35,237 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:35,237 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:35,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:35,238 INFO L82 PathProgramCache]: Analyzing trace with hash 39326315, now seen corresponding path program 1 times [2019-10-03 02:50:35,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:35,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:35,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:35,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:35,244 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:35,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:35,600 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:50:35,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:35,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-03 02:50:35,601 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:35,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-03 02:50:35,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-03 02:50:35,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-03 02:50:35,602 INFO L87 Difference]: Start difference. First operand 3788 states and 6041 transitions. Second operand 15 states. [2019-10-03 02:50:39,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:39,590 INFO L93 Difference]: Finished difference Result 3890 states and 6189 transitions. [2019-10-03 02:50:39,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-03 02:50:39,591 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 211 [2019-10-03 02:50:39,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:39,616 INFO L225 Difference]: With dead ends: 3890 [2019-10-03 02:50:39,617 INFO L226 Difference]: Without dead ends: 3890 [2019-10-03 02:50:39,618 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=229, Invalid=1933, Unknown=0, NotChecked=0, Total=2162 [2019-10-03 02:50:39,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3890 states. [2019-10-03 02:50:39,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3890 to 3858. [2019-10-03 02:50:39,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3858 states. [2019-10-03 02:50:39,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3858 states to 3858 states and 6154 transitions. [2019-10-03 02:50:39,754 INFO L78 Accepts]: Start accepts. Automaton has 3858 states and 6154 transitions. Word has length 211 [2019-10-03 02:50:39,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:39,755 INFO L475 AbstractCegarLoop]: Abstraction has 3858 states and 6154 transitions. [2019-10-03 02:50:39,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-03 02:50:39,755 INFO L276 IsEmpty]: Start isEmpty. Operand 3858 states and 6154 transitions. [2019-10-03 02:50:39,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-10-03 02:50:39,774 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:39,775 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:39,775 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:39,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:39,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1203291151, now seen corresponding path program 1 times [2019-10-03 02:50:39,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:39,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:39,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:39,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:39,780 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:39,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:39,964 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-03 02:50:39,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:39,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:50:39,965 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:39,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:50:39,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:50:39,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:50:39,968 INFO L87 Difference]: Start difference. First operand 3858 states and 6154 transitions. Second operand 5 states. [2019-10-03 02:50:40,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:40,056 INFO L93 Difference]: Finished difference Result 3588 states and 5778 transitions. [2019-10-03 02:50:40,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:50:40,057 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 214 [2019-10-03 02:50:40,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:40,088 INFO L225 Difference]: With dead ends: 3588 [2019-10-03 02:50:40,088 INFO L226 Difference]: Without dead ends: 3585 [2019-10-03 02:50:40,089 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:50:40,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3585 states. [2019-10-03 02:50:40,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3585 to 3585. [2019-10-03 02:50:40,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3585 states. [2019-10-03 02:50:40,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3585 states to 3585 states and 5771 transitions. [2019-10-03 02:50:40,232 INFO L78 Accepts]: Start accepts. Automaton has 3585 states and 5771 transitions. Word has length 214 [2019-10-03 02:50:40,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:40,232 INFO L475 AbstractCegarLoop]: Abstraction has 3585 states and 5771 transitions. [2019-10-03 02:50:40,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:50:40,232 INFO L276 IsEmpty]: Start isEmpty. Operand 3585 states and 5771 transitions. [2019-10-03 02:50:40,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-03 02:50:40,250 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:40,251 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:40,251 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:40,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:40,251 INFO L82 PathProgramCache]: Analyzing trace with hash 623322042, now seen corresponding path program 1 times [2019-10-03 02:50:40,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:40,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:40,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:40,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:40,258 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:40,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:40,645 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:50:40,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:40,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-03 02:50:40,646 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:40,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-03 02:50:40,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-03 02:50:40,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-03 02:50:40,647 INFO L87 Difference]: Start difference. First operand 3585 states and 5771 transitions. Second operand 15 states. [2019-10-03 02:50:43,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:43,711 INFO L93 Difference]: Finished difference Result 3608 states and 5798 transitions. [2019-10-03 02:50:43,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-03 02:50:43,711 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 212 [2019-10-03 02:50:43,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:43,745 INFO L225 Difference]: With dead ends: 3608 [2019-10-03 02:50:43,746 INFO L226 Difference]: Without dead ends: 3608 [2019-10-03 02:50:43,748 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=1166, Unknown=0, NotChecked=0, Total=1332 [2019-10-03 02:50:43,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3608 states. [2019-10-03 02:50:43,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3608 to 3585. [2019-10-03 02:50:43,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3585 states. [2019-10-03 02:50:43,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3585 states to 3585 states and 5771 transitions. [2019-10-03 02:50:43,906 INFO L78 Accepts]: Start accepts. Automaton has 3585 states and 5771 transitions. Word has length 212 [2019-10-03 02:50:43,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:43,908 INFO L475 AbstractCegarLoop]: Abstraction has 3585 states and 5771 transitions. [2019-10-03 02:50:43,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-03 02:50:43,908 INFO L276 IsEmpty]: Start isEmpty. Operand 3585 states and 5771 transitions. [2019-10-03 02:50:43,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-03 02:50:43,929 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:43,929 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:43,929 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:43,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:43,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1312338245, now seen corresponding path program 1 times [2019-10-03 02:50:43,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:43,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:43,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:43,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:43,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:44,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:44,376 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:50:44,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:44,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-10-03 02:50:44,377 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:44,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-03 02:50:44,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-03 02:50:44,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2019-10-03 02:50:44,379 INFO L87 Difference]: Start difference. First operand 3585 states and 5771 transitions. Second operand 21 states. [2019-10-03 02:50:49,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:49,154 INFO L93 Difference]: Finished difference Result 3629 states and 5829 transitions. [2019-10-03 02:50:49,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-03 02:50:49,155 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 212 [2019-10-03 02:50:49,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:49,178 INFO L225 Difference]: With dead ends: 3629 [2019-10-03 02:50:49,178 INFO L226 Difference]: Without dead ends: 3629 [2019-10-03 02:50:49,179 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=251, Invalid=2199, Unknown=0, NotChecked=0, Total=2450 [2019-10-03 02:50:49,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3629 states. [2019-10-03 02:50:49,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3629 to 3599. [2019-10-03 02:50:49,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3599 states. [2019-10-03 02:50:49,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3599 states to 3599 states and 5788 transitions. [2019-10-03 02:50:49,276 INFO L78 Accepts]: Start accepts. Automaton has 3599 states and 5788 transitions. Word has length 212 [2019-10-03 02:50:49,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:49,276 INFO L475 AbstractCegarLoop]: Abstraction has 3599 states and 5788 transitions. [2019-10-03 02:50:49,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-03 02:50:49,276 INFO L276 IsEmpty]: Start isEmpty. Operand 3599 states and 5788 transitions. [2019-10-03 02:50:49,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-10-03 02:50:49,295 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:49,295 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:49,295 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:49,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:49,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1251493429, now seen corresponding path program 1 times [2019-10-03 02:50:49,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:49,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:49,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:49,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:49,304 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:49,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:49,702 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-03 02:50:49,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:49,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-10-03 02:50:49,703 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:49,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-03 02:50:49,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-03 02:50:49,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-10-03 02:50:49,705 INFO L87 Difference]: Start difference. First operand 3599 states and 5788 transitions. Second operand 16 states. [2019-10-03 02:50:50,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:50,212 INFO L93 Difference]: Finished difference Result 3719 states and 5969 transitions. [2019-10-03 02:50:50,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-03 02:50:50,212 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 211 [2019-10-03 02:50:50,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:50,250 INFO L225 Difference]: With dead ends: 3719 [2019-10-03 02:50:50,250 INFO L226 Difference]: Without dead ends: 3713 [2019-10-03 02:50:50,250 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-10-03 02:50:50,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3713 states. [2019-10-03 02:50:50,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3713 to 3713. [2019-10-03 02:50:50,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3713 states. [2019-10-03 02:50:50,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3713 states to 3713 states and 5957 transitions. [2019-10-03 02:50:50,357 INFO L78 Accepts]: Start accepts. Automaton has 3713 states and 5957 transitions. Word has length 211 [2019-10-03 02:50:50,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:50,358 INFO L475 AbstractCegarLoop]: Abstraction has 3713 states and 5957 transitions. [2019-10-03 02:50:50,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-03 02:50:50,358 INFO L276 IsEmpty]: Start isEmpty. Operand 3713 states and 5957 transitions. [2019-10-03 02:50:50,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-10-03 02:50:50,378 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:50,379 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:50,379 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:50,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:50,380 INFO L82 PathProgramCache]: Analyzing trace with hash -671262686, now seen corresponding path program 1 times [2019-10-03 02:50:50,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:50,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:50,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:50,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:50,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:50,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:50,542 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:50:50,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:50,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:50:50,543 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:50,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:50:50,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:50:50,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:50:50,545 INFO L87 Difference]: Start difference. First operand 3713 states and 5957 transitions. Second operand 5 states. [2019-10-03 02:50:51,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:51,647 INFO L93 Difference]: Finished difference Result 6567 states and 10492 transitions. [2019-10-03 02:50:51,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:50:51,647 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 211 [2019-10-03 02:50:51,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:51,678 INFO L225 Difference]: With dead ends: 6567 [2019-10-03 02:50:51,678 INFO L226 Difference]: Without dead ends: 6567 [2019-10-03 02:50:51,679 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:50:51,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6567 states. [2019-10-03 02:50:51,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6567 to 6549. [2019-10-03 02:50:51,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6549 states. [2019-10-03 02:50:51,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6549 states to 6549 states and 10468 transitions. [2019-10-03 02:50:51,846 INFO L78 Accepts]: Start accepts. Automaton has 6549 states and 10468 transitions. Word has length 211 [2019-10-03 02:50:51,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:51,847 INFO L475 AbstractCegarLoop]: Abstraction has 6549 states and 10468 transitions. [2019-10-03 02:50:51,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:50:51,847 INFO L276 IsEmpty]: Start isEmpty. Operand 6549 states and 10468 transitions. [2019-10-03 02:50:51,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-10-03 02:50:51,884 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:51,885 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:51,885 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:51,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:51,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1154938013, now seen corresponding path program 1 times [2019-10-03 02:50:51,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:51,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:51,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:51,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:51,890 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:52,080 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:50:52,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:52,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:50:52,081 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:52,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:50:52,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:50:52,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:50:52,082 INFO L87 Difference]: Start difference. First operand 6549 states and 10468 transitions. Second operand 7 states. [2019-10-03 02:50:54,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:54,031 INFO L93 Difference]: Finished difference Result 11267 states and 17846 transitions. [2019-10-03 02:50:54,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-03 02:50:54,034 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 211 [2019-10-03 02:50:54,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:54,080 INFO L225 Difference]: With dead ends: 11267 [2019-10-03 02:50:54,080 INFO L226 Difference]: Without dead ends: 11267 [2019-10-03 02:50:54,081 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-03 02:50:54,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11267 states. [2019-10-03 02:50:54,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11267 to 11257. [2019-10-03 02:50:54,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11257 states. [2019-10-03 02:50:54,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11257 states to 11257 states and 17832 transitions. [2019-10-03 02:50:54,420 INFO L78 Accepts]: Start accepts. Automaton has 11257 states and 17832 transitions. Word has length 211 [2019-10-03 02:50:54,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:54,421 INFO L475 AbstractCegarLoop]: Abstraction has 11257 states and 17832 transitions. [2019-10-03 02:50:54,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:50:54,421 INFO L276 IsEmpty]: Start isEmpty. Operand 11257 states and 17832 transitions. [2019-10-03 02:50:54,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-03 02:50:54,439 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:54,439 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:54,440 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:54,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:54,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1728661351, now seen corresponding path program 1 times [2019-10-03 02:50:54,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:54,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:54,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:54,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:54,445 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:54,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:55,533 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:50:55,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:55,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-10-03 02:50:55,537 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:55,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-03 02:50:55,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-03 02:50:55,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-10-03 02:50:55,540 INFO L87 Difference]: Start difference. First operand 11257 states and 17832 transitions. Second operand 26 states. [2019-10-03 02:50:56,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:56,392 INFO L93 Difference]: Finished difference Result 12212 states and 19228 transitions. [2019-10-03 02:50:56,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-03 02:50:56,393 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 212 [2019-10-03 02:50:56,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:56,443 INFO L225 Difference]: With dead ends: 12212 [2019-10-03 02:50:56,443 INFO L226 Difference]: Without dead ends: 12212 [2019-10-03 02:50:56,444 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=93, Invalid=1239, Unknown=0, NotChecked=0, Total=1332 [2019-10-03 02:50:56,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12212 states. [2019-10-03 02:50:56,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12212 to 12195. [2019-10-03 02:50:56,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12195 states. [2019-10-03 02:50:56,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12195 states to 12195 states and 19211 transitions. [2019-10-03 02:50:56,818 INFO L78 Accepts]: Start accepts. Automaton has 12195 states and 19211 transitions. Word has length 212 [2019-10-03 02:50:56,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:56,818 INFO L475 AbstractCegarLoop]: Abstraction has 12195 states and 19211 transitions. [2019-10-03 02:50:56,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-03 02:50:56,819 INFO L276 IsEmpty]: Start isEmpty. Operand 12195 states and 19211 transitions. [2019-10-03 02:50:56,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-10-03 02:50:56,836 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:56,837 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:56,837 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:56,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:56,838 INFO L82 PathProgramCache]: Analyzing trace with hash -925986545, now seen corresponding path program 1 times [2019-10-03 02:50:56,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:56,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:56,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:56,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:56,842 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:57,032 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:50:57,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:57,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:50:57,033 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:57,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:50:57,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:50:57,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:50:57,034 INFO L87 Difference]: Start difference. First operand 12195 states and 19211 transitions. Second operand 10 states. [2019-10-03 02:50:57,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:57,133 INFO L93 Difference]: Finished difference Result 12291 states and 19299 transitions. [2019-10-03 02:50:57,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:50:57,134 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 216 [2019-10-03 02:50:57,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:57,182 INFO L225 Difference]: With dead ends: 12291 [2019-10-03 02:50:57,183 INFO L226 Difference]: Without dead ends: 12291 [2019-10-03 02:50:57,184 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:50:57,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12291 states. [2019-10-03 02:50:57,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12291 to 12291. [2019-10-03 02:50:57,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12291 states. [2019-10-03 02:50:57,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12291 states to 12291 states and 19299 transitions. [2019-10-03 02:50:57,738 INFO L78 Accepts]: Start accepts. Automaton has 12291 states and 19299 transitions. Word has length 216 [2019-10-03 02:50:57,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:57,739 INFO L475 AbstractCegarLoop]: Abstraction has 12291 states and 19299 transitions. [2019-10-03 02:50:57,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:50:57,739 INFO L276 IsEmpty]: Start isEmpty. Operand 12291 states and 19299 transitions. [2019-10-03 02:50:57,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-10-03 02:50:57,757 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:57,757 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:57,757 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:57,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:57,758 INFO L82 PathProgramCache]: Analyzing trace with hash -17024576, now seen corresponding path program 1 times [2019-10-03 02:50:57,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:57,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:57,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:57,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:57,761 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:57,890 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:50:57,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:57,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:50:57,891 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:57,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:50:57,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:50:57,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:50:57,892 INFO L87 Difference]: Start difference. First operand 12291 states and 19299 transitions. Second operand 5 states. [2019-10-03 02:50:57,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:57,984 INFO L93 Difference]: Finished difference Result 12654 states and 20238 transitions. [2019-10-03 02:50:57,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:50:57,984 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 221 [2019-10-03 02:50:57,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:58,030 INFO L225 Difference]: With dead ends: 12654 [2019-10-03 02:50:58,030 INFO L226 Difference]: Without dead ends: 12654 [2019-10-03 02:50:58,031 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:50:58,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12654 states. [2019-10-03 02:50:58,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12654 to 12465. [2019-10-03 02:50:58,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12465 states. [2019-10-03 02:50:58,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12465 states to 12465 states and 19503 transitions. [2019-10-03 02:50:58,376 INFO L78 Accepts]: Start accepts. Automaton has 12465 states and 19503 transitions. Word has length 221 [2019-10-03 02:50:58,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:58,377 INFO L475 AbstractCegarLoop]: Abstraction has 12465 states and 19503 transitions. [2019-10-03 02:50:58,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:50:58,377 INFO L276 IsEmpty]: Start isEmpty. Operand 12465 states and 19503 transitions. [2019-10-03 02:50:58,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-10-03 02:50:58,394 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:58,396 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:58,396 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:58,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:58,396 INFO L82 PathProgramCache]: Analyzing trace with hash 2066975880, now seen corresponding path program 1 times [2019-10-03 02:50:58,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:58,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:58,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:58,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:58,400 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:58,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:58,615 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:50:58,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:58,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:50:58,616 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:58,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:50:58,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:50:58,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:50:58,617 INFO L87 Difference]: Start difference. First operand 12465 states and 19503 transitions. Second operand 11 states. [2019-10-03 02:50:59,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:59,091 INFO L93 Difference]: Finished difference Result 12489 states and 19493 transitions. [2019-10-03 02:50:59,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:50:59,092 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 221 [2019-10-03 02:50:59,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:59,149 INFO L225 Difference]: With dead ends: 12489 [2019-10-03 02:50:59,149 INFO L226 Difference]: Without dead ends: 12489 [2019-10-03 02:50:59,150 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-10-03 02:50:59,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12489 states. [2019-10-03 02:50:59,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12489 to 12471. [2019-10-03 02:50:59,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12471 states. [2019-10-03 02:50:59,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12471 states to 12471 states and 19475 transitions. [2019-10-03 02:50:59,474 INFO L78 Accepts]: Start accepts. Automaton has 12471 states and 19475 transitions. Word has length 221 [2019-10-03 02:50:59,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:59,475 INFO L475 AbstractCegarLoop]: Abstraction has 12471 states and 19475 transitions. [2019-10-03 02:50:59,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:50:59,475 INFO L276 IsEmpty]: Start isEmpty. Operand 12471 states and 19475 transitions. [2019-10-03 02:51:00,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-10-03 02:51:00,059 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:51:00,059 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:51:00,059 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:51:00,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:51:00,060 INFO L82 PathProgramCache]: Analyzing trace with hash -359130090, now seen corresponding path program 1 times [2019-10-03 02:51:00,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:51:00,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:51:00,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:51:00,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:51:00,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:51:00,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:51:00,208 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:51:00,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:51:00,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:51:00,209 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:51:00,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:51:00,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:51:00,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:51:00,210 INFO L87 Difference]: Start difference. First operand 12471 states and 19475 transitions. Second operand 6 states. [2019-10-03 02:51:00,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:51:00,808 INFO L93 Difference]: Finished difference Result 25185 states and 40678 transitions. [2019-10-03 02:51:00,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:51:00,809 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 223 [2019-10-03 02:51:00,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:51:00,920 INFO L225 Difference]: With dead ends: 25185 [2019-10-03 02:51:00,921 INFO L226 Difference]: Without dead ends: 25185 [2019-10-03 02:51:00,921 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:51:00,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25185 states. [2019-10-03 02:51:01,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25185 to 24829. [2019-10-03 02:51:01,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24829 states. [2019-10-03 02:51:01,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24829 states to 24829 states and 39472 transitions. [2019-10-03 02:51:01,649 INFO L78 Accepts]: Start accepts. Automaton has 24829 states and 39472 transitions. Word has length 223 [2019-10-03 02:51:01,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:51:01,649 INFO L475 AbstractCegarLoop]: Abstraction has 24829 states and 39472 transitions. [2019-10-03 02:51:01,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:51:01,650 INFO L276 IsEmpty]: Start isEmpty. Operand 24829 states and 39472 transitions. [2019-10-03 02:51:01,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-03 02:51:01,685 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:51:01,685 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:51:01,685 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:51:01,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:51:01,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1514697324, now seen corresponding path program 1 times [2019-10-03 02:51:01,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:51:01,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:51:01,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:51:01,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:51:01,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:51:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:51:01,887 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:51:01,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:51:01,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:51:01,888 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:51:01,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:51:01,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:51:01,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:51:01,890 INFO L87 Difference]: Start difference. First operand 24829 states and 39472 transitions. Second operand 8 states. [2019-10-03 02:51:06,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:51:06,787 INFO L93 Difference]: Finished difference Result 50337 states and 86173 transitions. [2019-10-03 02:51:06,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:51:06,787 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 258 [2019-10-03 02:51:06,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:51:06,989 INFO L225 Difference]: With dead ends: 50337 [2019-10-03 02:51:06,989 INFO L226 Difference]: Without dead ends: 50337 [2019-10-03 02:51:06,989 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-03 02:51:07,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50337 states. [2019-10-03 02:51:08,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50337 to 33661. [2019-10-03 02:51:08,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33661 states. [2019-10-03 02:51:08,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33661 states to 33661 states and 59518 transitions. [2019-10-03 02:51:08,342 INFO L78 Accepts]: Start accepts. Automaton has 33661 states and 59518 transitions. Word has length 258 [2019-10-03 02:51:08,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:51:08,343 INFO L475 AbstractCegarLoop]: Abstraction has 33661 states and 59518 transitions. [2019-10-03 02:51:08,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:51:08,343 INFO L276 IsEmpty]: Start isEmpty. Operand 33661 states and 59518 transitions. [2019-10-03 02:51:08,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-10-03 02:51:08,415 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:51:08,415 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:51:08,415 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:51:08,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:51:08,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1665358554, now seen corresponding path program 1 times [2019-10-03 02:51:08,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:51:08,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:51:08,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:51:08,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:51:08,420 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:51:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:51:08,601 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-03 02:51:08,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:51:08,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:51:08,601 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:51:08,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:51:08,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:51:08,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:51:08,603 INFO L87 Difference]: Start difference. First operand 33661 states and 59518 transitions. Second operand 8 states. [2019-10-03 02:51:15,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:51:15,901 INFO L93 Difference]: Finished difference Result 68805 states and 133735 transitions. [2019-10-03 02:51:15,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:51:15,902 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 244 [2019-10-03 02:51:15,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:51:16,363 INFO L225 Difference]: With dead ends: 68805 [2019-10-03 02:51:16,364 INFO L226 Difference]: Without dead ends: 68805 [2019-10-03 02:51:16,365 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-03 02:51:16,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68805 states. [2019-10-03 02:51:18,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68805 to 51505. [2019-10-03 02:51:18,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51505 states. [2019-10-03 02:51:18,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51505 states to 51505 states and 103942 transitions. [2019-10-03 02:51:18,672 INFO L78 Accepts]: Start accepts. Automaton has 51505 states and 103942 transitions. Word has length 244 [2019-10-03 02:51:18,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:51:18,672 INFO L475 AbstractCegarLoop]: Abstraction has 51505 states and 103942 transitions. [2019-10-03 02:51:18,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:51:18,672 INFO L276 IsEmpty]: Start isEmpty. Operand 51505 states and 103942 transitions. [2019-10-03 02:51:18,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-10-03 02:51:18,857 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:51:18,857 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:51:18,858 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:51:18,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:51:18,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1817454632, now seen corresponding path program 1 times [2019-10-03 02:51:18,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:51:18,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:51:18,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:51:18,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:51:18,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:51:18,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:51:19,102 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:51:19,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:51:19,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:51:19,102 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:51:19,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:51:19,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:51:19,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:51:19,104 INFO L87 Difference]: Start difference. First operand 51505 states and 103942 transitions. Second operand 8 states. [2019-10-03 02:51:25,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:51:25,487 INFO L93 Difference]: Finished difference Result 105969 states and 237457 transitions. [2019-10-03 02:51:25,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:51:25,487 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 260 [2019-10-03 02:51:25,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:51:26,038 INFO L225 Difference]: With dead ends: 105969 [2019-10-03 02:51:26,038 INFO L226 Difference]: Without dead ends: 105969 [2019-10-03 02:51:26,039 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-03 02:51:26,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105969 states. [2019-10-03 02:51:29,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105969 to 87385. [2019-10-03 02:51:29,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87385 states. [2019-10-03 02:51:33,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87385 states to 87385 states and 201244 transitions. [2019-10-03 02:51:33,305 INFO L78 Accepts]: Start accepts. Automaton has 87385 states and 201244 transitions. Word has length 260 [2019-10-03 02:51:33,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:51:33,305 INFO L475 AbstractCegarLoop]: Abstraction has 87385 states and 201244 transitions. [2019-10-03 02:51:33,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:51:33,306 INFO L276 IsEmpty]: Start isEmpty. Operand 87385 states and 201244 transitions. [2019-10-03 02:51:33,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-10-03 02:51:33,717 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:51:33,717 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:51:33,717 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:51:33,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:51:33,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1829537673, now seen corresponding path program 1 times [2019-10-03 02:51:33,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:51:33,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:51:33,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:51:33,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:51:33,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:51:33,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:51:33,908 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:51:33,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:51:33,909 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:51:33,911 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 242 with the following transitions: [2019-10-03 02:51:33,914 INFO L207 CegarAbsIntRunner]: [59], [62], [72], [96], [99], [109], [110], [126], [129], [130], [133], [142], [143], [144], [146], [242], [245], [251], [256], [258], [262], [265], [266], [267], [270], [276], [300], [302], [304], [311], [315], [317], [328], [331], [340], [341], [343], [346], [350], [351], [353], [354], [357], [367], [368], [369], [380], [382], [387], [391], [394], [397], [420], [421], [424], [433], [605], [607], [608], [609], [645], [648], [662], [691], [692], [693], [695], [708], [711], [717], [731], [735], [738], [756], [759], [770], [792], [794], [797], [799], [802], [804], [806], [809], [825], [834], [838], [840], [842], [845], [852], [859], [862], [864], [1000], [1003], [1017], [1125], [1179], [1181], [1198], [1220], [1231], [1234], [1235], [1238], [1242], [1246], [1272], [1275], [1277], [1346], [1349], [1359], [1360], [1363], [1369], [1390], [1393], [1407], [1415], [1418], [1427], [1621], [1623], [1625], [1627], [1628], [1650], [1660], [1661], [1662], [1663], [1664], [1665], [1668], [1669], [1670], [1671], [1672], [1674], [1675], [1676], [1677], [1684], [1685], [1686], [1687], [1692], [1694], [1695], [1700], [1701], [1704], [1705], [1710], [1711], [1712], [1714], [1715], [1716], [1717], [1718], [1720], [1721], [1738], [1739], [1752], [1753], [1754], [1756], [1757], [1758], [1759], [1760], [1761], [1762], [1763], [1764], [1766], [1767], [1768], [1769], [1778], [1786], [1787], [1788], [1789], [1790], [1791], [1792], [1793], [1794], [1795], [1796], [1797], [1798], [1804], [1805], [1822], [1824], [1825], [1842], [1844], [1845], [1846], [1847], [1848], [1849], [1850], [1872], [1873], [1874], [1875], [1876], [1877], [1878], [1879], [1880] [2019-10-03 02:51:33,985 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:51:33,986 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:51:34,126 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:51:34,127 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 201 root evaluator evaluations with a maximum evaluation depth of 0. Performed 201 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 368 variables. [2019-10-03 02:51:34,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:51:34,133 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:51:34,224 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-03 02:51:34,224 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:51:34,231 INFO L420 sIntCurrentIteration]: We unified 240 AI predicates to 240 [2019-10-03 02:51:34,231 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:51:34,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:51:34,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2019-10-03 02:51:34,233 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:51:34,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:51:34,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:51:34,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:51:34,234 INFO L87 Difference]: Start difference. First operand 87385 states and 201244 transitions. Second operand 2 states. [2019-10-03 02:51:34,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:51:34,235 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-03 02:51:34,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:51:34,235 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 241 [2019-10-03 02:51:34,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:51:34,236 INFO L225 Difference]: With dead ends: 2 [2019-10-03 02:51:34,236 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:51:34,236 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:51:34,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:51:34,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:51:34,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:51:34,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:51:34,237 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 241 [2019-10-03 02:51:34,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:51:34,237 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:51:34,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:51:34,238 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:51:34,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:51:34,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:51:34 BoogieIcfgContainer [2019-10-03 02:51:34,243 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:51:34,246 INFO L168 Benchmark]: Toolchain (without parser) took 71300.27 ms. Allocated memory was 131.1 MB in the beginning and 2.4 GB in the end (delta: 2.3 GB). Free memory was 84.2 MB in the beginning and 1.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-10-03 02:51:34,247 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 131.1 MB. Free memory was 105.2 MB in the beginning and 105.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:51:34,248 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1124.73 ms. Allocated memory was 131.1 MB in the beginning and 200.3 MB in the end (delta: 69.2 MB). Free memory was 84.0 MB in the beginning and 128.5 MB in the end (delta: -44.5 MB). Peak memory consumption was 32.8 MB. Max. memory is 7.1 GB. [2019-10-03 02:51:34,249 INFO L168 Benchmark]: Boogie Preprocessor took 229.14 ms. Allocated memory is still 200.3 MB. Free memory was 128.5 MB in the beginning and 119.5 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. [2019-10-03 02:51:34,250 INFO L168 Benchmark]: RCFGBuilder took 2103.08 ms. Allocated memory was 200.3 MB in the beginning and 272.1 MB in the end (delta: 71.8 MB). Free memory was 119.5 MB in the beginning and 172.9 MB in the end (delta: -53.4 MB). Peak memory consumption was 80.6 MB. Max. memory is 7.1 GB. [2019-10-03 02:51:34,250 INFO L168 Benchmark]: TraceAbstraction took 67834.31 ms. Allocated memory was 272.1 MB in the beginning and 2.4 GB in the end (delta: 2.1 GB). Free memory was 170.6 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 961.9 MB. Max. memory is 7.1 GB. [2019-10-03 02:51:34,254 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.21 ms. Allocated memory is still 131.1 MB. Free memory was 105.2 MB in the beginning and 105.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1124.73 ms. Allocated memory was 131.1 MB in the beginning and 200.3 MB in the end (delta: 69.2 MB). Free memory was 84.0 MB in the beginning and 128.5 MB in the end (delta: -44.5 MB). Peak memory consumption was 32.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 229.14 ms. Allocated memory is still 200.3 MB. Free memory was 128.5 MB in the beginning and 119.5 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2103.08 ms. Allocated memory was 200.3 MB in the beginning and 272.1 MB in the end (delta: 71.8 MB). Free memory was 119.5 MB in the beginning and 172.9 MB in the end (delta: -53.4 MB). Peak memory consumption was 80.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 67834.31 ms. Allocated memory was 272.1 MB in the beginning and 2.4 GB in the end (delta: 2.1 GB). Free memory was 170.6 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 961.9 MB. 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, 768 locations, 1 error locations. SAFE Result, 67.7s OverallTime, 24 OverallIterations, 3 TraceHistogramMax, 43.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 19138 SDtfs, 14947 SDslu, 112738 SDs, 0 SdLazy, 26725 SolverSat, 3511 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 30.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 685 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 342 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2110 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87385occurred in iteration=23, 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.025 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 14.8s AutomataMinimizationTime, 24 MinimizatonAttempts, 53296 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 5205 NumberOfCodeBlocks, 5205 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 5181 ConstructedInterpolants, 0 QuantifiedInterpolants, 1522756 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 23 PerfectInterpolantSequences, 831/833 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...