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_product22.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:37:08,526 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:37:08,528 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:37:08,540 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:37:08,541 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:37:08,542 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:37:08,544 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:37:08,546 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:37:08,548 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:37:08,549 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:37:08,550 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:37:08,551 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:37:08,552 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:37:08,553 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:37:08,554 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:37:08,555 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:37:08,556 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:37:08,557 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:37:08,559 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:37:08,561 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:37:08,563 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:37:08,564 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:37:08,566 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:37:08,567 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:37:08,569 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:37:08,569 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:37:08,570 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:37:08,571 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:37:08,571 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:37:08,572 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:37:08,573 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:37:08,573 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:37:08,574 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:37:08,575 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:37:08,576 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:37:08,577 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:37:08,577 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:37:08,578 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:37:08,578 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:37:08,579 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:37:08,580 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:37:08,580 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-09-10 02:37:08,607 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:37:08,607 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:37:08,608 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:37:08,609 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:37:08,609 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:37:08,609 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:37:08,610 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:37:08,610 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:37:08,610 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:37:08,610 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:37:08,613 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:37:08,613 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:37:08,614 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:37:08,614 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:37:08,614 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:37:08,614 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:37:08,615 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:37:08,615 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:37:08,615 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:37:08,616 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:37:08,616 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:37:08,616 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:37:08,616 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:37:08,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:37:08,617 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:37:08,617 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:37:08,617 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:37:08,617 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:37:08,618 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:37:08,618 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:37:08,673 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:37:08,685 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:37:08,688 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:37:08,689 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:37:08,690 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:37:08,691 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec0_product22.cil.c [2019-09-10 02:37:08,755 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/561d3053d/64139ff84fca4db8a507130956e36967/FLAG7e11e8f12 [2019-09-10 02:37:09,476 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:37:09,476 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec0_product22.cil.c [2019-09-10 02:37:09,510 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/561d3053d/64139ff84fca4db8a507130956e36967/FLAG7e11e8f12 [2019-09-10 02:37:09,606 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/561d3053d/64139ff84fca4db8a507130956e36967 [2019-09-10 02:37:09,617 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:37:09,618 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:37:09,619 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:37:09,620 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:37:09,624 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:37:09,625 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:37:09" (1/1) ... [2019-09-10 02:37:09,628 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b099e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:37:09, skipping insertion in model container [2019-09-10 02:37:09,628 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:37:09" (1/1) ... [2019-09-10 02:37:09,635 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:37:09,720 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:37:10,481 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:37:10,498 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:37:10,645 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:37:10,742 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:37:10,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:37:10 WrapperNode [2019-09-10 02:37:10,743 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:37:10,744 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:37:10,745 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:37:10,745 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:37:10,760 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:37:10" (1/1) ... [2019-09-10 02:37:10,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:37:10" (1/1) ... [2019-09-10 02:37:10,800 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:37:10" (1/1) ... [2019-09-10 02:37:10,800 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:37:10" (1/1) ... [2019-09-10 02:37:10,876 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:37:10" (1/1) ... [2019-09-10 02:37:10,892 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:37:10" (1/1) ... [2019-09-10 02:37:10,909 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:37:10" (1/1) ... [2019-09-10 02:37:10,927 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:37:10,928 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:37:10,928 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:37:10,929 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:37:10,930 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:37:10" (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-09-10 02:37:11,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:37:11,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:37:11,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-10 02:37:11,034 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-10 02:37:11,034 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-10 02:37:11,034 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-10 02:37:11,034 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-10 02:37:11,034 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-10 02:37:11,035 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-10 02:37:11,035 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-10 02:37:11,035 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-10 02:37:11,036 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-10 02:37:11,036 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-10 02:37:11,037 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-10 02:37:11,037 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-10 02:37:11,038 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-10 02:37:11,038 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-10 02:37:11,039 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-10 02:37:11,039 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-10 02:37:11,039 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-10 02:37:11,039 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-10 02:37:11,040 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-10 02:37:11,040 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-10 02:37:11,040 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-10 02:37:11,041 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-10 02:37:11,041 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-10 02:37:11,041 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-10 02:37:11,042 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-10 02:37:11,042 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-10 02:37:11,042 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-10 02:37:11,042 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-10 02:37:11,042 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-10 02:37:11,042 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-10 02:37:11,043 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-10 02:37:11,043 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-10 02:37:11,043 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-10 02:37:11,043 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-10 02:37:11,043 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-10 02:37:11,043 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-10 02:37:11,044 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-10 02:37:11,044 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-10 02:37:11,044 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-10 02:37:11,044 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-10 02:37:11,044 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-10 02:37:11,045 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-10 02:37:11,045 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-10 02:37:11,045 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-09-10 02:37:11,045 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AutoResponder [2019-09-10 02:37:11,045 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-09-10 02:37:11,045 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-10 02:37:11,046 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-10 02:37:11,046 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-10 02:37:11,046 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-10 02:37:11,046 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-10 02:37:11,046 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-10 02:37:11,046 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-10 02:37:11,046 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-10 02:37:11,047 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-10 02:37:11,047 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-09-10 02:37:11,047 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-09-10 02:37:11,047 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-10 02:37:11,048 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-10 02:37:11,048 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-10 02:37:11,048 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-10 02:37:11,048 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-10 02:37:11,048 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-10 02:37:11,049 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-10 02:37:11,049 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-10 02:37:11,049 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-10 02:37:11,049 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:37:11,049 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-10 02:37:11,050 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-10 02:37:11,050 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-10 02:37:11,051 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-10 02:37:11,051 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-10 02:37:11,051 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-10 02:37:11,051 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-10 02:37:11,051 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-10 02:37:11,052 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-10 02:37:11,052 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-09-10 02:37:11,052 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-09-10 02:37:11,053 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__DecryptForward_spec__1 [2019-09-10 02:37:11,053 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-10 02:37:11,053 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-10 02:37:11,053 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-10 02:37:11,054 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-10 02:37:11,054 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-10 02:37:11,055 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-10 02:37:11,055 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-10 02:37:11,055 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-10 02:37:11,056 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-10 02:37:11,056 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-10 02:37:11,056 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-10 02:37:11,056 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-10 02:37:11,056 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-10 02:37:11,056 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-10 02:37:11,057 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-10 02:37:11,057 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-10 02:37:11,057 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-10 02:37:11,057 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-10 02:37:11,057 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-10 02:37:11,057 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-10 02:37:11,057 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-10 02:37:11,058 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-10 02:37:11,058 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-10 02:37:11,058 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-10 02:37:11,058 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-10 02:37:11,058 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-10 02:37:11,058 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-10 02:37:11,059 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-10 02:37:11,059 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-10 02:37:11,059 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-10 02:37:11,059 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:37:11,059 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:37:11,059 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-10 02:37:11,060 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-10 02:37:11,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 02:37:11,061 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-10 02:37:11,061 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-10 02:37:11,062 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-10 02:37:11,062 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-10 02:37:11,062 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-10 02:37:11,062 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-10 02:37:11,063 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-10 02:37:11,063 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-10 02:37:11,063 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-10 02:37:11,064 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-10 02:37:11,064 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-10 02:37:11,064 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-10 02:37:11,064 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-10 02:37:11,065 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-10 02:37:11,065 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-10 02:37:11,065 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-10 02:37:11,065 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-10 02:37:11,065 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-10 02:37:11,066 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-10 02:37:11,066 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-10 02:37:11,067 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-10 02:37:11,067 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-10 02:37:11,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-10 02:37:11,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-10 02:37:11,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 02:37:11,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-10 02:37:11,080 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-10 02:37:11,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 02:37:11,081 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-10 02:37:11,081 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-10 02:37:11,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 02:37:11,081 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-10 02:37:11,082 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-10 02:37:11,082 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-10 02:37:11,082 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-10 02:37:11,082 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-10 02:37:11,082 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-10 02:37:11,083 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-10 02:37:11,083 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-10 02:37:11,083 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-10 02:37:11,083 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-10 02:37:11,083 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-10 02:37:11,083 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-10 02:37:11,083 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-10 02:37:11,083 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-10 02:37:11,084 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-10 02:37:11,084 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-10 02:37:11,084 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-10 02:37:11,084 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-10 02:37:11,084 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-10 02:37:11,084 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-10 02:37:11,084 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-10 02:37:11,084 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-10 02:37:11,085 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-10 02:37:11,085 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-10 02:37:11,085 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-10 02:37:11,085 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-10 02:37:11,085 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-10 02:37:11,085 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-10 02:37:11,085 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-10 02:37:11,085 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-10 02:37:11,086 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-10 02:37:11,086 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-10 02:37:11,086 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-10 02:37:11,086 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-10 02:37:11,086 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-10 02:37:11,086 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-10 02:37:11,086 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-10 02:37:11,086 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-09-10 02:37:11,087 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-09-10 02:37:11,087 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-10 02:37:11,087 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-09-10 02:37:11,087 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AutoResponder [2019-09-10 02:37:11,087 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-09-10 02:37:11,087 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__DecryptForward_spec__1 [2019-09-10 02:37:11,087 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-10 02:37:11,088 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-10 02:37:11,088 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-10 02:37:11,088 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-10 02:37:11,088 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-10 02:37:11,088 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-10 02:37:11,088 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-10 02:37:11,088 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-10 02:37:11,088 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-10 02:37:11,089 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-10 02:37:11,089 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-10 02:37:11,089 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-10 02:37:11,089 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-10 02:37:11,089 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-10 02:37:11,089 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-10 02:37:11,089 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:37:11,089 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-10 02:37:11,090 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-10 02:37:11,090 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-10 02:37:11,090 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-10 02:37:11,090 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-10 02:37:11,090 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-10 02:37:11,090 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-10 02:37:11,090 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-10 02:37:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-10 02:37:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-09-10 02:37:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-09-10 02:37:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-10 02:37:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-10 02:37:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-10 02:37:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-10 02:37:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-10 02:37:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-10 02:37:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-10 02:37:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-10 02:37:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-10 02:37:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-10 02:37:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-10 02:37:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-10 02:37:11,093 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-10 02:37:11,093 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-10 02:37:11,093 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-10 02:37:11,093 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-10 02:37:11,093 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-10 02:37:11,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:37:11,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-10 02:37:11,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:37:13,422 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:37:13,422 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-10 02:37:13,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:37:13 BoogieIcfgContainer [2019-09-10 02:37:13,424 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:37:13,425 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:37:13,426 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:37:13,429 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:37:13,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:37:09" (1/3) ... [2019-09-10 02:37:13,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7da4d444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:37:13, skipping insertion in model container [2019-09-10 02:37:13,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:37:10" (2/3) ... [2019-09-10 02:37:13,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7da4d444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:37:13, skipping insertion in model container [2019-09-10 02:37:13,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:37:13" (3/3) ... [2019-09-10 02:37:13,432 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec0_product22.cil.c [2019-09-10 02:37:13,443 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:37:13,455 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:37:13,470 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:37:13,496 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:37:13,496 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:37:13,496 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:37:13,497 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:37:13,497 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:37:13,497 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:37:13,497 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:37:13,497 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:37:13,528 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states. [2019-09-10 02:37:13,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-10 02:37:13,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:13,559 INFO L399 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] [2019-09-10 02:37:13,562 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:13,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:13,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1106336923, now seen corresponding path program 1 times [2019-09-10 02:37:13,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:13,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:13,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:13,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:13,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:13,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:14,235 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:37:14,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:14,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-10 02:37:14,238 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:14,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:37:14,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:37:14,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:37:14,264 INFO L87 Difference]: Start difference. First operand 505 states. Second operand 2 states. [2019-09-10 02:37:14,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:14,342 INFO L93 Difference]: Finished difference Result 491 states and 649 transitions. [2019-09-10 02:37:14,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:37:14,344 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 200 [2019-09-10 02:37:14,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:14,365 INFO L225 Difference]: With dead ends: 491 [2019-09-10 02:37:14,365 INFO L226 Difference]: Without dead ends: 482 [2019-09-10 02:37:14,367 INFO L628 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-09-10 02:37:14,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-09-10 02:37:14,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2019-09-10 02:37:14,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2019-09-10 02:37:14,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 638 transitions. [2019-09-10 02:37:14,457 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 638 transitions. Word has length 200 [2019-09-10 02:37:14,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:14,459 INFO L475 AbstractCegarLoop]: Abstraction has 482 states and 638 transitions. [2019-09-10 02:37:14,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:37:14,459 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 638 transitions. [2019-09-10 02:37:14,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-10 02:37:14,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:14,466 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:37:14,467 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:14,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:14,467 INFO L82 PathProgramCache]: Analyzing trace with hash -2011171209, now seen corresponding path program 1 times [2019-09-10 02:37:14,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:14,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:14,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:14,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:14,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:14,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:14,717 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:37:14,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:14,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:37:14,718 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:14,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:37:14,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:37:14,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:37:14,724 INFO L87 Difference]: Start difference. First operand 482 states and 638 transitions. Second operand 3 states. [2019-09-10 02:37:14,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:14,770 INFO L93 Difference]: Finished difference Result 485 states and 641 transitions. [2019-09-10 02:37:14,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:37:14,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2019-09-10 02:37:14,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:14,776 INFO L225 Difference]: With dead ends: 485 [2019-09-10 02:37:14,776 INFO L226 Difference]: Without dead ends: 485 [2019-09-10 02:37:14,777 INFO L628 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-09-10 02:37:14,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2019-09-10 02:37:14,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 484. [2019-09-10 02:37:14,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-09-10 02:37:14,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 640 transitions. [2019-09-10 02:37:14,818 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 640 transitions. Word has length 201 [2019-09-10 02:37:14,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:14,819 INFO L475 AbstractCegarLoop]: Abstraction has 484 states and 640 transitions. [2019-09-10 02:37:14,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:37:14,822 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 640 transitions. [2019-09-10 02:37:14,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-10 02:37:14,828 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:14,828 INFO L399 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] [2019-09-10 02:37:14,828 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:14,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:14,829 INFO L82 PathProgramCache]: Analyzing trace with hash 2082311285, now seen corresponding path program 1 times [2019-09-10 02:37:14,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:14,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:14,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:14,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:14,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:14,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:15,084 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:37:15,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:15,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:37:15,085 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:15,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:37:15,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:37:15,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:37:15,086 INFO L87 Difference]: Start difference. First operand 484 states and 640 transitions. Second operand 3 states. [2019-09-10 02:37:15,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:15,111 INFO L93 Difference]: Finished difference Result 527 states and 713 transitions. [2019-09-10 02:37:15,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:37:15,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2019-09-10 02:37:15,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:15,116 INFO L225 Difference]: With dead ends: 527 [2019-09-10 02:37:15,116 INFO L226 Difference]: Without dead ends: 527 [2019-09-10 02:37:15,117 INFO L628 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-09-10 02:37:15,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-09-10 02:37:15,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 526. [2019-09-10 02:37:15,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526 states. [2019-09-10 02:37:15,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 712 transitions. [2019-09-10 02:37:15,143 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 712 transitions. Word has length 213 [2019-09-10 02:37:15,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:15,144 INFO L475 AbstractCegarLoop]: Abstraction has 526 states and 712 transitions. [2019-09-10 02:37:15,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:37:15,144 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 712 transitions. [2019-09-10 02:37:15,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-09-10 02:37:15,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:15,149 INFO L399 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] [2019-09-10 02:37:15,150 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:15,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:15,150 INFO L82 PathProgramCache]: Analyzing trace with hash -849255291, now seen corresponding path program 1 times [2019-09-10 02:37:15,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:15,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:15,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:15,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:15,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:15,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:15,307 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:37:15,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:15,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:37:15,307 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:15,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:37:15,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:37:15,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:37:15,311 INFO L87 Difference]: Start difference. First operand 526 states and 712 transitions. Second operand 3 states. [2019-09-10 02:37:15,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:15,345 INFO L93 Difference]: Finished difference Result 608 states and 851 transitions. [2019-09-10 02:37:15,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:37:15,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 214 [2019-09-10 02:37:15,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:15,350 INFO L225 Difference]: With dead ends: 608 [2019-09-10 02:37:15,350 INFO L226 Difference]: Without dead ends: 608 [2019-09-10 02:37:15,351 INFO L628 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-09-10 02:37:15,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-09-10 02:37:15,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 607. [2019-09-10 02:37:15,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-09-10 02:37:15,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 850 transitions. [2019-09-10 02:37:15,380 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 850 transitions. Word has length 214 [2019-09-10 02:37:15,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:15,380 INFO L475 AbstractCegarLoop]: Abstraction has 607 states and 850 transitions. [2019-09-10 02:37:15,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:37:15,381 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 850 transitions. [2019-09-10 02:37:15,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 02:37:15,386 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:15,386 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:37:15,387 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:15,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:15,387 INFO L82 PathProgramCache]: Analyzing trace with hash 716766844, now seen corresponding path program 1 times [2019-09-10 02:37:15,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:15,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:15,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:15,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:15,389 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:15,895 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:37:15,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:15,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 02:37:15,896 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:15,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 02:37:15,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 02:37:15,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-09-10 02:37:15,898 INFO L87 Difference]: Start difference. First operand 607 states and 850 transitions. Second operand 19 states. [2019-09-10 02:37:20,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:20,723 INFO L93 Difference]: Finished difference Result 1699 states and 2381 transitions. [2019-09-10 02:37:20,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-10 02:37:20,723 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 217 [2019-09-10 02:37:20,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:20,737 INFO L225 Difference]: With dead ends: 1699 [2019-09-10 02:37:20,737 INFO L226 Difference]: Without dead ends: 1699 [2019-09-10 02:37:20,739 INFO L628 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-09-10 02:37:20,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2019-09-10 02:37:20,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1662. [2019-09-10 02:37:20,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1662 states. [2019-09-10 02:37:20,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1662 states and 2334 transitions. [2019-09-10 02:37:20,810 INFO L78 Accepts]: Start accepts. Automaton has 1662 states and 2334 transitions. Word has length 217 [2019-09-10 02:37:20,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:20,811 INFO L475 AbstractCegarLoop]: Abstraction has 1662 states and 2334 transitions. [2019-09-10 02:37:20,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 02:37:20,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 2334 transitions. [2019-09-10 02:37:20,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 02:37:20,853 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:20,853 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:37:20,853 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:20,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:20,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1713779569, now seen corresponding path program 1 times [2019-09-10 02:37:20,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:20,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:20,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:20,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:20,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:20,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:21,121 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-10 02:37:21,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:21,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 02:37:21,122 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:21,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 02:37:21,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 02:37:21,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-10 02:37:21,126 INFO L87 Difference]: Start difference. First operand 1662 states and 2334 transitions. Second operand 14 states. [2019-09-10 02:37:21,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:21,422 INFO L93 Difference]: Finished difference Result 1764 states and 2475 transitions. [2019-09-10 02:37:21,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 02:37:21,422 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 218 [2019-09-10 02:37:21,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:21,433 INFO L225 Difference]: With dead ends: 1764 [2019-09-10 02:37:21,433 INFO L226 Difference]: Without dead ends: 1732 [2019-09-10 02:37:21,434 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2019-09-10 02:37:21,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1732 states. [2019-09-10 02:37:21,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1732 to 1732. [2019-09-10 02:37:21,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1732 states. [2019-09-10 02:37:21,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 2431 transitions. [2019-09-10 02:37:21,499 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 2431 transitions. Word has length 218 [2019-09-10 02:37:21,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:21,500 INFO L475 AbstractCegarLoop]: Abstraction has 1732 states and 2431 transitions. [2019-09-10 02:37:21,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 02:37:21,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2431 transitions. [2019-09-10 02:37:21,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 02:37:21,507 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:21,508 INFO L399 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] [2019-09-10 02:37:21,508 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:21,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:21,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1614735209, now seen corresponding path program 1 times [2019-09-10 02:37:21,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:21,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:21,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:21,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:21,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:21,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:21,858 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:37:21,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:21,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 02:37:21,859 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:21,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 02:37:21,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 02:37:21,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-09-10 02:37:21,860 INFO L87 Difference]: Start difference. First operand 1732 states and 2431 transitions. Second operand 15 states. [2019-09-10 02:37:25,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:25,161 INFO L93 Difference]: Finished difference Result 1814 states and 2550 transitions. [2019-09-10 02:37:25,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-10 02:37:25,162 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 218 [2019-09-10 02:37:25,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:25,172 INFO L225 Difference]: With dead ends: 1814 [2019-09-10 02:37:25,173 INFO L226 Difference]: Without dead ends: 1814 [2019-09-10 02:37:25,174 INFO L628 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-09-10 02:37:25,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1814 states. [2019-09-10 02:37:25,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1814 to 1761. [2019-09-10 02:37:25,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1761 states. [2019-09-10 02:37:25,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1761 states to 1761 states and 2476 transitions. [2019-09-10 02:37:25,243 INFO L78 Accepts]: Start accepts. Automaton has 1761 states and 2476 transitions. Word has length 218 [2019-09-10 02:37:25,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:25,243 INFO L475 AbstractCegarLoop]: Abstraction has 1761 states and 2476 transitions. [2019-09-10 02:37:25,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 02:37:25,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1761 states and 2476 transitions. [2019-09-10 02:37:25,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 02:37:25,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:25,253 INFO L399 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] [2019-09-10 02:37:25,253 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:25,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:25,254 INFO L82 PathProgramCache]: Analyzing trace with hash -214845570, now seen corresponding path program 1 times [2019-09-10 02:37:25,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:25,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:25,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:25,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:25,255 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:25,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:25,507 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:37:25,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:25,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:37:25,508 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:25,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:37:25,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:37:25,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:37:25,511 INFO L87 Difference]: Start difference. First operand 1761 states and 2476 transitions. Second operand 5 states. [2019-09-10 02:37:26,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:26,580 INFO L93 Difference]: Finished difference Result 3607 states and 5017 transitions. [2019-09-10 02:37:26,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:37:26,581 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 218 [2019-09-10 02:37:26,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:26,604 INFO L225 Difference]: With dead ends: 3607 [2019-09-10 02:37:26,605 INFO L226 Difference]: Without dead ends: 3570 [2019-09-10 02:37:26,605 INFO L628 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-09-10 02:37:26,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3570 states. [2019-09-10 02:37:26,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3570 to 3539. [2019-09-10 02:37:26,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3539 states. [2019-09-10 02:37:26,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3539 states to 3539 states and 4926 transitions. [2019-09-10 02:37:26,824 INFO L78 Accepts]: Start accepts. Automaton has 3539 states and 4926 transitions. Word has length 218 [2019-09-10 02:37:26,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:26,825 INFO L475 AbstractCegarLoop]: Abstraction has 3539 states and 4926 transitions. [2019-09-10 02:37:26,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:37:26,825 INFO L276 IsEmpty]: Start isEmpty. Operand 3539 states and 4926 transitions. [2019-09-10 02:37:26,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 02:37:26,836 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:26,837 INFO L399 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] [2019-09-10 02:37:26,837 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:26,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:26,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1639499967, now seen corresponding path program 1 times [2019-09-10 02:37:26,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:26,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:26,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:26,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:26,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:26,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:27,141 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:37:27,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:27,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 02:37:27,142 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:27,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 02:37:27,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 02:37:27,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-09-10 02:37:27,144 INFO L87 Difference]: Start difference. First operand 3539 states and 4926 transitions. Second operand 13 states. [2019-09-10 02:37:29,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:29,822 INFO L93 Difference]: Finished difference Result 7149 states and 9941 transitions. [2019-09-10 02:37:29,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 02:37:29,823 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 218 [2019-09-10 02:37:29,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:29,863 INFO L225 Difference]: With dead ends: 7149 [2019-09-10 02:37:29,863 INFO L226 Difference]: Without dead ends: 7149 [2019-09-10 02:37:29,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2019-09-10 02:37:29,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7149 states. [2019-09-10 02:37:30,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7149 to 7104. [2019-09-10 02:37:30,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7104 states. [2019-09-10 02:37:30,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7104 states to 7104 states and 9877 transitions. [2019-09-10 02:37:30,118 INFO L78 Accepts]: Start accepts. Automaton has 7104 states and 9877 transitions. Word has length 218 [2019-09-10 02:37:30,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:30,119 INFO L475 AbstractCegarLoop]: Abstraction has 7104 states and 9877 transitions. [2019-09-10 02:37:30,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 02:37:30,119 INFO L276 IsEmpty]: Start isEmpty. Operand 7104 states and 9877 transitions. [2019-09-10 02:37:30,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-10 02:37:30,138 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:30,138 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:37:30,138 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:30,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:30,140 INFO L82 PathProgramCache]: Analyzing trace with hash -486187450, now seen corresponding path program 1 times [2019-09-10 02:37:30,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:30,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:30,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:30,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:30,142 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:30,286 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:37:30,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:30,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:37:30,286 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:30,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:37:30,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:37:30,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:37:30,288 INFO L87 Difference]: Start difference. First operand 7104 states and 9877 transitions. Second operand 3 states. [2019-09-10 02:37:30,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:30,332 INFO L93 Difference]: Finished difference Result 8046 states and 11581 transitions. [2019-09-10 02:37:30,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:37:30,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-09-10 02:37:30,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:30,387 INFO L225 Difference]: With dead ends: 8046 [2019-09-10 02:37:30,388 INFO L226 Difference]: Without dead ends: 8046 [2019-09-10 02:37:30,388 INFO L628 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-09-10 02:37:30,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8046 states. [2019-09-10 02:37:30,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8046 to 8040. [2019-09-10 02:37:30,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8040 states. [2019-09-10 02:37:30,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8040 states to 8040 states and 11575 transitions. [2019-09-10 02:37:30,658 INFO L78 Accepts]: Start accepts. Automaton has 8040 states and 11575 transitions. Word has length 216 [2019-09-10 02:37:30,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:30,660 INFO L475 AbstractCegarLoop]: Abstraction has 8040 states and 11575 transitions. [2019-09-10 02:37:30,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:37:30,660 INFO L276 IsEmpty]: Start isEmpty. Operand 8040 states and 11575 transitions. [2019-09-10 02:37:30,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-10 02:37:30,686 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:30,686 INFO L399 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] [2019-09-10 02:37:30,686 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:30,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:30,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1217345233, now seen corresponding path program 1 times [2019-09-10 02:37:30,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:30,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:30,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:30,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:30,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:30,910 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:37:30,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:30,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 02:37:30,911 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:30,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 02:37:30,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 02:37:30,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:37:30,912 INFO L87 Difference]: Start difference. First operand 8040 states and 11575 transitions. Second operand 11 states. [2019-09-10 02:37:31,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:31,198 INFO L93 Difference]: Finished difference Result 8566 states and 12384 transitions. [2019-09-10 02:37:31,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:37:31,200 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 219 [2019-09-10 02:37:31,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:31,246 INFO L225 Difference]: With dead ends: 8566 [2019-09-10 02:37:31,246 INFO L226 Difference]: Without dead ends: 8550 [2019-09-10 02:37:31,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-10 02:37:31,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8550 states. [2019-09-10 02:37:31,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8550 to 8528. [2019-09-10 02:37:31,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8528 states. [2019-09-10 02:37:31,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8528 states to 8528 states and 12338 transitions. [2019-09-10 02:37:31,506 INFO L78 Accepts]: Start accepts. Automaton has 8528 states and 12338 transitions. Word has length 219 [2019-09-10 02:37:31,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:31,506 INFO L475 AbstractCegarLoop]: Abstraction has 8528 states and 12338 transitions. [2019-09-10 02:37:31,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 02:37:31,507 INFO L276 IsEmpty]: Start isEmpty. Operand 8528 states and 12338 transitions. [2019-09-10 02:37:31,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-10 02:37:31,541 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:31,542 INFO L399 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-09-10 02:37:31,542 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:31,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:31,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1862061334, now seen corresponding path program 1 times [2019-09-10 02:37:31,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:31,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:31,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:31,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:31,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:31,756 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:37:31,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:31,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 02:37:31,757 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:31,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:37:31,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:37:31,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:37:31,759 INFO L87 Difference]: Start difference. First operand 8528 states and 12338 transitions. Second operand 9 states. [2019-09-10 02:37:31,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:31,938 INFO L93 Difference]: Finished difference Result 8590 states and 12400 transitions. [2019-09-10 02:37:31,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:37:31,938 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 220 [2019-09-10 02:37:31,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:31,972 INFO L225 Difference]: With dead ends: 8590 [2019-09-10 02:37:31,972 INFO L226 Difference]: Without dead ends: 8590 [2019-09-10 02:37:31,973 INFO L628 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-09-10 02:37:31,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8590 states. [2019-09-10 02:37:32,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8590 to 8568. [2019-09-10 02:37:32,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8568 states. [2019-09-10 02:37:32,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8568 states to 8568 states and 12378 transitions. [2019-09-10 02:37:32,236 INFO L78 Accepts]: Start accepts. Automaton has 8568 states and 12378 transitions. Word has length 220 [2019-09-10 02:37:32,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:32,236 INFO L475 AbstractCegarLoop]: Abstraction has 8568 states and 12378 transitions. [2019-09-10 02:37:32,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:37:32,237 INFO L276 IsEmpty]: Start isEmpty. Operand 8568 states and 12378 transitions. [2019-09-10 02:37:32,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-10 02:37:32,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:32,263 INFO L399 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] [2019-09-10 02:37:32,264 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:32,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:32,264 INFO L82 PathProgramCache]: Analyzing trace with hash 2088192623, now seen corresponding path program 1 times [2019-09-10 02:37:32,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:32,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:32,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:32,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:32,266 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:32,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:32,555 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:37:32,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:32,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:37:32,556 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:32,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:37:32,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:37:32,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:37:32,558 INFO L87 Difference]: Start difference. First operand 8568 states and 12378 transitions. Second operand 6 states. [2019-09-10 02:37:33,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:33,080 INFO L93 Difference]: Finished difference Result 17303 states and 24993 transitions. [2019-09-10 02:37:33,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:37:33,080 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 219 [2019-09-10 02:37:33,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:33,152 INFO L225 Difference]: With dead ends: 17303 [2019-09-10 02:37:33,152 INFO L226 Difference]: Without dead ends: 17255 [2019-09-10 02:37:33,153 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:37:33,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17255 states. [2019-09-10 02:37:33,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17255 to 17138. [2019-09-10 02:37:33,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17138 states. [2019-09-10 02:37:33,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17138 states to 17138 states and 24803 transitions. [2019-09-10 02:37:33,710 INFO L78 Accepts]: Start accepts. Automaton has 17138 states and 24803 transitions. Word has length 219 [2019-09-10 02:37:33,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:33,710 INFO L475 AbstractCegarLoop]: Abstraction has 17138 states and 24803 transitions. [2019-09-10 02:37:33,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:37:33,711 INFO L276 IsEmpty]: Start isEmpty. Operand 17138 states and 24803 transitions. [2019-09-10 02:37:33,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-09-10 02:37:33,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:33,755 INFO L399 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] [2019-09-10 02:37:33,755 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:33,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:33,755 INFO L82 PathProgramCache]: Analyzing trace with hash 303229700, now seen corresponding path program 1 times [2019-09-10 02:37:33,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:33,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:33,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:33,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:33,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:33,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:33,920 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:37:33,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:33,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:37:33,921 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:33,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:37:33,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:37:33,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:37:33,922 INFO L87 Difference]: Start difference. First operand 17138 states and 24803 transitions. Second operand 6 states. [2019-09-10 02:37:34,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:34,601 INFO L93 Difference]: Finished difference Result 34775 states and 50293 transitions. [2019-09-10 02:37:34,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:37:34,602 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 221 [2019-09-10 02:37:34,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:34,735 INFO L225 Difference]: With dead ends: 34775 [2019-09-10 02:37:34,735 INFO L226 Difference]: Without dead ends: 34719 [2019-09-10 02:37:34,736 INFO L628 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-09-10 02:37:34,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34719 states. [2019-09-10 02:37:36,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34719 to 34298. [2019-09-10 02:37:36,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34298 states. [2019-09-10 02:37:36,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34298 states to 34298 states and 49733 transitions. [2019-09-10 02:37:36,591 INFO L78 Accepts]: Start accepts. Automaton has 34298 states and 49733 transitions. Word has length 221 [2019-09-10 02:37:36,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:36,592 INFO L475 AbstractCegarLoop]: Abstraction has 34298 states and 49733 transitions. [2019-09-10 02:37:36,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:37:36,592 INFO L276 IsEmpty]: Start isEmpty. Operand 34298 states and 49733 transitions. [2019-09-10 02:37:36,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-10 02:37:36,628 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:36,629 INFO L399 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-09-10 02:37:36,629 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:36,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:36,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1480181806, now seen corresponding path program 1 times [2019-09-10 02:37:36,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:36,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:36,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:36,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:36,631 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:36,780 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:37:36,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:36,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 02:37:36,780 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:36,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:37:36,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:37:36,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:37:36,782 INFO L87 Difference]: Start difference. First operand 34298 states and 49733 transitions. Second operand 9 states. [2019-09-10 02:37:37,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:37,046 INFO L93 Difference]: Finished difference Result 36266 states and 52817 transitions. [2019-09-10 02:37:37,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:37:37,047 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 222 [2019-09-10 02:37:37,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:37,165 INFO L225 Difference]: With dead ends: 36266 [2019-09-10 02:37:37,166 INFO L226 Difference]: Without dead ends: 35810 [2019-09-10 02:37:37,166 INFO L628 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-09-10 02:37:37,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35810 states. [2019-09-10 02:37:38,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35810 to 35574. [2019-09-10 02:37:38,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35574 states. [2019-09-10 02:37:38,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35574 states to 35574 states and 51803 transitions. [2019-09-10 02:37:38,411 INFO L78 Accepts]: Start accepts. Automaton has 35574 states and 51803 transitions. Word has length 222 [2019-09-10 02:37:38,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:38,412 INFO L475 AbstractCegarLoop]: Abstraction has 35574 states and 51803 transitions. [2019-09-10 02:37:38,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:37:38,412 INFO L276 IsEmpty]: Start isEmpty. Operand 35574 states and 51803 transitions. [2019-09-10 02:37:38,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-09-10 02:37:38,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:38,460 INFO L399 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-09-10 02:37:38,460 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:38,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:38,461 INFO L82 PathProgramCache]: Analyzing trace with hash -510732559, now seen corresponding path program 1 times [2019-09-10 02:37:38,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:38,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:38,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:38,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:38,462 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:38,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:38,651 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:37:38,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:38,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 02:37:38,654 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:38,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 02:37:38,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 02:37:38,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:37:38,655 INFO L87 Difference]: Start difference. First operand 35574 states and 51803 transitions. Second operand 11 states. [2019-09-10 02:37:38,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:38,986 INFO L93 Difference]: Finished difference Result 36274 states and 52703 transitions. [2019-09-10 02:37:38,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:37:38,987 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 223 [2019-09-10 02:37:38,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:39,113 INFO L225 Difference]: With dead ends: 36274 [2019-09-10 02:37:39,114 INFO L226 Difference]: Without dead ends: 36134 [2019-09-10 02:37:39,114 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-10 02:37:39,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36134 states. [2019-09-10 02:37:40,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36134 to 36014. [2019-09-10 02:37:40,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36014 states. [2019-09-10 02:37:40,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36014 states to 36014 states and 52383 transitions. [2019-09-10 02:37:40,948 INFO L78 Accepts]: Start accepts. Automaton has 36014 states and 52383 transitions. Word has length 223 [2019-09-10 02:37:40,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:40,948 INFO L475 AbstractCegarLoop]: Abstraction has 36014 states and 52383 transitions. [2019-09-10 02:37:40,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 02:37:40,949 INFO L276 IsEmpty]: Start isEmpty. Operand 36014 states and 52383 transitions. [2019-09-10 02:37:40,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-09-10 02:37:41,000 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:41,000 INFO L399 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] [2019-09-10 02:37:41,000 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:41,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:41,001 INFO L82 PathProgramCache]: Analyzing trace with hash 923144819, now seen corresponding path program 1 times [2019-09-10 02:37:41,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:41,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:41,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:41,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:41,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:41,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:41,210 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:37:41,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:41,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 02:37:41,211 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:41,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:37:41,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:37:41,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:37:41,213 INFO L87 Difference]: Start difference. First operand 36014 states and 52383 transitions. Second operand 9 states. [2019-09-10 02:37:41,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:41,485 INFO L93 Difference]: Finished difference Result 35938 states and 52037 transitions. [2019-09-10 02:37:41,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:37:41,486 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 221 [2019-09-10 02:37:41,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:41,610 INFO L225 Difference]: With dead ends: 35938 [2019-09-10 02:37:41,610 INFO L226 Difference]: Without dead ends: 35578 [2019-09-10 02:37:41,611 INFO L628 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-09-10 02:37:41,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35578 states. [2019-09-10 02:37:42,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35578 to 35422. [2019-09-10 02:37:42,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35422 states. [2019-09-10 02:37:42,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35422 states to 35422 states and 51287 transitions. [2019-09-10 02:37:42,611 INFO L78 Accepts]: Start accepts. Automaton has 35422 states and 51287 transitions. Word has length 221 [2019-09-10 02:37:42,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:42,611 INFO L475 AbstractCegarLoop]: Abstraction has 35422 states and 51287 transitions. [2019-09-10 02:37:42,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:37:42,611 INFO L276 IsEmpty]: Start isEmpty. Operand 35422 states and 51287 transitions. [2019-09-10 02:37:42,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-09-10 02:37:42,682 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:42,683 INFO L399 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-09-10 02:37:42,683 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:42,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:42,684 INFO L82 PathProgramCache]: Analyzing trace with hash -2056291753, now seen corresponding path program 1 times [2019-09-10 02:37:42,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:42,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:42,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:42,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:42,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:42,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:42,869 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:37:42,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:42,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 02:37:42,869 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:42,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 02:37:42,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 02:37:42,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:37:42,871 INFO L87 Difference]: Start difference. First operand 35422 states and 51287 transitions. Second operand 11 states. [2019-09-10 02:37:43,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:43,169 INFO L93 Difference]: Finished difference Result 35554 states and 51259 transitions. [2019-09-10 02:37:43,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:37:43,169 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 223 [2019-09-10 02:37:43,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:43,252 INFO L225 Difference]: With dead ends: 35554 [2019-09-10 02:37:43,252 INFO L226 Difference]: Without dead ends: 35424 [2019-09-10 02:37:43,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-10 02:37:43,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35424 states. [2019-09-10 02:37:44,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35424 to 35332. [2019-09-10 02:37:44,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35332 states. [2019-09-10 02:37:44,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35332 states to 35332 states and 51017 transitions. [2019-09-10 02:37:44,221 INFO L78 Accepts]: Start accepts. Automaton has 35332 states and 51017 transitions. Word has length 223 [2019-09-10 02:37:44,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:44,221 INFO L475 AbstractCegarLoop]: Abstraction has 35332 states and 51017 transitions. [2019-09-10 02:37:44,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 02:37:44,222 INFO L276 IsEmpty]: Start isEmpty. Operand 35332 states and 51017 transitions. [2019-09-10 02:37:44,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-09-10 02:37:44,262 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:44,262 INFO L399 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-09-10 02:37:44,262 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:44,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:44,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1622024861, now seen corresponding path program 1 times [2019-09-10 02:37:44,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:44,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:44,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:44,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:44,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:44,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:44,411 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:37:44,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:44,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:37:44,412 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:44,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:37:44,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:37:44,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:37:44,413 INFO L87 Difference]: Start difference. First operand 35332 states and 51017 transitions. Second operand 6 states. [2019-09-10 02:37:45,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:45,291 INFO L93 Difference]: Finished difference Result 70227 states and 101507 transitions. [2019-09-10 02:37:45,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:37:45,292 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 224 [2019-09-10 02:37:45,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:45,486 INFO L225 Difference]: With dead ends: 70227 [2019-09-10 02:37:45,486 INFO L226 Difference]: Without dead ends: 64911 [2019-09-10 02:37:45,487 INFO L628 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-09-10 02:37:45,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64911 states. [2019-09-10 02:37:47,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64911 to 64274. [2019-09-10 02:37:47,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64274 states. [2019-09-10 02:37:48,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64274 states to 64274 states and 93729 transitions. [2019-09-10 02:37:48,123 INFO L78 Accepts]: Start accepts. Automaton has 64274 states and 93729 transitions. Word has length 224 [2019-09-10 02:37:48,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:48,124 INFO L475 AbstractCegarLoop]: Abstraction has 64274 states and 93729 transitions. [2019-09-10 02:37:48,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:37:48,124 INFO L276 IsEmpty]: Start isEmpty. Operand 64274 states and 93729 transitions. [2019-09-10 02:37:48,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-09-10 02:37:48,561 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:48,561 INFO L399 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-09-10 02:37:48,561 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:48,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:48,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1504068169, now seen corresponding path program 1 times [2019-09-10 02:37:48,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:48,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:48,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:48,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:48,563 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:48,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:48,686 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:37:48,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:48,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:37:48,687 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:48,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:37:48,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:37:48,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:37:48,688 INFO L87 Difference]: Start difference. First operand 64274 states and 93729 transitions. Second operand 3 states. [2019-09-10 02:37:48,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:48,973 INFO L93 Difference]: Finished difference Result 78716 states and 119835 transitions. [2019-09-10 02:37:48,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:37:48,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2019-09-10 02:37:48,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:49,188 INFO L225 Difference]: With dead ends: 78716 [2019-09-10 02:37:49,188 INFO L226 Difference]: Without dead ends: 78716 [2019-09-10 02:37:49,189 INFO L628 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-09-10 02:37:49,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78716 states. [2019-09-10 02:37:52,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78716 to 78674. [2019-09-10 02:37:52,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78674 states. [2019-09-10 02:37:52,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78674 states to 78674 states and 119793 transitions. [2019-09-10 02:37:52,518 INFO L78 Accepts]: Start accepts. Automaton has 78674 states and 119793 transitions. Word has length 224 [2019-09-10 02:37:52,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:52,518 INFO L475 AbstractCegarLoop]: Abstraction has 78674 states and 119793 transitions. [2019-09-10 02:37:52,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:37:52,518 INFO L276 IsEmpty]: Start isEmpty. Operand 78674 states and 119793 transitions. [2019-09-10 02:37:52,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 02:37:52,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:52,633 INFO L399 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-09-10 02:37:52,633 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:52,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:52,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1110244217, now seen corresponding path program 1 times [2019-09-10 02:37:52,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:52,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:52,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:52,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:52,634 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:52,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:52,748 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:37:52,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:52,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:37:52,748 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:52,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:37:52,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:37:52,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:37:52,749 INFO L87 Difference]: Start difference. First operand 78674 states and 119793 transitions. Second operand 3 states. [2019-09-10 02:37:53,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:53,137 INFO L93 Difference]: Finished difference Result 106364 states and 169275 transitions. [2019-09-10 02:37:53,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:37:53,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2019-09-10 02:37:53,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:53,449 INFO L225 Difference]: With dead ends: 106364 [2019-09-10 02:37:53,449 INFO L226 Difference]: Without dead ends: 106364 [2019-09-10 02:37:53,450 INFO L628 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-09-10 02:37:53,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106364 states. [2019-09-10 02:37:56,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106364 to 106322. [2019-09-10 02:37:56,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106322 states. [2019-09-10 02:37:59,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106322 states to 106322 states and 169233 transitions. [2019-09-10 02:37:59,472 INFO L78 Accepts]: Start accepts. Automaton has 106322 states and 169233 transitions. Word has length 225 [2019-09-10 02:37:59,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:59,472 INFO L475 AbstractCegarLoop]: Abstraction has 106322 states and 169233 transitions. [2019-09-10 02:37:59,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:37:59,473 INFO L276 IsEmpty]: Start isEmpty. Operand 106322 states and 169233 transitions. [2019-09-10 02:37:59,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-09-10 02:37:59,768 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:59,768 INFO L399 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] [2019-09-10 02:37:59,769 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:59,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:59,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1149406743, now seen corresponding path program 1 times [2019-09-10 02:37:59,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:59,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:59,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:59,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:59,771 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:59,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:59,935 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:37:59,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:59,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:37:59,936 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:59,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:37:59,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:37:59,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:37:59,937 INFO L87 Difference]: Start difference. First operand 106322 states and 169233 transitions. Second operand 7 states. [2019-09-10 02:38:02,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:38:02,295 INFO L93 Difference]: Finished difference Result 187114 states and 281291 transitions. [2019-09-10 02:38:02,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 02:38:02,298 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 226 [2019-09-10 02:38:02,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:38:03,103 INFO L225 Difference]: With dead ends: 187114 [2019-09-10 02:38:03,103 INFO L226 Difference]: Without dead ends: 184354 [2019-09-10 02:38:03,104 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 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-09-10 02:38:03,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184354 states. [2019-09-10 02:38:09,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184354 to 183862. [2019-09-10 02:38:09,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183862 states. [2019-09-10 02:38:10,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183862 states to 183862 states and 275886 transitions. [2019-09-10 02:38:10,435 INFO L78 Accepts]: Start accepts. Automaton has 183862 states and 275886 transitions. Word has length 226 [2019-09-10 02:38:10,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:38:10,436 INFO L475 AbstractCegarLoop]: Abstraction has 183862 states and 275886 transitions. [2019-09-10 02:38:10,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:38:10,436 INFO L276 IsEmpty]: Start isEmpty. Operand 183862 states and 275886 transitions. [2019-09-10 02:38:10,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-09-10 02:38:10,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:38:10,669 INFO L399 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-09-10 02:38:10,669 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:38:10,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:38:10,670 INFO L82 PathProgramCache]: Analyzing trace with hash -917777599, now seen corresponding path program 1 times [2019-09-10 02:38:10,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:38:10,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:10,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:38:10,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:10,671 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:38:11,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:38:11,884 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:38:11,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:38:11,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-10 02:38:11,885 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:38:11,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 02:38:11,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 02:38:11,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-09-10 02:38:11,887 INFO L87 Difference]: Start difference. First operand 183862 states and 275886 transitions. Second operand 24 states. [2019-09-10 02:38:13,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:38:13,447 INFO L93 Difference]: Finished difference Result 201335 states and 303013 transitions. [2019-09-10 02:38:13,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 02:38:13,448 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 227 [2019-09-10 02:38:13,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:38:14,207 INFO L225 Difference]: With dead ends: 201335 [2019-09-10 02:38:14,207 INFO L226 Difference]: Without dead ends: 190741 [2019-09-10 02:38:14,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 02:38:14,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190741 states. [2019-09-10 02:38:22,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190741 to 186236. [2019-09-10 02:38:22,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186236 states. [2019-09-10 02:38:22,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186236 states to 186236 states and 279876 transitions. [2019-09-10 02:38:22,991 INFO L78 Accepts]: Start accepts. Automaton has 186236 states and 279876 transitions. Word has length 227 [2019-09-10 02:38:22,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:38:22,991 INFO L475 AbstractCegarLoop]: Abstraction has 186236 states and 279876 transitions. [2019-09-10 02:38:22,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 02:38:22,991 INFO L276 IsEmpty]: Start isEmpty. Operand 186236 states and 279876 transitions. [2019-09-10 02:38:23,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-10 02:38:23,219 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:38:23,219 INFO L399 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] [2019-09-10 02:38:23,219 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:38:23,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:38:23,220 INFO L82 PathProgramCache]: Analyzing trace with hash 717987149, now seen corresponding path program 1 times [2019-09-10 02:38:23,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:38:23,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:23,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:38:23,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:23,221 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:38:23,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:38:23,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-09-10 02:38:23,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:38:23,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:38:23,391 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:38:23,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:38:23,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:38:23,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:38:23,395 INFO L87 Difference]: Start difference. First operand 186236 states and 279876 transitions. Second operand 10 states. [2019-09-10 02:38:24,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:38:24,188 INFO L93 Difference]: Finished difference Result 187070 states and 280827 transitions. [2019-09-10 02:38:24,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 02:38:24,188 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 231 [2019-09-10 02:38:24,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:38:24,922 INFO L225 Difference]: With dead ends: 187070 [2019-09-10 02:38:24,923 INFO L226 Difference]: Without dead ends: 185632 [2019-09-10 02:38:24,929 INFO L628 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-09-10 02:38:25,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185632 states. [2019-09-10 02:38:32,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185632 to 185560. [2019-09-10 02:38:32,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185560 states. [2019-09-10 02:38:33,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185560 states to 185560 states and 278542 transitions. [2019-09-10 02:38:33,402 INFO L78 Accepts]: Start accepts. Automaton has 185560 states and 278542 transitions. Word has length 231 [2019-09-10 02:38:33,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:38:33,402 INFO L475 AbstractCegarLoop]: Abstraction has 185560 states and 278542 transitions. [2019-09-10 02:38:33,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:38:33,402 INFO L276 IsEmpty]: Start isEmpty. Operand 185560 states and 278542 transitions. [2019-09-10 02:38:33,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-10 02:38:33,640 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:38:33,641 INFO L399 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] [2019-09-10 02:38:33,641 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:38:33,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:38:33,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1571698250, now seen corresponding path program 1 times [2019-09-10 02:38:33,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:38:33,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:33,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:38:33,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:33,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:38:33,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:38:33,779 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:38:33,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:38:33,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:38:33,780 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:38:33,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:38:33,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:38:33,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:38:33,781 INFO L87 Difference]: Start difference. First operand 185560 states and 278542 transitions. Second operand 5 states. [2019-09-10 02:38:34,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:38:34,566 INFO L93 Difference]: Finished difference Result 188898 states and 282902 transitions. [2019-09-10 02:38:34,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:38:34,567 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 236 [2019-09-10 02:38:34,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:38:35,257 INFO L225 Difference]: With dead ends: 188898 [2019-09-10 02:38:35,257 INFO L226 Difference]: Without dead ends: 188898 [2019-09-10 02:38:35,258 INFO L628 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-09-10 02:38:35,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188898 states. [2019-09-10 02:38:44,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188898 to 187368. [2019-09-10 02:38:44,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187368 states. [2019-09-10 02:38:44,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187368 states to 187368 states and 280560 transitions. [2019-09-10 02:38:44,856 INFO L78 Accepts]: Start accepts. Automaton has 187368 states and 280560 transitions. Word has length 236 [2019-09-10 02:38:44,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:38:44,857 INFO L475 AbstractCegarLoop]: Abstraction has 187368 states and 280560 transitions. [2019-09-10 02:38:44,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:38:44,857 INFO L276 IsEmpty]: Start isEmpty. Operand 187368 states and 280560 transitions. [2019-09-10 02:38:45,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-10 02:38:45,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:38:45,080 INFO L399 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] [2019-09-10 02:38:45,080 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:38:45,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:38:45,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1046121598, now seen corresponding path program 1 times [2019-09-10 02:38:45,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:38:45,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:45,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:38:45,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:45,082 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:38:45,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:38:45,220 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:38:45,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:38:45,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 02:38:45,221 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:38:45,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:38:45,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:38:45,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:38:45,222 INFO L87 Difference]: Start difference. First operand 187368 states and 280560 transitions. Second operand 9 states. [2019-09-10 02:38:46,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:38:46,905 INFO L93 Difference]: Finished difference Result 187168 states and 279310 transitions. [2019-09-10 02:38:46,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:38:46,906 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 236 [2019-09-10 02:38:46,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:38:47,489 INFO L225 Difference]: With dead ends: 187168 [2019-09-10 02:38:47,489 INFO L226 Difference]: Without dead ends: 187104 [2019-09-10 02:38:47,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-09-10 02:38:47,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187104 states. [2019-09-10 02:38:56,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187104 to 186204. [2019-09-10 02:38:56,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186204 states. [2019-09-10 02:38:57,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186204 states to 186204 states and 278244 transitions. [2019-09-10 02:38:57,810 INFO L78 Accepts]: Start accepts. Automaton has 186204 states and 278244 transitions. Word has length 236 [2019-09-10 02:38:57,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:38:57,810 INFO L475 AbstractCegarLoop]: Abstraction has 186204 states and 278244 transitions. [2019-09-10 02:38:57,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:38:57,810 INFO L276 IsEmpty]: Start isEmpty. Operand 186204 states and 278244 transitions. [2019-09-10 02:38:58,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-10 02:38:58,043 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:38:58,043 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 02:38:58,043 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:38:58,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:38:58,044 INFO L82 PathProgramCache]: Analyzing trace with hash 627123136, now seen corresponding path program 1 times [2019-09-10 02:38:58,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:38:58,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:58,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:38:58,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:58,045 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:38:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:38:58,157 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-10 02:38:58,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:38:58,158 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:38:58,159 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 243 with the following transitions: [2019-09-10 02:38:58,161 INFO L207 CegarAbsIntRunner]: [44], [47], [50], [85], [89], [93], [96], [98], [123], [139], [142], [151], [152], [155], [156], [157], [159], [269], [271], [275], [278], [279], [280], [283], [289], [313], [315], [316], [319], [328], [339], [341], [344], [348], [349], [351], [352], [355], [365], [366], [367], [396], [399], [408], [505], [586], [588], [589], [590], [597], [608], [610], [615], [639], [642], [656], [685], [686], [697], [699], [735], [739], [742], [750], [753], [770], [774], [777], [783], [784], [786], [811], [817], [826], [830], [832], [834], [837], [844], [851], [858], [865], [872], [879], [886], [893], [900], [907], [910], [912], [1117], [1171], [1173], [1175], [1178], [1186], [1191], [1194], [1203], [1204], [1215], [1218], [1224], [1226], [1227], [1230], [1231], [1234], [1237], [1268], [1269], [1271], [1340], [1343], [1349], [1350], [1354], [1358], [1361], [1363], [1384], [1387], [1401], [1409], [1412], [1414], [1417], [1421], [1610], [1612], [1614], [1616], [1617], [1629], [1630], [1631], [1632], [1633], [1634], [1635], [1647], [1657], [1658], [1659], [1660], [1661], [1662], [1665], [1666], [1667], [1668], [1669], [1671], [1672], [1673], [1674], [1681], [1682], [1687], [1688], [1691], [1692], [1705], [1721], [1722], [1729], [1730], [1731], [1732], [1733], [1741], [1742], [1743], [1745], [1746], [1747], [1748], [1749], [1750], [1751], [1752], [1753], [1755], [1756], [1757], [1758], [1773], [1774], [1785], [1799], [1800], [1809], [1811], [1812], [1813], [1814], [1815], [1816], [1817], [1818], [1819], [1821], [1822], [1823], [1824], [1827], [1828], [1829], [1830], [1831], [1832], [1833], [1847], [1848], [1849], [1850], [1851], [1852], [1853], [1854], [1855] [2019-09-10 02:38:58,218 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:38:58,219 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:38:58,361 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 02:38:58,362 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 185 root evaluator evaluations with a maximum evaluation depth of 0. Performed 185 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 364 variables. [2019-09-10 02:38:58,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:38:58,366 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 02:38:58,462 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-10 02:38:58,462 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 02:38:58,476 INFO L420 sIntCurrentIteration]: We unified 241 AI predicates to 241 [2019-09-10 02:38:58,477 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 02:38:58,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 02:38:58,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2019-09-10 02:38:58,479 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:38:58,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:38:58,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:38:58,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:38:58,481 INFO L87 Difference]: Start difference. First operand 186204 states and 278244 transitions. Second operand 2 states. [2019-09-10 02:38:58,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:38:58,482 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-10 02:38:58,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:38:58,482 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 242 [2019-09-10 02:38:58,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:38:58,482 INFO L225 Difference]: With dead ends: 2 [2019-09-10 02:38:58,483 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 02:38:58,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 241 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-09-10 02:38:58,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 02:38:58,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 02:38:58,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 02:38:58,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 02:38:58,484 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 242 [2019-09-10 02:38:58,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:38:58,484 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 02:38:58,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:38:58,484 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 02:38:58,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 02:38:58,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 02:38:58 BoogieIcfgContainer [2019-09-10 02:38:58,492 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 02:38:58,495 INFO L168 Benchmark]: Toolchain (without parser) took 108876.08 ms. Allocated memory was 135.8 MB in the beginning and 3.3 GB in the end (delta: 3.2 GB). Free memory was 88.3 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-09-10 02:38:58,496 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 135.8 MB. Free memory was 109.1 MB in the beginning and 108.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 02:38:58,497 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1124.58 ms. Allocated memory was 135.8 MB in the beginning and 203.9 MB in the end (delta: 68.2 MB). Free memory was 88.1 MB in the beginning and 135.4 MB in the end (delta: -47.2 MB). Peak memory consumption was 32.5 MB. Max. memory is 7.1 GB. [2019-09-10 02:38:58,497 INFO L168 Benchmark]: Boogie Preprocessor took 183.31 ms. Allocated memory is still 203.9 MB. Free memory was 135.4 MB in the beginning and 126.6 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 7.1 GB. [2019-09-10 02:38:58,498 INFO L168 Benchmark]: RCFGBuilder took 2496.33 ms. Allocated memory was 203.9 MB in the beginning and 255.9 MB in the end (delta: 51.9 MB). Free memory was 126.6 MB in the beginning and 155.0 MB in the end (delta: -28.4 MB). Peak memory consumption was 83.3 MB. Max. memory is 7.1 GB. [2019-09-10 02:38:58,499 INFO L168 Benchmark]: TraceAbstraction took 105067.14 ms. Allocated memory was 255.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 155.0 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-09-10 02:38:58,503 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 135.8 MB. Free memory was 109.1 MB in the beginning and 108.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1124.58 ms. Allocated memory was 135.8 MB in the beginning and 203.9 MB in the end (delta: 68.2 MB). Free memory was 88.1 MB in the beginning and 135.4 MB in the end (delta: -47.2 MB). Peak memory consumption was 32.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 183.31 ms. Allocated memory is still 203.9 MB. Free memory was 135.4 MB in the beginning and 126.6 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2496.33 ms. Allocated memory was 203.9 MB in the beginning and 255.9 MB in the end (delta: 51.9 MB). Free memory was 126.6 MB in the beginning and 155.0 MB in the end (delta: -28.4 MB). Peak memory consumption was 83.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 105067.14 ms. Allocated memory was 255.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 155.0 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 184]: 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, 757 locations, 1 error locations. SAFE Result, 105.0s OverallTime, 27 OverallIterations, 3 TraceHistogramMax, 29.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 19224 SDtfs, 9237 SDslu, 114245 SDs, 0 SdLazy, 12613 SolverSat, 1070 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 632 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 307 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1417 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=187368occurred in iteration=25, 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.896265560165975 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 65.5s AutomataMinimizationTime, 27 MinimizatonAttempts, 9581 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 5972 NumberOfCodeBlocks, 5972 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 5945 ConstructedInterpolants, 0 QuantifiedInterpolants, 1671845 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 26 PerfectInterpolantSequences, 1019/1022 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...