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_spec0_product21.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:47:52,880 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:47:52,883 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:47:52,895 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:47:52,895 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:47:52,896 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:47:52,898 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:47:52,900 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:47:52,901 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:47:52,902 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:47:52,903 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:47:52,905 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:47:52,905 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:47:52,906 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:47:52,907 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:47:52,908 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:47:52,909 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:47:52,910 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:47:52,912 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:47:52,914 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:47:52,916 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:47:52,917 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:47:52,918 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:47:52,919 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:47:52,925 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:47:52,925 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:47:52,925 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:47:52,926 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:47:52,927 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:47:52,928 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:47:52,928 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:47:52,929 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:47:52,929 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:47:52,930 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:47:52,931 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:47:52,931 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:47:52,932 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:47:52,932 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:47:52,932 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:47:52,933 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:47:52,934 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:47:52,935 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:47:52,950 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:47:52,951 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:47:52,951 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:47:52,951 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:47:52,952 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:47:52,952 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:47:52,952 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:47:52,953 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:47:52,953 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:47:52,953 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:47:52,954 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:47:52,954 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:47:52,954 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:47:52,954 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:47:52,955 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:47:52,955 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:47:52,955 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:47:52,955 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:47:52,955 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:47:52,956 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:47:52,956 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:47:52,956 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:47:52,956 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:47:52,956 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:47:52,957 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:47:52,957 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:47:52,957 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:47:52,957 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:47:52,958 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:47:52,958 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:47:52,988 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:47:53,008 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:47:53,012 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:47:53,014 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:47:53,014 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:47:53,015 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec0_product21.cil.c [2019-10-03 02:47:53,085 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c8152d18/118e318a43fb465aaebb599e902012c8/FLAG6c038e4f3 [2019-10-03 02:47:53,757 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:47:53,759 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec0_product21.cil.c [2019-10-03 02:47:53,785 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c8152d18/118e318a43fb465aaebb599e902012c8/FLAG6c038e4f3 [2019-10-03 02:47:53,937 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c8152d18/118e318a43fb465aaebb599e902012c8 [2019-10-03 02:47:53,946 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:47:53,948 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:47:53,949 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:47:53,950 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:47:53,954 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:47:53,955 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:47:53" (1/1) ... [2019-10-03 02:47:53,960 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7201854e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:47:53, skipping insertion in model container [2019-10-03 02:47:53,961 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:47:53" (1/1) ... [2019-10-03 02:47:53,969 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:47:54,061 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:47:54,888 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:47:54,914 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:47:55,161 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:47:55,272 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:47:55,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:47:55 WrapperNode [2019-10-03 02:47:55,272 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:47:55,273 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:47:55,274 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:47:55,274 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:47:55,289 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:47:55" (1/1) ... [2019-10-03 02:47:55,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:47:55" (1/1) ... [2019-10-03 02:47:55,325 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:47:55" (1/1) ... [2019-10-03 02:47:55,325 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:47:55" (1/1) ... [2019-10-03 02:47:55,383 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:47:55" (1/1) ... [2019-10-03 02:47:55,411 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:47:55" (1/1) ... [2019-10-03 02:47:55,426 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:47:55" (1/1) ... [2019-10-03 02:47:55,455 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:47:55,455 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:47:55,456 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:47:55,456 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:47:55,459 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:47:55" (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:47:55,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:47:55,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:47:55,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-03 02:47:55,531 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-03 02:47:55,531 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-03 02:47:55,532 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-03 02:47:55,532 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-03 02:47:55,532 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-03 02:47:55,533 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-03 02:47:55,533 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-03 02:47:55,533 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-03 02:47:55,533 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-03 02:47:55,534 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-03 02:47:55,534 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-03 02:47:55,534 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-03 02:47:55,534 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-03 02:47:55,535 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-03 02:47:55,535 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-03 02:47:55,535 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-03 02:47:55,536 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-03 02:47:55,536 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-03 02:47:55,537 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-03 02:47:55,537 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-03 02:47:55,537 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-03 02:47:55,537 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-03 02:47:55,538 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-03 02:47:55,538 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-03 02:47:55,538 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-03 02:47:55,538 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-03 02:47:55,539 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-03 02:47:55,539 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-03 02:47:55,539 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-03 02:47:55,539 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-03 02:47:55,540 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-03 02:47:55,540 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-03 02:47:55,540 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-03 02:47:55,540 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-03 02:47:55,540 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-03 02:47:55,541 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-03 02:47:55,541 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-03 02:47:55,541 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-03 02:47:55,541 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-03 02:47:55,541 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-03 02:47:55,542 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-03 02:47:55,542 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-03 02:47:55,542 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-03 02:47:55,542 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-03 02:47:55,542 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-03 02:47:55,542 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-03 02:47:55,543 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-03 02:47:55,543 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-03 02:47:55,543 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-03 02:47:55,543 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-03 02:47:55,544 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-03 02:47:55,544 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-03 02:47:55,544 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-03 02:47:55,544 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-03 02:47:55,545 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-03 02:47:55,545 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-03 02:47:55,545 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-03 02:47:55,545 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-03 02:47:55,546 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-03 02:47:55,546 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-03 02:47:55,546 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-03 02:47:55,546 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-03 02:47:55,547 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-03 02:47:55,547 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__DecryptForward_spec__1 [2019-10-03 02:47:55,547 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-03 02:47:55,547 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-03 02:47:55,548 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-03 02:47:55,548 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-03 02:47:55,548 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-03 02:47:55,548 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-03 02:47:55,548 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-03 02:47:55,549 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-03 02:47:55,549 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-03 02:47:55,549 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:47:55,549 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-03 02:47:55,549 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-03 02:47:55,550 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-03 02:47:55,550 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-03 02:47:55,550 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-03 02:47:55,550 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-03 02:47:55,550 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-03 02:47:55,551 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-03 02:47:55,551 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-03 02:47:55,551 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-03 02:47:55,551 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-03 02:47:55,551 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-03 02:47:55,551 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-03 02:47:55,552 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2019-10-03 02:47:55,552 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-03 02:47:55,552 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-03 02:47:55,552 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AddressBook [2019-10-03 02:47:55,552 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-10-03 02:47:55,552 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-03 02:47:55,553 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-03 02:47:55,553 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-03 02:47:55,553 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-03 02:47:55,553 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-03 02:47:55,554 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-03 02:47:55,554 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-03 02:47:55,554 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-03 02:47:55,554 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-03 02:47:55,555 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-03 02:47:55,555 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-03 02:47:55,555 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-03 02:47:55,555 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-03 02:47:55,556 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-03 02:47:55,556 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-03 02:47:55,556 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-03 02:47:55,556 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-03 02:47:55,557 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:47:55,557 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:47:55,557 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-03 02:47:55,557 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-03 02:47:55,557 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-03 02:47:55,557 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-03 02:47:55,558 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-03 02:47:55,558 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-03 02:47:55,558 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-03 02:47:55,558 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-03 02:47:55,558 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-03 02:47:55,558 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-03 02:47:55,559 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-03 02:47:55,559 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-03 02:47:55,559 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-03 02:47:55,559 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-03 02:47:55,559 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-03 02:47:55,559 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-03 02:47:55,560 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-03 02:47:55,560 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-03 02:47:55,560 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-03 02:47:55,560 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-03 02:47:55,560 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-03 02:47:55,561 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-03 02:47:55,561 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-03 02:47:55,561 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-03 02:47:55,561 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-03 02:47:55,561 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-03 02:47:55,561 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-03 02:47:55,562 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-03 02:47:55,562 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-03 02:47:55,562 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-03 02:47:55,562 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-03 02:47:55,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:47:55,562 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-03 02:47:55,563 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-03 02:47:55,563 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-03 02:47:55,563 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-03 02:47:55,563 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-03 02:47:55,563 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-03 02:47:55,563 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-03 02:47:55,564 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-03 02:47:55,564 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-03 02:47:55,564 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-03 02:47:55,564 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-03 02:47:55,564 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-03 02:47:55,564 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-03 02:47:55,564 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-03 02:47:55,564 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-03 02:47:55,565 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-03 02:47:55,565 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-03 02:47:55,565 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-03 02:47:55,565 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-03 02:47:55,565 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-03 02:47:55,565 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-03 02:47:55,566 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-03 02:47:55,566 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:47:55,566 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:47:55,566 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-03 02:47:55,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:47:55,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:47:55,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:47:55,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:47:55,567 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-03 02:47:55,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:47:55,567 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-03 02:47:55,567 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-03 02:47:55,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:47:55,567 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-03 02:47:55,568 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-03 02:47:55,568 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-03 02:47:55,568 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-03 02:47:55,568 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-03 02:47:55,568 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-03 02:47:55,568 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-03 02:47:55,568 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-03 02:47:55,568 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-03 02:47:55,569 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-03 02:47:55,569 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-03 02:47:55,569 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-03 02:47:55,569 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-03 02:47:55,569 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-03 02:47:55,569 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-03 02:47:55,570 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-03 02:47:55,570 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-03 02:47:55,570 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-03 02:47:55,570 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-03 02:47:55,570 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-03 02:47:55,570 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-03 02:47:55,570 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__DecryptForward_spec__1 [2019-10-03 02:47:55,570 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-03 02:47:55,571 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-03 02:47:55,571 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-03 02:47:55,571 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-03 02:47:55,571 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-03 02:47:55,571 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-03 02:47:55,571 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-03 02:47:55,571 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-03 02:47:55,572 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-03 02:47:55,572 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-03 02:47:55,572 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-03 02:47:55,572 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:47:55,572 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-03 02:47:55,572 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-03 02:47:55,573 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-03 02:47:55,573 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-03 02:47:55,573 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-03 02:47:55,573 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-03 02:47:55,573 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-03 02:47:55,573 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-03 02:47:55,574 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-03 02:47:55,574 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-03 02:47:55,574 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-03 02:47:55,574 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-03 02:47:55,574 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-03 02:47:55,574 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-03 02:47:55,575 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-03 02:47:55,575 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-03 02:47:55,575 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2019-10-03 02:47:55,575 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AddressBook [2019-10-03 02:47:55,576 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-10-03 02:47:55,576 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-03 02:47:55,576 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-03 02:47:55,577 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-03 02:47:55,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:47:55,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:47:55,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:47:57,887 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:47:57,888 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-03 02:47:57,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:47:57 BoogieIcfgContainer [2019-10-03 02:47:57,889 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:47:57,891 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:47:57,891 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:47:57,894 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:47:57,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:47:53" (1/3) ... [2019-10-03 02:47:57,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67a5a62e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:47:57, skipping insertion in model container [2019-10-03 02:47:57,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:47:55" (2/3) ... [2019-10-03 02:47:57,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67a5a62e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:47:57, skipping insertion in model container [2019-10-03 02:47:57,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:47:57" (3/3) ... [2019-10-03 02:47:57,897 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec0_product21.cil.c [2019-10-03 02:47:57,906 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:47:57,916 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:47:57,932 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:47:57,952 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:47:57,953 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:47:57,953 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:47:57,953 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:47:57,953 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:47:57,953 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:47:57,953 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:47:57,954 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:47:57,989 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states. [2019-10-03 02:47:58,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-03 02:47:58,034 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:58,035 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:47:58,039 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:58,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:58,046 INFO L82 PathProgramCache]: Analyzing trace with hash -2004789445, now seen corresponding path program 1 times [2019-10-03 02:47:58,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:58,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:58,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:58,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:58,115 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:58,726 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:47:58,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:58,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-03 02:47:58,729 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:58,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:47:58,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:47:58,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:47:58,754 INFO L87 Difference]: Start difference. First operand 566 states. Second operand 2 states. [2019-10-03 02:47:58,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:58,805 INFO L93 Difference]: Finished difference Result 546 states and 744 transitions. [2019-10-03 02:47:58,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:47:58,806 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 198 [2019-10-03 02:47:58,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:58,831 INFO L225 Difference]: With dead ends: 546 [2019-10-03 02:47:58,831 INFO L226 Difference]: Without dead ends: 537 [2019-10-03 02:47:58,836 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:47:58,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-10-03 02:47:58,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2019-10-03 02:47:58,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-10-03 02:47:58,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 733 transitions. [2019-10-03 02:47:58,945 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 733 transitions. Word has length 198 [2019-10-03 02:47:58,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:58,947 INFO L475 AbstractCegarLoop]: Abstraction has 537 states and 733 transitions. [2019-10-03 02:47:58,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:47:58,948 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 733 transitions. [2019-10-03 02:47:58,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-03 02:47:58,955 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:58,955 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:47:58,955 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:58,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:58,956 INFO L82 PathProgramCache]: Analyzing trace with hash -24862393, now seen corresponding path program 1 times [2019-10-03 02:47:58,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:58,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:58,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:58,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:58,961 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:59,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:59,231 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:47:59,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:59,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:47:59,232 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:59,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:47:59,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:47:59,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:47:59,239 INFO L87 Difference]: Start difference. First operand 537 states and 733 transitions. Second operand 3 states. [2019-10-03 02:47:59,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:59,318 INFO L93 Difference]: Finished difference Result 540 states and 736 transitions. [2019-10-03 02:47:59,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:47:59,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2019-10-03 02:47:59,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:59,334 INFO L225 Difference]: With dead ends: 540 [2019-10-03 02:47:59,334 INFO L226 Difference]: Without dead ends: 540 [2019-10-03 02:47:59,335 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:47:59,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-10-03 02:47:59,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 539. [2019-10-03 02:47:59,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2019-10-03 02:47:59,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 735 transitions. [2019-10-03 02:47:59,389 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 735 transitions. Word has length 199 [2019-10-03 02:47:59,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:59,391 INFO L475 AbstractCegarLoop]: Abstraction has 539 states and 735 transitions. [2019-10-03 02:47:59,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:47:59,392 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 735 transitions. [2019-10-03 02:47:59,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-10-03 02:47:59,400 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:59,401 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:47:59,401 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:59,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:59,402 INFO L82 PathProgramCache]: Analyzing trace with hash 712401851, now seen corresponding path program 1 times [2019-10-03 02:47:59,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:59,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:59,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:59,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:59,407 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:59,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:59,700 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:47:59,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:59,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:47:59,700 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:59,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:47:59,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:47:59,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:47:59,702 INFO L87 Difference]: Start difference. First operand 539 states and 735 transitions. Second operand 3 states. [2019-10-03 02:47:59,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:59,734 INFO L93 Difference]: Finished difference Result 582 states and 808 transitions. [2019-10-03 02:47:59,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:47:59,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-10-03 02:47:59,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:59,743 INFO L225 Difference]: With dead ends: 582 [2019-10-03 02:47:59,743 INFO L226 Difference]: Without dead ends: 582 [2019-10-03 02:47:59,744 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:47:59,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-10-03 02:47:59,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 581. [2019-10-03 02:47:59,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 581 states. [2019-10-03 02:47:59,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 807 transitions. [2019-10-03 02:47:59,778 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 807 transitions. Word has length 205 [2019-10-03 02:47:59,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:59,780 INFO L475 AbstractCegarLoop]: Abstraction has 581 states and 807 transitions. [2019-10-03 02:47:59,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:47:59,780 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 807 transitions. [2019-10-03 02:47:59,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-10-03 02:47:59,788 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:59,788 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:47:59,789 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:59,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:59,789 INFO L82 PathProgramCache]: Analyzing trace with hash -2088954863, now seen corresponding path program 1 times [2019-10-03 02:47:59,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:59,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:59,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:59,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:59,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:59,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:48:00,390 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:48:00,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:48:00,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-03 02:48:00,391 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:48:00,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-03 02:48:00,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-03 02:48:00,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-10-03 02:48:00,394 INFO L87 Difference]: Start difference. First operand 581 states and 807 transitions. Second operand 19 states. [2019-10-03 02:48:05,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:48:05,516 INFO L93 Difference]: Finished difference Result 1691 states and 2371 transitions. [2019-10-03 02:48:05,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-03 02:48:05,517 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 206 [2019-10-03 02:48:05,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:48:05,532 INFO L225 Difference]: With dead ends: 1691 [2019-10-03 02:48:05,532 INFO L226 Difference]: Without dead ends: 1691 [2019-10-03 02:48:05,534 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=287, Invalid=2683, Unknown=0, NotChecked=0, Total=2970 [2019-10-03 02:48:05,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2019-10-03 02:48:05,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 1654. [2019-10-03 02:48:05,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1654 states. [2019-10-03 02:48:05,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 2323 transitions. [2019-10-03 02:48:05,607 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 2323 transitions. Word has length 206 [2019-10-03 02:48:05,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:48:05,608 INFO L475 AbstractCegarLoop]: Abstraction has 1654 states and 2323 transitions. [2019-10-03 02:48:05,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-03 02:48:05,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 2323 transitions. [2019-10-03 02:48:05,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-10-03 02:48:05,616 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:48:05,616 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:48:05,617 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:48:05,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:48:05,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1909535068, now seen corresponding path program 1 times [2019-10-03 02:48:05,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:48:05,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:05,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:48:05,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:05,622 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:48:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:48:05,958 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-03 02:48:05,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:48:05,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-10-03 02:48:05,959 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:48:05,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-03 02:48:05,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-03 02:48:05,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-10-03 02:48:05,961 INFO L87 Difference]: Start difference. First operand 1654 states and 2323 transitions. Second operand 16 states. [2019-10-03 02:48:06,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:48:06,481 INFO L93 Difference]: Finished difference Result 1832 states and 2594 transitions. [2019-10-03 02:48:06,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-03 02:48:06,482 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 207 [2019-10-03 02:48:06,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:48:06,499 INFO L225 Difference]: With dead ends: 1832 [2019-10-03 02:48:06,499 INFO L226 Difference]: Without dead ends: 1824 [2019-10-03 02:48:06,500 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:48:06,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1824 states. [2019-10-03 02:48:06,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1824 to 1824. [2019-10-03 02:48:06,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1824 states. [2019-10-03 02:48:06,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 2576 transitions. [2019-10-03 02:48:06,599 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 2576 transitions. Word has length 207 [2019-10-03 02:48:06,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:48:06,600 INFO L475 AbstractCegarLoop]: Abstraction has 1824 states and 2576 transitions. [2019-10-03 02:48:06,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-03 02:48:06,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2576 transitions. [2019-10-03 02:48:06,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-10-03 02:48:06,612 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:48:06,612 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:48:06,613 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:48:06,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:48:06,614 INFO L82 PathProgramCache]: Analyzing trace with hash 392350703, now seen corresponding path program 1 times [2019-10-03 02:48:06,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:48:06,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:06,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:48:06,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:06,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:48:06,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:48:07,004 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:48:07,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:48:07,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-03 02:48:07,006 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:48:07,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-03 02:48:07,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-03 02:48:07,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-03 02:48:07,008 INFO L87 Difference]: Start difference. First operand 1824 states and 2576 transitions. Second operand 15 states. [2019-10-03 02:48:10,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:48:10,919 INFO L93 Difference]: Finished difference Result 1924 states and 2722 transitions. [2019-10-03 02:48:10,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-03 02:48:10,920 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 207 [2019-10-03 02:48:10,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:48:10,932 INFO L225 Difference]: With dead ends: 1924 [2019-10-03 02:48:10,932 INFO L226 Difference]: Without dead ends: 1924 [2019-10-03 02:48:10,933 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=229, Invalid=1933, Unknown=0, NotChecked=0, Total=2162 [2019-10-03 02:48:10,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1924 states. [2019-10-03 02:48:11,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1924 to 1894. [2019-10-03 02:48:11,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1894 states. [2019-10-03 02:48:11,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 2689 transitions. [2019-10-03 02:48:11,024 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 2689 transitions. Word has length 207 [2019-10-03 02:48:11,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:48:11,028 INFO L475 AbstractCegarLoop]: Abstraction has 1894 states and 2689 transitions. [2019-10-03 02:48:11,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-03 02:48:11,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 2689 transitions. [2019-10-03 02:48:11,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-10-03 02:48:11,037 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:48:11,037 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:48:11,037 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:48:11,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:48:11,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1263804375, now seen corresponding path program 1 times [2019-10-03 02:48:11,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:48:11,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:11,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:48:11,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:11,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:48:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:48:11,277 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:48:11,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:48:11,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:48:11,278 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:48:11,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:48:11,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:48:11,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:48:11,279 INFO L87 Difference]: Start difference. First operand 1894 states and 2689 transitions. Second operand 5 states. [2019-10-03 02:48:12,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:48:12,417 INFO L93 Difference]: Finished difference Result 4065 states and 5754 transitions. [2019-10-03 02:48:12,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:48:12,418 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 207 [2019-10-03 02:48:12,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:48:12,443 INFO L225 Difference]: With dead ends: 4065 [2019-10-03 02:48:12,443 INFO L226 Difference]: Without dead ends: 4065 [2019-10-03 02:48:12,444 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:48:12,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4065 states. [2019-10-03 02:48:12,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4065 to 4047. [2019-10-03 02:48:12,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4047 states. [2019-10-03 02:48:12,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4047 states to 4047 states and 5732 transitions. [2019-10-03 02:48:12,624 INFO L78 Accepts]: Start accepts. Automaton has 4047 states and 5732 transitions. Word has length 207 [2019-10-03 02:48:12,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:48:12,625 INFO L475 AbstractCegarLoop]: Abstraction has 4047 states and 5732 transitions. [2019-10-03 02:48:12,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:48:12,626 INFO L276 IsEmpty]: Start isEmpty. Operand 4047 states and 5732 transitions. [2019-10-03 02:48:12,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-10-03 02:48:12,636 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:48:12,636 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:48:12,637 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:48:12,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:48:12,637 INFO L82 PathProgramCache]: Analyzing trace with hash -154989176, now seen corresponding path program 1 times [2019-10-03 02:48:12,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:48:12,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:12,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:48:12,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:12,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:48:12,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:48:12,968 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:48:12,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:48:12,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:48:12,969 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:48:12,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:48:12,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:48:12,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:48:12,971 INFO L87 Difference]: Start difference. First operand 4047 states and 5732 transitions. Second operand 6 states. [2019-10-03 02:48:13,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:48:13,528 INFO L93 Difference]: Finished difference Result 8129 states and 11520 transitions. [2019-10-03 02:48:13,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:48:13,529 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 207 [2019-10-03 02:48:13,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:48:13,578 INFO L225 Difference]: With dead ends: 8129 [2019-10-03 02:48:13,579 INFO L226 Difference]: Without dead ends: 8129 [2019-10-03 02:48:13,579 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:48:13,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8129 states. [2019-10-03 02:48:13,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8129 to 8086. [2019-10-03 02:48:13,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8086 states. [2019-10-03 02:48:13,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8086 states to 8086 states and 11458 transitions. [2019-10-03 02:48:13,918 INFO L78 Accepts]: Start accepts. Automaton has 8086 states and 11458 transitions. Word has length 207 [2019-10-03 02:48:13,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:48:13,918 INFO L475 AbstractCegarLoop]: Abstraction has 8086 states and 11458 transitions. [2019-10-03 02:48:13,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:48:13,919 INFO L276 IsEmpty]: Start isEmpty. Operand 8086 states and 11458 transitions. [2019-10-03 02:48:13,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-10-03 02:48:13,937 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:48:13,937 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] [2019-10-03 02:48:13,937 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:48:13,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:48:13,938 INFO L82 PathProgramCache]: Analyzing trace with hash 927792726, now seen corresponding path program 1 times [2019-10-03 02:48:13,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:48:13,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:13,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:48:13,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:13,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:48:14,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:48:14,184 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:48:14,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:48:14,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:48:14,185 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:48:14,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:48:14,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:48:14,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:48:14,186 INFO L87 Difference]: Start difference. First operand 8086 states and 11458 transitions. Second operand 9 states. [2019-10-03 02:48:14,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:48:14,375 INFO L93 Difference]: Finished difference Result 8776 states and 12498 transitions. [2019-10-03 02:48:14,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:48:14,375 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 208 [2019-10-03 02:48:14,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:48:14,427 INFO L225 Difference]: With dead ends: 8776 [2019-10-03 02:48:14,427 INFO L226 Difference]: Without dead ends: 8776 [2019-10-03 02:48:14,428 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:48:14,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8776 states. [2019-10-03 02:48:14,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8776 to 8716. [2019-10-03 02:48:14,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8716 states. [2019-10-03 02:48:14,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8716 states to 8716 states and 12428 transitions. [2019-10-03 02:48:14,812 INFO L78 Accepts]: Start accepts. Automaton has 8716 states and 12428 transitions. Word has length 208 [2019-10-03 02:48:14,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:48:14,813 INFO L475 AbstractCegarLoop]: Abstraction has 8716 states and 12428 transitions. [2019-10-03 02:48:14,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:48:14,814 INFO L276 IsEmpty]: Start isEmpty. Operand 8716 states and 12428 transitions. [2019-10-03 02:48:14,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-03 02:48:14,832 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:48:14,832 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] [2019-10-03 02:48:14,832 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:48:14,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:48:14,833 INFO L82 PathProgramCache]: Analyzing trace with hash -464354170, now seen corresponding path program 1 times [2019-10-03 02:48:14,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:48:14,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:14,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:48:14,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:14,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:48:14,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:48:15,028 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:48:15,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:48:15,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:48:15,029 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:48:15,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:48:15,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:48:15,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:48:15,031 INFO L87 Difference]: Start difference. First operand 8716 states and 12428 transitions. Second operand 6 states. [2019-10-03 02:48:15,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:48:15,632 INFO L93 Difference]: Finished difference Result 17567 states and 25051 transitions. [2019-10-03 02:48:15,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:48:15,633 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 209 [2019-10-03 02:48:15,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:48:15,715 INFO L225 Difference]: With dead ends: 17567 [2019-10-03 02:48:15,715 INFO L226 Difference]: Without dead ends: 17567 [2019-10-03 02:48:15,715 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:48:15,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17567 states. [2019-10-03 02:48:16,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17567 to 17404. [2019-10-03 02:48:16,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17404 states. [2019-10-03 02:48:17,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17404 states to 17404 states and 24839 transitions. [2019-10-03 02:48:17,004 INFO L78 Accepts]: Start accepts. Automaton has 17404 states and 24839 transitions. Word has length 209 [2019-10-03 02:48:17,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:48:17,004 INFO L475 AbstractCegarLoop]: Abstraction has 17404 states and 24839 transitions. [2019-10-03 02:48:17,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:48:17,005 INFO L276 IsEmpty]: Start isEmpty. Operand 17404 states and 24839 transitions. [2019-10-03 02:48:17,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-03 02:48:17,038 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:48:17,038 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] [2019-10-03 02:48:17,039 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:48:17,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:48:17,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1595148004, now seen corresponding path program 1 times [2019-10-03 02:48:17,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:48:17,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:17,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:48:17,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:17,045 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:48:17,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:48:17,225 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:48:17,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:48:17,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:48:17,226 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:48:17,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:48:17,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:48:17,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:48:17,227 INFO L87 Difference]: Start difference. First operand 17404 states and 24839 transitions. Second operand 9 states. [2019-10-03 02:48:17,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:48:17,464 INFO L93 Difference]: Finished difference Result 18464 states and 26409 transitions. [2019-10-03 02:48:17,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:48:17,465 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 210 [2019-10-03 02:48:17,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:48:17,546 INFO L225 Difference]: With dead ends: 18464 [2019-10-03 02:48:17,546 INFO L226 Difference]: Without dead ends: 18464 [2019-10-03 02:48:17,548 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:48:17,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18464 states. [2019-10-03 02:48:18,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18464 to 18394. [2019-10-03 02:48:18,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18394 states. [2019-10-03 02:48:18,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18394 states to 18394 states and 26314 transitions. [2019-10-03 02:48:18,496 INFO L78 Accepts]: Start accepts. Automaton has 18394 states and 26314 transitions. Word has length 210 [2019-10-03 02:48:18,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:48:18,496 INFO L475 AbstractCegarLoop]: Abstraction has 18394 states and 26314 transitions. [2019-10-03 02:48:18,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:48:18,497 INFO L276 IsEmpty]: Start isEmpty. Operand 18394 states and 26314 transitions. [2019-10-03 02:48:18,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-10-03 02:48:18,535 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:48:18,535 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] [2019-10-03 02:48:18,535 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:48:18,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:48:18,536 INFO L82 PathProgramCache]: Analyzing trace with hash 164838088, now seen corresponding path program 1 times [2019-10-03 02:48:18,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:48:18,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:18,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:48:18,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:18,541 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:48:18,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:48:18,718 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:48:18,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:48:18,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:48:18,719 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:48:18,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:48:18,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:48:18,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:48:18,720 INFO L87 Difference]: Start difference. First operand 18394 states and 26314 transitions. Second operand 6 states. [2019-10-03 02:48:19,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:48:19,416 INFO L93 Difference]: Finished difference Result 36383 states and 52128 transitions. [2019-10-03 02:48:19,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:48:19,416 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 211 [2019-10-03 02:48:19,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:48:19,594 INFO L225 Difference]: With dead ends: 36383 [2019-10-03 02:48:19,595 INFO L226 Difference]: Without dead ends: 33194 [2019-10-03 02:48:19,595 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:48:19,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33194 states. [2019-10-03 02:48:21,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33194 to 32899. [2019-10-03 02:48:21,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32899 states. [2019-10-03 02:48:21,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32899 states to 32899 states and 47287 transitions. [2019-10-03 02:48:21,596 INFO L78 Accepts]: Start accepts. Automaton has 32899 states and 47287 transitions. Word has length 211 [2019-10-03 02:48:21,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:48:21,596 INFO L475 AbstractCegarLoop]: Abstraction has 32899 states and 47287 transitions. [2019-10-03 02:48:21,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:48:21,596 INFO L276 IsEmpty]: Start isEmpty. Operand 32899 states and 47287 transitions. [2019-10-03 02:48:21,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-10-03 02:48:21,663 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:48:21,664 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] [2019-10-03 02:48:21,664 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:48:21,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:48:21,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1161087888, now seen corresponding path program 1 times [2019-10-03 02:48:21,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:48:21,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:21,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:48:21,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:21,670 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:48:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:48:21,802 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:48:21,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:48:21,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:48:21,803 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:48:21,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:48:21,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:48:21,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:48:21,805 INFO L87 Difference]: Start difference. First operand 32899 states and 47287 transitions. Second operand 3 states. [2019-10-03 02:48:22,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:48:22,023 INFO L93 Difference]: Finished difference Result 34960 states and 51034 transitions. [2019-10-03 02:48:22,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:48:22,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2019-10-03 02:48:22,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:48:22,181 INFO L225 Difference]: With dead ends: 34960 [2019-10-03 02:48:22,182 INFO L226 Difference]: Without dead ends: 34960 [2019-10-03 02:48:22,182 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:48:22,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34960 states. [2019-10-03 02:48:23,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34960 to 34939. [2019-10-03 02:48:23,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34939 states. [2019-10-03 02:48:23,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34939 states to 34939 states and 51013 transitions. [2019-10-03 02:48:23,580 INFO L78 Accepts]: Start accepts. Automaton has 34939 states and 51013 transitions. Word has length 220 [2019-10-03 02:48:23,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:48:23,581 INFO L475 AbstractCegarLoop]: Abstraction has 34939 states and 51013 transitions. [2019-10-03 02:48:23,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:48:23,581 INFO L276 IsEmpty]: Start isEmpty. Operand 34939 states and 51013 transitions. [2019-10-03 02:48:23,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-10-03 02:48:23,648 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:48:23,648 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] [2019-10-03 02:48:23,648 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:48:23,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:48:23,649 INFO L82 PathProgramCache]: Analyzing trace with hash -685048074, now seen corresponding path program 1 times [2019-10-03 02:48:23,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:48:23,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:23,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:48:23,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:23,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:48:23,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:48:23,784 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:48:23,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:48:23,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:48:23,785 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:48:23,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:48:23,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:48:23,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:48:23,786 INFO L87 Difference]: Start difference. First operand 34939 states and 51013 transitions. Second operand 3 states. [2019-10-03 02:48:23,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:48:23,991 INFO L93 Difference]: Finished difference Result 38800 states and 58054 transitions. [2019-10-03 02:48:23,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:48:23,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 223 [2019-10-03 02:48:23,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:48:24,130 INFO L225 Difference]: With dead ends: 38800 [2019-10-03 02:48:24,130 INFO L226 Difference]: Without dead ends: 38800 [2019-10-03 02:48:24,132 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:48:24,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38800 states. [2019-10-03 02:48:26,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38800 to 38779. [2019-10-03 02:48:26,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38779 states. [2019-10-03 02:48:26,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38779 states to 38779 states and 58033 transitions. [2019-10-03 02:48:26,463 INFO L78 Accepts]: Start accepts. Automaton has 38779 states and 58033 transitions. Word has length 223 [2019-10-03 02:48:26,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:48:26,464 INFO L475 AbstractCegarLoop]: Abstraction has 38779 states and 58033 transitions. [2019-10-03 02:48:26,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:48:26,464 INFO L276 IsEmpty]: Start isEmpty. Operand 38779 states and 58033 transitions. [2019-10-03 02:48:26,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-03 02:48:26,509 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:48:26,510 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] [2019-10-03 02:48:26,510 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:48:26,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:48:26,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1857987982, now seen corresponding path program 1 times [2019-10-03 02:48:26,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:48:26,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:26,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:48:26,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:26,515 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:48:26,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:48:26,667 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:48:26,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:48:26,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:48:26,667 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:48:26,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:48:26,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:48:26,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:48:26,669 INFO L87 Difference]: Start difference. First operand 38779 states and 58033 transitions. Second operand 3 states. [2019-10-03 02:48:26,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:48:26,913 INFO L93 Difference]: Finished difference Result 46192 states and 71326 transitions. [2019-10-03 02:48:26,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:48:26,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 222 [2019-10-03 02:48:26,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:48:27,081 INFO L225 Difference]: With dead ends: 46192 [2019-10-03 02:48:27,082 INFO L226 Difference]: Without dead ends: 46192 [2019-10-03 02:48:27,085 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:48:27,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46192 states. [2019-10-03 02:48:28,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46192 to 46171. [2019-10-03 02:48:28,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46171 states. [2019-10-03 02:48:28,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46171 states to 46171 states and 71305 transitions. [2019-10-03 02:48:28,565 INFO L78 Accepts]: Start accepts. Automaton has 46171 states and 71305 transitions. Word has length 222 [2019-10-03 02:48:28,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:48:28,566 INFO L475 AbstractCegarLoop]: Abstraction has 46171 states and 71305 transitions. [2019-10-03 02:48:28,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:48:28,566 INFO L276 IsEmpty]: Start isEmpty. Operand 46171 states and 71305 transitions. [2019-10-03 02:48:28,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-10-03 02:48:28,633 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:48:28,634 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] [2019-10-03 02:48:28,634 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:48:28,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:48:28,634 INFO L82 PathProgramCache]: Analyzing trace with hash 158828310, now seen corresponding path program 1 times [2019-10-03 02:48:28,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:48:28,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:28,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:48:28,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:28,637 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:48:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:48:28,766 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:48:28,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:48:28,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:48:28,767 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:48:28,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:48:28,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:48:28,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:48:28,768 INFO L87 Difference]: Start difference. First operand 46171 states and 71305 transitions. Second operand 3 states. [2019-10-03 02:48:29,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:48:29,064 INFO L93 Difference]: Finished difference Result 60400 states and 96526 transitions. [2019-10-03 02:48:29,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:48:29,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2019-10-03 02:48:29,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:48:29,713 INFO L225 Difference]: With dead ends: 60400 [2019-10-03 02:48:29,714 INFO L226 Difference]: Without dead ends: 60400 [2019-10-03 02:48:29,714 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:48:29,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60400 states. [2019-10-03 02:48:30,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60400 to 60379. [2019-10-03 02:48:30,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60379 states. [2019-10-03 02:48:31,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60379 states to 60379 states and 96505 transitions. [2019-10-03 02:48:31,013 INFO L78 Accepts]: Start accepts. Automaton has 60379 states and 96505 transitions. Word has length 225 [2019-10-03 02:48:31,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:48:31,014 INFO L475 AbstractCegarLoop]: Abstraction has 60379 states and 96505 transitions. [2019-10-03 02:48:31,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:48:31,014 INFO L276 IsEmpty]: Start isEmpty. Operand 60379 states and 96505 transitions. [2019-10-03 02:48:33,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-10-03 02:48:33,015 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:48:33,016 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] [2019-10-03 02:48:33,016 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:48:33,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:48:33,016 INFO L82 PathProgramCache]: Analyzing trace with hash -470653586, now seen corresponding path program 1 times [2019-10-03 02:48:33,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:48:33,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:33,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:48:33,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:33,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:48:33,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:48:33,207 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:48:33,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:48:33,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:48:33,208 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:48:33,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:48:33,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:48:33,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:48:33,209 INFO L87 Difference]: Start difference. First operand 60379 states and 96505 transitions. Second operand 7 states. [2019-10-03 02:48:35,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:48:35,763 INFO L93 Difference]: Finished difference Result 113083 states and 180960 transitions. [2019-10-03 02:48:35,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-03 02:48:35,763 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 224 [2019-10-03 02:48:35,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:48:36,156 INFO L225 Difference]: With dead ends: 113083 [2019-10-03 02:48:36,156 INFO L226 Difference]: Without dead ends: 113083 [2019-10-03 02:48:36,157 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:48:36,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113083 states. [2019-10-03 02:48:41,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113083 to 113077. [2019-10-03 02:48:41,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113077 states. [2019-10-03 02:48:42,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113077 states to 113077 states and 180956 transitions. [2019-10-03 02:48:42,076 INFO L78 Accepts]: Start accepts. Automaton has 113077 states and 180956 transitions. Word has length 224 [2019-10-03 02:48:42,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:48:42,076 INFO L475 AbstractCegarLoop]: Abstraction has 113077 states and 180956 transitions. [2019-10-03 02:48:42,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:48:42,077 INFO L276 IsEmpty]: Start isEmpty. Operand 113077 states and 180956 transitions. [2019-10-03 02:48:42,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-10-03 02:48:42,202 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:48:42,202 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] [2019-10-03 02:48:42,203 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:48:42,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:48:42,203 INFO L82 PathProgramCache]: Analyzing trace with hash 435851585, now seen corresponding path program 1 times [2019-10-03 02:48:42,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:48:42,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:42,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:48:42,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:42,207 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:48:42,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:48:42,407 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:48:42,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:48:42,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:48:42,407 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:48:42,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:48:42,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:48:42,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:48:42,409 INFO L87 Difference]: Start difference. First operand 113077 states and 180956 transitions. Second operand 9 states. [2019-10-03 02:48:43,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:48:43,153 INFO L93 Difference]: Finished difference Result 113369 states and 181145 transitions. [2019-10-03 02:48:43,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:48:43,154 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 227 [2019-10-03 02:48:43,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:48:43,662 INFO L225 Difference]: With dead ends: 113369 [2019-10-03 02:48:43,663 INFO L226 Difference]: Without dead ends: 113193 [2019-10-03 02:48:43,663 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:48:43,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113193 states. [2019-10-03 02:48:46,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113193 to 112689. [2019-10-03 02:48:46,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112689 states. [2019-10-03 02:48:47,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112689 states to 112689 states and 179507 transitions. [2019-10-03 02:48:47,165 INFO L78 Accepts]: Start accepts. Automaton has 112689 states and 179507 transitions. Word has length 227 [2019-10-03 02:48:47,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:48:47,166 INFO L475 AbstractCegarLoop]: Abstraction has 112689 states and 179507 transitions. [2019-10-03 02:48:47,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:48:47,166 INFO L276 IsEmpty]: Start isEmpty. Operand 112689 states and 179507 transitions. [2019-10-03 02:48:47,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-10-03 02:48:47,286 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:48:47,287 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] [2019-10-03 02:48:47,287 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:48:47,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:48:47,287 INFO L82 PathProgramCache]: Analyzing trace with hash -474545987, now seen corresponding path program 1 times [2019-10-03 02:48:47,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:48:47,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:47,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:48:47,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:47,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:48:47,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:48:48,500 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:48:48,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:48:48,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-10-03 02:48:48,501 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:48:48,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-03 02:48:48,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-03 02:48:48,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-10-03 02:48:48,505 INFO L87 Difference]: Start difference. First operand 112689 states and 179507 transitions. Second operand 26 states. [2019-10-03 02:48:50,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:48:50,053 INFO L93 Difference]: Finished difference Result 125782 states and 199638 transitions. [2019-10-03 02:48:50,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-03 02:48:50,053 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 225 [2019-10-03 02:48:50,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:48:50,676 INFO L225 Difference]: With dead ends: 125782 [2019-10-03 02:48:50,676 INFO L226 Difference]: Without dead ends: 125782 [2019-10-03 02:48:50,678 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=93, Invalid=1239, Unknown=0, NotChecked=0, Total=1332 [2019-10-03 02:48:50,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125782 states. [2019-10-03 02:48:56,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125782 to 125591. [2019-10-03 02:48:56,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125591 states. [2019-10-03 02:48:57,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125591 states to 125591 states and 199327 transitions. [2019-10-03 02:48:57,104 INFO L78 Accepts]: Start accepts. Automaton has 125591 states and 199327 transitions. Word has length 225 [2019-10-03 02:48:57,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:48:57,105 INFO L475 AbstractCegarLoop]: Abstraction has 125591 states and 199327 transitions. [2019-10-03 02:48:57,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-03 02:48:57,105 INFO L276 IsEmpty]: Start isEmpty. Operand 125591 states and 199327 transitions. [2019-10-03 02:48:57,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-10-03 02:48:57,217 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:48:57,217 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] [2019-10-03 02:48:57,218 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:48:57,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:48:57,218 INFO L82 PathProgramCache]: Analyzing trace with hash 219153513, now seen corresponding path program 1 times [2019-10-03 02:48:57,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:48:57,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:57,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:48:57,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:57,221 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:48:57,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:48:57,425 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:48:57,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:48:57,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:48:57,426 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:48:57,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:48:57,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:48:57,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:48:57,428 INFO L87 Difference]: Start difference. First operand 125591 states and 199327 transitions. Second operand 10 states. [2019-10-03 02:48:59,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:48:59,175 INFO L93 Difference]: Finished difference Result 126431 states and 200312 transitions. [2019-10-03 02:48:59,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:48:59,176 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 229 [2019-10-03 02:48:59,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:48:59,665 INFO L225 Difference]: With dead ends: 126431 [2019-10-03 02:48:59,665 INFO L226 Difference]: Without dead ends: 126427 [2019-10-03 02:48:59,665 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:48:59,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126427 states. [2019-10-03 02:49:05,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126427 to 126427. [2019-10-03 02:49:05,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126427 states. [2019-10-03 02:49:06,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126427 states to 126427 states and 200306 transitions. [2019-10-03 02:49:06,343 INFO L78 Accepts]: Start accepts. Automaton has 126427 states and 200306 transitions. Word has length 229 [2019-10-03 02:49:06,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:49:06,343 INFO L475 AbstractCegarLoop]: Abstraction has 126427 states and 200306 transitions. [2019-10-03 02:49:06,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:49:06,344 INFO L276 IsEmpty]: Start isEmpty. Operand 126427 states and 200306 transitions. [2019-10-03 02:49:06,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-10-03 02:49:06,504 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:49:06,504 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] [2019-10-03 02:49:06,504 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:49:06,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:49:06,504 INFO L82 PathProgramCache]: Analyzing trace with hash -68789459, now seen corresponding path program 1 times [2019-10-03 02:49:06,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:49:06,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:06,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:49:06,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:06,508 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:49:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:49:06,637 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:49:06,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:49:06,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:49:06,638 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:49:06,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:49:06,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:49:06,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:49:06,639 INFO L87 Difference]: Start difference. First operand 126427 states and 200306 transitions. Second operand 5 states. [2019-10-03 02:49:07,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:49:07,301 INFO L93 Difference]: Finished difference Result 129500 states and 208638 transitions. [2019-10-03 02:49:07,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:49:07,301 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 234 [2019-10-03 02:49:07,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:49:07,758 INFO L225 Difference]: With dead ends: 129500 [2019-10-03 02:49:07,758 INFO L226 Difference]: Without dead ends: 129500 [2019-10-03 02:49:07,759 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:49:07,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129500 states. [2019-10-03 02:49:11,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129500 to 127889. [2019-10-03 02:49:11,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127889 states. [2019-10-03 02:49:12,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127889 states to 127889 states and 202016 transitions. [2019-10-03 02:49:12,242 INFO L78 Accepts]: Start accepts. Automaton has 127889 states and 202016 transitions. Word has length 234 [2019-10-03 02:49:12,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:49:12,243 INFO L475 AbstractCegarLoop]: Abstraction has 127889 states and 202016 transitions. [2019-10-03 02:49:12,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:49:12,243 INFO L276 IsEmpty]: Start isEmpty. Operand 127889 states and 202016 transitions. [2019-10-03 02:49:12,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-10-03 02:49:12,354 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:49:12,354 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] [2019-10-03 02:49:12,355 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:49:12,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:49:12,355 INFO L82 PathProgramCache]: Analyzing trace with hash -860125851, now seen corresponding path program 1 times [2019-10-03 02:49:12,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:49:12,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:12,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:49:12,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:12,359 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:49:12,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:49:16,398 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:49:16,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:49:16,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:49:16,399 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:49:16,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:49:16,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:49:16,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:49:16,400 INFO L87 Difference]: Start difference. First operand 127889 states and 202016 transitions. Second operand 11 states. [2019-10-03 02:49:17,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:49:17,492 INFO L93 Difference]: Finished difference Result 128355 states and 202288 transitions. [2019-10-03 02:49:17,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:49:17,494 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 234 [2019-10-03 02:49:17,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:49:18,091 INFO L225 Difference]: With dead ends: 128355 [2019-10-03 02:49:18,092 INFO L226 Difference]: Without dead ends: 128355 [2019-10-03 02:49:18,092 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:49:18,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128355 states. [2019-10-03 02:49:21,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128355 to 128221. [2019-10-03 02:49:21,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128221 states. [2019-10-03 02:49:21,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128221 states to 128221 states and 202154 transitions. [2019-10-03 02:49:21,741 INFO L78 Accepts]: Start accepts. Automaton has 128221 states and 202154 transitions. Word has length 234 [2019-10-03 02:49:21,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:49:21,741 INFO L475 AbstractCegarLoop]: Abstraction has 128221 states and 202154 transitions. [2019-10-03 02:49:21,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:49:21,742 INFO L276 IsEmpty]: Start isEmpty. Operand 128221 states and 202154 transitions. [2019-10-03 02:49:21,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-10-03 02:49:21,864 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:49:21,864 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] [2019-10-03 02:49:21,865 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:49:21,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:49:21,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1569687073, now seen corresponding path program 1 times [2019-10-03 02:49:21,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:49:21,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:21,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:49:21,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:21,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:49:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:49:22,075 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:49:22,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:49:22,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:49:22,075 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:49:22,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:49:22,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:49:22,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:49:22,077 INFO L87 Difference]: Start difference. First operand 128221 states and 202154 transitions. Second operand 6 states. [2019-10-03 02:49:25,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:49:25,020 INFO L93 Difference]: Finished difference Result 259051 states and 420005 transitions. [2019-10-03 02:49:25,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:49:25,020 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 237 [2019-10-03 02:49:25,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:49:26,112 INFO L225 Difference]: With dead ends: 259051 [2019-10-03 02:49:26,113 INFO L226 Difference]: Without dead ends: 259051 [2019-10-03 02:49:26,113 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:49:26,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259051 states. [2019-10-03 02:49:36,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259051 to 255901. [2019-10-03 02:49:36,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255901 states. [2019-10-03 02:49:37,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255901 states to 255901 states and 408825 transitions. [2019-10-03 02:49:37,590 INFO L78 Accepts]: Start accepts. Automaton has 255901 states and 408825 transitions. Word has length 237 [2019-10-03 02:49:37,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:49:37,591 INFO L475 AbstractCegarLoop]: Abstraction has 255901 states and 408825 transitions. [2019-10-03 02:49:37,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:49:37,591 INFO L276 IsEmpty]: Start isEmpty. Operand 255901 states and 408825 transitions. [2019-10-03 02:49:39,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-10-03 02:49:39,173 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:49:39,174 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:39,174 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:49:39,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:49:39,174 INFO L82 PathProgramCache]: Analyzing trace with hash 729185400, now seen corresponding path program 1 times [2019-10-03 02:49:39,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:49:39,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:39,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:49:39,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:49:39,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:49:39,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:49:39,345 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-03 02:49:39,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:49:39,346 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:49:39,347 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 255 with the following transitions: [2019-10-03 02:49:39,351 INFO L207 CegarAbsIntRunner]: [44], [47], [50], [72], [75], [85], [109], [112], [122], [123], [139], [142], [151], [152], [155], [156], [157], [159], [255], [258], [264], [269], [271], [275], [278], [279], [280], [283], [289], [323], [326], [335], [336], [338], [341], [345], [346], [348], [349], [352], [362], [363], [364], [375], [377], [394], [397], [406], [503], [584], [586], [587], [588], [595], [606], [608], [613], [637], [640], [654], [693], [694], [695], [697], [700], [703], [709], [733], [737], [740], [748], [751], [762], [765], [775], [776], [778], [781], [783], [786], [788], [790], [793], [809], [818], [822], [824], [826], [829], [836], [843], [848], [855], [862], [869], [876], [883], [890], [897], [900], [902], [1109], [1163], [1166], [1180], [1181], [1183], [1200], [1204], [1215], [1218], [1219], [1222], [1226], [1230], [1256], [1257], [1259], [1261], [1268], [1274], [1276], [1359], [1362], [1368], [1389], [1392], [1406], [1414], [1417], [1426], [1620], [1622], [1624], [1626], [1627], [1639], [1640], [1641], [1642], [1643], [1644], [1645], [1657], [1667], [1668], [1669], [1670], [1671], [1672], [1675], [1676], [1677], [1678], [1679], [1681], [1682], [1683], [1684], [1695], [1696], [1699], [1700], [1705], [1706], [1713], [1729], [1730], [1737], [1738], [1739], [1740], [1741], [1749], [1750], [1751], [1753], [1754], [1755], [1756], [1757], [1758], [1759], [1760], [1761], [1763], [1764], [1765], [1766], [1775], [1776], [1777], [1778], [1779], [1780], [1781], [1782], [1783], [1784], [1785], [1786], [1787], [1799], [1800], [1811], [1813], [1814], [1831], [1833], [1834], [1835], [1836], [1837], [1838], [1839], [1840], [1845], [1847], [1848], [1849], [1871], [1872], [1873], [1874], [1875], [1876], [1877], [1878], [1879] [2019-10-03 02:49:39,411 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:49:39,412 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:49:39,606 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:49:39,609 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 253 root evaluator evaluations with a maximum evaluation depth of 0. Performed 253 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:49:39,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:49:39,615 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:49:39,765 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-03 02:49:39,765 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:49:39,777 INFO L420 sIntCurrentIteration]: We unified 253 AI predicates to 253 [2019-10-03 02:49:39,777 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:49:39,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:49:39,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2019-10-03 02:49:39,778 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:49:39,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:49:39,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:49:39,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:49:39,784 INFO L87 Difference]: Start difference. First operand 255901 states and 408825 transitions. Second operand 2 states. [2019-10-03 02:49:39,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:49:39,785 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-03 02:49:39,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:49:39,785 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 254 [2019-10-03 02:49:39,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:49:39,785 INFO L225 Difference]: With dead ends: 2 [2019-10-03 02:49:39,786 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:49:39,786 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 253 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:49:39,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:49:39,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:49:39,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:49:39,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:49:39,787 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 254 [2019-10-03 02:49:39,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:49:39,787 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:49:39,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:49:39,787 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:49:39,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:49:39,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:49:39 BoogieIcfgContainer [2019-10-03 02:49:39,793 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:49:39,796 INFO L168 Benchmark]: Toolchain (without parser) took 105847.37 ms. Allocated memory was 134.2 MB in the beginning and 3.2 GB in the end (delta: 3.1 GB). Free memory was 86.9 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-10-03 02:49:39,797 INFO L168 Benchmark]: CDTParser took 2.98 ms. Allocated memory is still 134.2 MB. Free memory was 108.4 MB in the beginning and 108.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:49:39,798 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1323.45 ms. Allocated memory was 134.2 MB in the beginning and 202.4 MB in the end (delta: 68.2 MB). Free memory was 86.6 MB in the beginning and 133.5 MB in the end (delta: -46.9 MB). Peak memory consumption was 33.0 MB. Max. memory is 7.1 GB. [2019-10-03 02:49:39,799 INFO L168 Benchmark]: Boogie Preprocessor took 181.53 ms. Allocated memory is still 202.4 MB. Free memory was 133.5 MB in the beginning and 125.0 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 7.1 GB. [2019-10-03 02:49:39,803 INFO L168 Benchmark]: RCFGBuilder took 2434.17 ms. Allocated memory was 202.4 MB in the beginning and 261.1 MB in the end (delta: 58.7 MB). Free memory was 125.0 MB in the beginning and 159.2 MB in the end (delta: -34.2 MB). Peak memory consumption was 84.0 MB. Max. memory is 7.1 GB. [2019-10-03 02:49:39,803 INFO L168 Benchmark]: TraceAbstraction took 101902.89 ms. Allocated memory was 261.1 MB in the beginning and 3.2 GB in the end (delta: 2.9 GB). Free memory was 159.2 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-10-03 02:49:39,814 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.98 ms. Allocated memory is still 134.2 MB. Free memory was 108.4 MB in the beginning and 108.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1323.45 ms. Allocated memory was 134.2 MB in the beginning and 202.4 MB in the end (delta: 68.2 MB). Free memory was 86.6 MB in the beginning and 133.5 MB in the end (delta: -46.9 MB). Peak memory consumption was 33.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 181.53 ms. Allocated memory is still 202.4 MB. Free memory was 133.5 MB in the beginning and 125.0 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2434.17 ms. Allocated memory was 202.4 MB in the beginning and 261.1 MB in the end (delta: 58.7 MB). Free memory was 125.0 MB in the beginning and 159.2 MB in the end (delta: -34.2 MB). Peak memory consumption was 84.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 101902.89 ms. Allocated memory was 261.1 MB in the beginning and 3.2 GB in the end (delta: 2.9 GB). Free memory was 159.2 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1919]: 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, 767 locations, 1 error locations. SAFE Result, 101.8s OverallTime, 24 OverallIterations, 3 TraceHistogramMax, 31.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 19466 SDtfs, 9828 SDslu, 108938 SDs, 0 SdLazy, 10840 SolverSat, 1167 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 593 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1349 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=255901occurred 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, 1.9446640316205535 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 54.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 6398 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 5228 NumberOfCodeBlocks, 5228 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 5204 ConstructedInterpolants, 0 QuantifiedInterpolants, 1496560 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 23 PerfectInterpolantSequences, 910/912 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...