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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/email_spec6_product15.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 05:22:21,659 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 05:22:21,661 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 05:22:21,673 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 05:22:21,674 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 05:22:21,675 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 05:22:21,676 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 05:22:21,678 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 05:22:21,679 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 05:22:21,680 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 05:22:21,681 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 05:22:21,682 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 05:22:21,683 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 05:22:21,684 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 05:22:21,685 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 05:22:21,686 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 05:22:21,687 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 05:22:21,688 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 05:22:21,689 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 05:22:21,692 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 05:22:21,693 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 05:22:21,694 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 05:22:21,695 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 05:22:21,696 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 05:22:21,699 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 05:22:21,699 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 05:22:21,699 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 05:22:21,700 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 05:22:21,701 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 05:22:21,702 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 05:22:21,702 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 05:22:21,706 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 05:22:21,707 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 05:22:21,708 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 05:22:21,709 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 05:22:21,709 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 05:22:21,710 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 05:22:21,710 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 05:22:21,711 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 05:22:21,712 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 05:22:21,712 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 05:22:21,713 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 05:22:21,728 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 05:22:21,728 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 05:22:21,729 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 05:22:21,730 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 05:22:21,730 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 05:22:21,730 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 05:22:21,730 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 05:22:21,731 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 05:22:21,731 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 05:22:21,731 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 05:22:21,731 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 05:22:21,731 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 05:22:21,732 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 05:22:21,732 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 05:22:21,732 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 05:22:21,732 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 05:22:21,732 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 05:22:21,733 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 05:22:21,733 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 05:22:21,733 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 05:22:21,733 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 05:22:21,733 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 05:22:21,734 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 05:22:21,734 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 05:22:21,734 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 05:22:21,734 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 05:22:21,734 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 05:22:21,735 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 05:22:21,735 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 05:22:21,763 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 05:22:21,775 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 05:22:21,779 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 05:22:21,780 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 05:22:21,781 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 05:22:21,781 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec6_product15.cil.c [2019-09-08 05:22:21,841 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/358223fbb/fbe2861939c244f3a8ac99b36e9ba154/FLAG1c1a018ea [2019-09-08 05:22:22,541 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 05:22:22,542 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec6_product15.cil.c [2019-09-08 05:22:22,564 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/358223fbb/fbe2861939c244f3a8ac99b36e9ba154/FLAG1c1a018ea [2019-09-08 05:22:22,688 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/358223fbb/fbe2861939c244f3a8ac99b36e9ba154 [2019-09-08 05:22:22,697 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 05:22:22,698 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 05:22:22,699 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 05:22:22,699 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 05:22:22,703 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 05:22:22,704 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:22:22" (1/1) ... [2019-09-08 05:22:22,707 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30c543f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:22:22, skipping insertion in model container [2019-09-08 05:22:22,707 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:22:22" (1/1) ... [2019-09-08 05:22:22,715 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 05:22:22,807 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 05:22:23,498 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:22:23,526 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 05:22:23,694 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:22:23,782 INFO L192 MainTranslator]: Completed translation [2019-09-08 05:22:23,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:22:23 WrapperNode [2019-09-08 05:22:23,782 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 05:22:23,783 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 05:22:23,783 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 05:22:23,783 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 05:22:23,798 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:22:23" (1/1) ... [2019-09-08 05:22:23,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:22:23" (1/1) ... [2019-09-08 05:22:23,834 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:22:23" (1/1) ... [2019-09-08 05:22:23,835 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:22:23" (1/1) ... [2019-09-08 05:22:23,906 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:22:23" (1/1) ... [2019-09-08 05:22:23,924 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:22:23" (1/1) ... [2019-09-08 05:22:23,936 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:22:23" (1/1) ... [2019-09-08 05:22:23,953 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 05:22:23,954 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 05:22:23,954 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 05:22:23,954 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 05:22:23,955 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:22:23" (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-08 05:22:24,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 05:22:24,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 05:22:24,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 05:22:24,050 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 05:22:24,050 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 05:22:24,050 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-08 05:22:24,051 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-08 05:22:24,051 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-08 05:22:24,051 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-08 05:22:24,051 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-09-08 05:22:24,052 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AutoResponder [2019-09-08 05:22:24,052 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-08 05:22:24,052 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-08 05:22:24,052 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-08 05:22:24,053 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-08 05:22:24,053 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-08 05:22:24,053 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-08 05:22:24,053 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-08 05:22:24,054 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-08 05:22:24,054 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-08 05:22:24,054 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-09-08 05:22:24,054 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-08 05:22:24,055 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-08 05:22:24,056 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-08 05:22:24,056 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-08 05:22:24,056 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-08 05:22:24,056 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-08 05:22:24,056 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-08 05:22:24,057 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-08 05:22:24,057 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-08 05:22:24,057 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-08 05:22:24,057 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-08 05:22:24,057 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-08 05:22:24,058 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-08 05:22:24,058 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-08 05:22:24,058 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-08 05:22:24,058 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-08 05:22:24,058 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-08 05:22:24,058 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-08 05:22:24,059 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-08 05:22:24,059 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-08 05:22:24,059 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-08 05:22:24,059 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-08 05:22:24,059 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-08 05:22:24,060 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-08 05:22:24,060 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-08 05:22:24,060 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-08 05:22:24,060 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-08 05:22:24,060 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-08 05:22:24,061 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-08 05:22:24,061 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-08 05:22:24,061 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-08 05:22:24,061 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-08 05:22:24,061 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-08 05:22:24,061 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-08 05:22:24,062 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-08 05:22:24,062 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-08 05:22:24,062 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-08 05:22:24,062 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-08 05:22:24,062 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-08 05:22:24,063 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-08 05:22:24,063 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-08 05:22:24,063 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-08 05:22:24,063 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-08 05:22:24,063 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-08 05:22:24,063 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-08 05:22:24,064 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-08 05:22:24,064 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-08 05:22:24,064 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-08 05:22:24,064 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-08 05:22:24,064 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-08 05:22:24,064 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-08 05:22:24,065 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-08 05:22:24,065 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-08 05:22:24,065 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-08 05:22:24,065 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-08 05:22:24,065 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-08 05:22:24,065 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-08 05:22:24,066 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 05:22:24,066 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 05:22:24,066 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 05:22:24,066 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 05:22:24,066 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptDecrypt_spec__1 [2019-09-08 05:22:24,066 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptDecrypt_spec__2 [2019-09-08 05:22:24,067 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-08 05:22:24,067 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-08 05:22:24,067 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-08 05:22:24,067 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-08 05:22:24,067 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-08 05:22:24,067 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-08 05:22:24,067 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-08 05:22:24,068 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-08 05:22:24,068 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 05:22:24,068 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 05:22:24,068 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-08 05:22:24,068 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-08 05:22:24,068 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-08 05:22:24,069 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-08 05:22:24,069 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-08 05:22:24,069 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-08 05:22:24,069 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-08 05:22:24,069 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-08 05:22:24,069 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-08 05:22:24,069 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-09-08 05:22:24,070 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 05:22:24,070 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 05:22:24,070 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 05:22:24,070 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 05:22:24,070 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 05:22:24,070 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 05:22:24,071 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 05:22:24,071 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 05:22:24,071 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-08 05:22:24,071 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-09-08 05:22:24,071 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-08 05:22:24,071 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-08 05:22:24,072 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-08 05:22:24,072 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-08 05:22:24,072 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-08 05:22:24,072 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-08 05:22:24,072 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-08 05:22:24,072 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 05:22:24,072 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 05:22:24,073 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 05:22:24,073 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-08 05:22:24,073 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-08 05:22:24,073 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-08 05:22:24,073 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-08 05:22:24,073 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-08 05:22:24,074 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-08 05:22:24,074 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-08 05:22:24,074 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-08 05:22:24,074 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-08 05:22:24,074 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-08 05:22:24,074 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-08 05:22:24,074 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-08 05:22:24,075 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-08 05:22:24,075 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-08 05:22:24,075 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-08 05:22:24,075 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-08 05:22:24,075 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-08 05:22:24,075 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-08 05:22:24,076 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-08 05:22:24,076 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-08 05:22:24,076 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-08 05:22:24,076 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-08 05:22:24,076 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-08 05:22:24,076 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-08 05:22:24,077 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-08 05:22:24,077 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-08 05:22:24,077 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-08 05:22:24,077 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-08 05:22:24,077 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-09-08 05:22:24,077 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptDecrypt_spec__1 [2019-09-08 05:22:24,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 05:22:24,078 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-08 05:22:24,078 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-09-08 05:22:24,078 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AutoResponder [2019-09-08 05:22:24,078 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptDecrypt_spec__2 [2019-09-08 05:22:24,078 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-08 05:22:24,078 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-08 05:22:24,078 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-08 05:22:24,079 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-08 05:22:24,079 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-08 05:22:24,079 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-08 05:22:24,079 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-08 05:22:24,079 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-08 05:22:24,079 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-08 05:22:24,079 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-08 05:22:24,080 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-08 05:22:24,080 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-08 05:22:24,080 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-08 05:22:24,080 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-08 05:22:24,080 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-08 05:22:24,080 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-08 05:22:24,080 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-08 05:22:24,081 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-08 05:22:24,081 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-08 05:22:24,081 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-08 05:22:24,081 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-08 05:22:24,081 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-08 05:22:24,081 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-08 05:22:24,081 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-08 05:22:24,082 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-08 05:22:24,082 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-08 05:22:24,082 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-08 05:22:24,082 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-08 05:22:24,082 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-08 05:22:24,082 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-08 05:22:24,082 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-08 05:22:24,082 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-08 05:22:24,083 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-08 05:22:24,083 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-08 05:22:24,083 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-08 05:22:24,083 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-08 05:22:24,083 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-08 05:22:24,083 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-08 05:22:24,083 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-08 05:22:24,084 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-08 05:22:24,084 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-08 05:22:24,084 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-08 05:22:24,084 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 05:22:24,084 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 05:22:24,084 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 05:22:24,084 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 05:22:24,085 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-08 05:22:24,085 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-08 05:22:24,085 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-08 05:22:24,085 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-08 05:22:24,085 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 05:22:24,085 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 05:22:24,085 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-08 05:22:24,086 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-08 05:22:24,086 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-08 05:22:24,086 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-08 05:22:24,086 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-08 05:22:24,086 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 05:22:24,086 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 05:22:24,086 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 05:22:24,087 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 05:22:24,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 05:22:24,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 05:22:24,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 05:22:24,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 05:22:24,087 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 05:22:24,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 05:22:24,088 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 05:22:24,088 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 05:22:24,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 05:22:24,088 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 05:22:24,088 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 05:22:24,088 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 05:22:24,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 05:22:24,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 05:22:24,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 05:22:26,210 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 05:22:26,211 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 05:22:26,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:22:26 BoogieIcfgContainer [2019-09-08 05:22:26,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 05:22:26,214 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 05:22:26,214 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 05:22:26,218 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 05:22:26,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 05:22:22" (1/3) ... [2019-09-08 05:22:26,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49aa9fb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:22:26, skipping insertion in model container [2019-09-08 05:22:26,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:22:23" (2/3) ... [2019-09-08 05:22:26,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49aa9fb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:22:26, skipping insertion in model container [2019-09-08 05:22:26,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:22:26" (3/3) ... [2019-09-08 05:22:26,223 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec6_product15.cil.c [2019-09-08 05:22:26,236 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 05:22:26,247 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 05:22:26,264 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 05:22:26,300 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 05:22:26,301 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 05:22:26,301 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 05:22:26,301 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 05:22:26,302 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 05:22:26,302 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 05:22:26,302 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 05:22:26,302 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 05:22:26,302 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 05:22:26,332 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states. [2019-09-08 05:22:26,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 05:22:26,354 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:22:26,355 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:22:26,358 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:22:26,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:22:26,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1208653577, now seen corresponding path program 1 times [2019-09-08 05:22:26,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:22:26,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:22:26,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:26,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:22:26,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:26,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:22:27,096 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:22:27,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:22:27,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 05:22:27,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 05:22:27,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 05:22:27,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 05:22:27,123 INFO L87 Difference]: Start difference. First operand 474 states. Second operand 2 states. [2019-09-08 05:22:27,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:22:27,249 INFO L93 Difference]: Finished difference Result 642 states and 852 transitions. [2019-09-08 05:22:27,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 05:22:27,251 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 176 [2019-09-08 05:22:27,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:22:27,289 INFO L225 Difference]: With dead ends: 642 [2019-09-08 05:22:27,289 INFO L226 Difference]: Without dead ends: 427 [2019-09-08 05:22:27,300 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-08 05:22:27,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-09-08 05:22:27,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2019-09-08 05:22:27,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-09-08 05:22:27,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 570 transitions. [2019-09-08 05:22:27,447 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 570 transitions. Word has length 176 [2019-09-08 05:22:27,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:22:27,451 INFO L475 AbstractCegarLoop]: Abstraction has 427 states and 570 transitions. [2019-09-08 05:22:27,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 05:22:27,451 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 570 transitions. [2019-09-08 05:22:27,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-08 05:22:27,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:22:27,467 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:22:27,467 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:22:27,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:22:27,469 INFO L82 PathProgramCache]: Analyzing trace with hash -819004996, now seen corresponding path program 1 times [2019-09-08 05:22:27,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:22:27,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:22:27,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:27,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:22:27,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:27,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:22:27,743 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:22:27,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:22:27,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:22:27,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:22:27,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:22:27,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:22:27,754 INFO L87 Difference]: Start difference. First operand 427 states and 570 transitions. Second operand 3 states. [2019-09-08 05:22:27,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:22:27,807 INFO L93 Difference]: Finished difference Result 625 states and 820 transitions. [2019-09-08 05:22:27,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:22:27,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2019-09-08 05:22:27,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:22:27,812 INFO L225 Difference]: With dead ends: 625 [2019-09-08 05:22:27,812 INFO L226 Difference]: Without dead ends: 430 [2019-09-08 05:22:27,814 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-08 05:22:27,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-09-08 05:22:27,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 429. [2019-09-08 05:22:27,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-09-08 05:22:27,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 572 transitions. [2019-09-08 05:22:27,841 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 572 transitions. Word has length 177 [2019-09-08 05:22:27,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:22:27,842 INFO L475 AbstractCegarLoop]: Abstraction has 429 states and 572 transitions. [2019-09-08 05:22:27,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:22:27,843 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 572 transitions. [2019-09-08 05:22:27,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-08 05:22:27,849 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:22:27,849 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:22:27,850 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:22:27,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:22:27,850 INFO L82 PathProgramCache]: Analyzing trace with hash 2130216492, now seen corresponding path program 1 times [2019-09-08 05:22:27,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:22:27,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:22:27,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:27,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:22:27,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:27,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:22:28,043 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:22:28,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:22:28,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:22:28,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:22:28,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:22:28,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:22:28,048 INFO L87 Difference]: Start difference. First operand 429 states and 572 transitions. Second operand 3 states. [2019-09-08 05:22:28,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:22:28,088 INFO L93 Difference]: Finished difference Result 834 states and 1142 transitions. [2019-09-08 05:22:28,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:22:28,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-09-08 05:22:28,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:22:28,093 INFO L225 Difference]: With dead ends: 834 [2019-09-08 05:22:28,093 INFO L226 Difference]: Without dead ends: 470 [2019-09-08 05:22:28,095 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-08 05:22:28,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-09-08 05:22:28,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 469. [2019-09-08 05:22:28,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2019-09-08 05:22:28,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 641 transitions. [2019-09-08 05:22:28,116 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 641 transitions. Word has length 187 [2019-09-08 05:22:28,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:22:28,117 INFO L475 AbstractCegarLoop]: Abstraction has 469 states and 641 transitions. [2019-09-08 05:22:28,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:22:28,117 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 641 transitions. [2019-09-08 05:22:28,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-08 05:22:28,121 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:22:28,121 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:22:28,121 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:22:28,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:22:28,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1179138555, now seen corresponding path program 1 times [2019-09-08 05:22:28,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:22:28,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:22:28,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:28,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:22:28,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:28,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:22:28,342 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:22:28,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:22:28,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:22:28,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:22:28,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:22:28,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:22:28,344 INFO L87 Difference]: Start difference. First operand 469 states and 641 transitions. Second operand 3 states. [2019-09-08 05:22:28,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:22:28,390 INFO L93 Difference]: Finished difference Result 951 states and 1344 transitions. [2019-09-08 05:22:28,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:22:28,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-09-08 05:22:28,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:22:28,398 INFO L225 Difference]: With dead ends: 951 [2019-09-08 05:22:28,399 INFO L226 Difference]: Without dead ends: 547 [2019-09-08 05:22:28,402 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-08 05:22:28,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-09-08 05:22:28,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 546. [2019-09-08 05:22:28,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2019-09-08 05:22:28,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 773 transitions. [2019-09-08 05:22:28,454 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 773 transitions. Word has length 188 [2019-09-08 05:22:28,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:22:28,455 INFO L475 AbstractCegarLoop]: Abstraction has 546 states and 773 transitions. [2019-09-08 05:22:28,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:22:28,455 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 773 transitions. [2019-09-08 05:22:28,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-08 05:22:28,459 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:22:28,459 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:22:28,460 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:22:28,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:22:28,460 INFO L82 PathProgramCache]: Analyzing trace with hash -2052303444, now seen corresponding path program 1 times [2019-09-08 05:22:28,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:22:28,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:22:28,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:28,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:22:28,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:28,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:22:28,621 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:22:28,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:22:28,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:22:28,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:22:28,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:22:28,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:22:28,624 INFO L87 Difference]: Start difference. First operand 546 states and 773 transitions. Second operand 3 states. [2019-09-08 05:22:28,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:22:28,668 INFO L93 Difference]: Finished difference Result 1176 states and 1730 transitions. [2019-09-08 05:22:28,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:22:28,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2019-09-08 05:22:28,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:22:28,675 INFO L225 Difference]: With dead ends: 1176 [2019-09-08 05:22:28,676 INFO L226 Difference]: Without dead ends: 695 [2019-09-08 05:22:28,678 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-08 05:22:28,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2019-09-08 05:22:28,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 694. [2019-09-08 05:22:28,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2019-09-08 05:22:28,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1025 transitions. [2019-09-08 05:22:28,726 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1025 transitions. Word has length 189 [2019-09-08 05:22:28,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:22:28,727 INFO L475 AbstractCegarLoop]: Abstraction has 694 states and 1025 transitions. [2019-09-08 05:22:28,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:22:28,727 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1025 transitions. [2019-09-08 05:22:28,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-08 05:22:28,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:22:28,732 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:22:28,733 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:22:28,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:22:28,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1144858235, now seen corresponding path program 1 times [2019-09-08 05:22:28,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:22:28,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:22:28,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:28,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:22:28,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:28,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:22:28,980 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:22:28,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:22:28,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:22:28,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:22:28,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:22:28,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:22:28,982 INFO L87 Difference]: Start difference. First operand 694 states and 1025 transitions. Second operand 3 states. [2019-09-08 05:22:29,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:22:29,044 INFO L93 Difference]: Finished difference Result 1608 states and 2466 transitions. [2019-09-08 05:22:29,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:22:29,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2019-09-08 05:22:29,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:22:29,053 INFO L225 Difference]: With dead ends: 1608 [2019-09-08 05:22:29,054 INFO L226 Difference]: Without dead ends: 979 [2019-09-08 05:22:29,056 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-08 05:22:29,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2019-09-08 05:22:29,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 978. [2019-09-08 05:22:29,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 978 states. [2019-09-08 05:22:29,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1505 transitions. [2019-09-08 05:22:29,105 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1505 transitions. Word has length 190 [2019-09-08 05:22:29,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:22:29,108 INFO L475 AbstractCegarLoop]: Abstraction has 978 states and 1505 transitions. [2019-09-08 05:22:29,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:22:29,108 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1505 transitions. [2019-09-08 05:22:29,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-08 05:22:29,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:22:29,114 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:22:29,115 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:22:29,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:22:29,115 INFO L82 PathProgramCache]: Analyzing trace with hash -862158447, now seen corresponding path program 1 times [2019-09-08 05:22:29,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:22:29,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:22:29,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:29,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:22:29,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:29,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:22:29,465 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:22:29,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:22:29,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 05:22:29,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 05:22:29,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 05:22:29,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 05:22:29,467 INFO L87 Difference]: Start difference. First operand 978 states and 1505 transitions. Second operand 11 states. [2019-09-08 05:22:33,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:22:33,301 INFO L93 Difference]: Finished difference Result 2434 states and 3435 transitions. [2019-09-08 05:22:33,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 05:22:33,301 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 193 [2019-09-08 05:22:33,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:22:33,313 INFO L225 Difference]: With dead ends: 2434 [2019-09-08 05:22:33,313 INFO L226 Difference]: Without dead ends: 2059 [2019-09-08 05:22:33,315 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-09-08 05:22:33,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2059 states. [2019-09-08 05:22:33,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2059 to 2044. [2019-09-08 05:22:33,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2044 states. [2019-09-08 05:22:33,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 2886 transitions. [2019-09-08 05:22:33,412 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 2886 transitions. Word has length 193 [2019-09-08 05:22:33,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:22:33,412 INFO L475 AbstractCegarLoop]: Abstraction has 2044 states and 2886 transitions. [2019-09-08 05:22:33,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 05:22:33,413 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 2886 transitions. [2019-09-08 05:22:33,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-08 05:22:33,419 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:22:33,419 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:22:33,420 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:22:33,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:22:33,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1182728700, now seen corresponding path program 1 times [2019-09-08 05:22:33,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:22:33,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:22:33,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:33,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:22:33,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:33,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:22:33,703 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:22:33,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:22:33,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 05:22:33,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 05:22:33,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 05:22:33,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-09-08 05:22:33,707 INFO L87 Difference]: Start difference. First operand 2044 states and 2886 transitions. Second operand 16 states. [2019-09-08 05:22:34,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:22:34,073 INFO L93 Difference]: Finished difference Result 3086 states and 4232 transitions. [2019-09-08 05:22:34,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 05:22:34,074 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 194 [2019-09-08 05:22:34,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:22:34,089 INFO L225 Difference]: With dead ends: 3086 [2019-09-08 05:22:34,090 INFO L226 Difference]: Without dead ends: 1774 [2019-09-08 05:22:34,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-09-08 05:22:34,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1774 states. [2019-09-08 05:22:34,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1774 to 1695. [2019-09-08 05:22:34,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1695 states. [2019-09-08 05:22:34,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1695 states and 2422 transitions. [2019-09-08 05:22:34,175 INFO L78 Accepts]: Start accepts. Automaton has 1695 states and 2422 transitions. Word has length 194 [2019-09-08 05:22:34,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:22:34,176 INFO L475 AbstractCegarLoop]: Abstraction has 1695 states and 2422 transitions. [2019-09-08 05:22:34,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 05:22:34,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1695 states and 2422 transitions. [2019-09-08 05:22:34,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-08 05:22:34,182 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:22:34,183 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:22:34,183 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:22:34,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:22:34,183 INFO L82 PathProgramCache]: Analyzing trace with hash 2089057104, now seen corresponding path program 1 times [2019-09-08 05:22:34,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:22:34,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:22:34,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:34,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:22:34,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:34,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:22:34,393 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:22:34,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:22:34,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:22:34,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:22:34,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:22:34,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:22:34,396 INFO L87 Difference]: Start difference. First operand 1695 states and 2422 transitions. Second operand 6 states. [2019-09-08 05:22:35,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:22:35,032 INFO L93 Difference]: Finished difference Result 4252 states and 6012 transitions. [2019-09-08 05:22:35,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 05:22:35,033 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 203 [2019-09-08 05:22:35,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:22:35,065 INFO L225 Difference]: With dead ends: 4252 [2019-09-08 05:22:35,065 INFO L226 Difference]: Without dead ends: 3381 [2019-09-08 05:22:35,072 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-08 05:22:35,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3381 states. [2019-09-08 05:22:35,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3381 to 3310. [2019-09-08 05:22:35,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3310 states. [2019-09-08 05:22:35,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3310 states to 3310 states and 4816 transitions. [2019-09-08 05:22:35,255 INFO L78 Accepts]: Start accepts. Automaton has 3310 states and 4816 transitions. Word has length 203 [2019-09-08 05:22:35,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:22:35,256 INFO L475 AbstractCegarLoop]: Abstraction has 3310 states and 4816 transitions. [2019-09-08 05:22:35,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:22:35,256 INFO L276 IsEmpty]: Start isEmpty. Operand 3310 states and 4816 transitions. [2019-09-08 05:22:35,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-08 05:22:35,274 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:22:35,275 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:22:35,275 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:22:35,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:22:35,275 INFO L82 PathProgramCache]: Analyzing trace with hash -80625117, now seen corresponding path program 1 times [2019-09-08 05:22:35,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:22:35,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:22:35,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:35,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:22:35,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:35,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:22:35,468 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:22:35,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:22:35,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:22:35,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:22:35,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:22:35,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:22:35,470 INFO L87 Difference]: Start difference. First operand 3310 states and 4816 transitions. Second operand 5 states. [2019-09-08 05:22:36,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:22:36,528 INFO L93 Difference]: Finished difference Result 10095 states and 14251 transitions. [2019-09-08 05:22:36,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 05:22:36,529 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 204 [2019-09-08 05:22:36,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:22:36,582 INFO L225 Difference]: With dead ends: 10095 [2019-09-08 05:22:36,582 INFO L226 Difference]: Without dead ends: 8364 [2019-09-08 05:22:36,593 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-08 05:22:36,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8364 states. [2019-09-08 05:22:36,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8364 to 8228. [2019-09-08 05:22:36,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8228 states. [2019-09-08 05:22:37,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8228 states to 8228 states and 11880 transitions. [2019-09-08 05:22:37,014 INFO L78 Accepts]: Start accepts. Automaton has 8228 states and 11880 transitions. Word has length 204 [2019-09-08 05:22:37,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:22:37,014 INFO L475 AbstractCegarLoop]: Abstraction has 8228 states and 11880 transitions. [2019-09-08 05:22:37,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:22:37,015 INFO L276 IsEmpty]: Start isEmpty. Operand 8228 states and 11880 transitions. [2019-09-08 05:22:37,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-08 05:22:37,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:22:37,038 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:22:37,038 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:22:37,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:22:37,039 INFO L82 PathProgramCache]: Analyzing trace with hash -667401236, now seen corresponding path program 1 times [2019-09-08 05:22:37,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:22:37,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:22:37,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:37,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:22:37,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:37,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:22:37,284 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:22:37,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:22:37,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 05:22:37,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 05:22:37,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 05:22:37,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 05:22:37,287 INFO L87 Difference]: Start difference. First operand 8228 states and 11880 transitions. Second operand 9 states. [2019-09-08 05:22:37,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:22:37,708 INFO L93 Difference]: Finished difference Result 12193 states and 16859 transitions. [2019-09-08 05:22:37,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 05:22:37,709 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 204 [2019-09-08 05:22:37,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:22:37,754 INFO L225 Difference]: With dead ends: 12193 [2019-09-08 05:22:37,754 INFO L226 Difference]: Without dead ends: 7324 [2019-09-08 05:22:37,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-09-08 05:22:37,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7324 states. [2019-09-08 05:22:38,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7324 to 7143. [2019-09-08 05:22:38,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7143 states. [2019-09-08 05:22:38,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7143 states to 7143 states and 10470 transitions. [2019-09-08 05:22:38,108 INFO L78 Accepts]: Start accepts. Automaton has 7143 states and 10470 transitions. Word has length 204 [2019-09-08 05:22:38,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:22:38,108 INFO L475 AbstractCegarLoop]: Abstraction has 7143 states and 10470 transitions. [2019-09-08 05:22:38,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 05:22:38,109 INFO L276 IsEmpty]: Start isEmpty. Operand 7143 states and 10470 transitions. [2019-09-08 05:22:38,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-08 05:22:38,132 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:22:38,132 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:22:38,133 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:22:38,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:22:38,133 INFO L82 PathProgramCache]: Analyzing trace with hash -341043388, now seen corresponding path program 1 times [2019-09-08 05:22:38,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:22:38,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:22:38,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:38,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:22:38,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:38,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:22:38,367 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:22:38,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:22:38,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:22:38,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:22:38,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:22:38,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:22:38,369 INFO L87 Difference]: Start difference. First operand 7143 states and 10470 transitions. Second operand 8 states. [2019-09-08 05:22:42,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:22:42,295 INFO L93 Difference]: Finished difference Result 21795 states and 34408 transitions. [2019-09-08 05:22:42,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 05:22:42,295 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 241 [2019-09-08 05:22:42,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:22:42,379 INFO L225 Difference]: With dead ends: 21795 [2019-09-08 05:22:42,380 INFO L226 Difference]: Without dead ends: 14717 [2019-09-08 05:22:42,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-08 05:22:42,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14717 states. [2019-09-08 05:22:42,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14717 to 10431. [2019-09-08 05:22:42,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10431 states. [2019-09-08 05:22:43,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10431 states to 10431 states and 17390 transitions. [2019-09-08 05:22:43,009 INFO L78 Accepts]: Start accepts. Automaton has 10431 states and 17390 transitions. Word has length 241 [2019-09-08 05:22:43,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:22:43,010 INFO L475 AbstractCegarLoop]: Abstraction has 10431 states and 17390 transitions. [2019-09-08 05:22:43,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:22:43,010 INFO L276 IsEmpty]: Start isEmpty. Operand 10431 states and 17390 transitions. [2019-09-08 05:22:43,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-09-08 05:22:43,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:22:43,067 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:22:43,067 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:22:43,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:22:43,068 INFO L82 PathProgramCache]: Analyzing trace with hash -790262356, now seen corresponding path program 1 times [2019-09-08 05:22:43,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:22:43,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:22:43,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:43,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:22:43,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:22:43,384 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:22:43,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:22:43,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:22:43,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:22:43,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:22:43,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:22:43,386 INFO L87 Difference]: Start difference. First operand 10431 states and 17390 transitions. Second operand 8 states. [2019-09-08 05:22:47,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:22:47,439 INFO L93 Difference]: Finished difference Result 32195 states and 58424 transitions. [2019-09-08 05:22:47,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 05:22:47,439 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 227 [2019-09-08 05:22:47,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:22:47,590 INFO L225 Difference]: With dead ends: 32195 [2019-09-08 05:22:47,591 INFO L226 Difference]: Without dead ends: 21829 [2019-09-08 05:22:47,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-08 05:22:47,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21829 states. [2019-09-08 05:22:49,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21829 to 17127. [2019-09-08 05:22:49,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17127 states. [2019-09-08 05:22:49,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17127 states to 17127 states and 32574 transitions. [2019-09-08 05:22:49,811 INFO L78 Accepts]: Start accepts. Automaton has 17127 states and 32574 transitions. Word has length 227 [2019-09-08 05:22:49,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:22:49,811 INFO L475 AbstractCegarLoop]: Abstraction has 17127 states and 32574 transitions. [2019-09-08 05:22:49,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:22:49,811 INFO L276 IsEmpty]: Start isEmpty. Operand 17127 states and 32574 transitions. [2019-09-08 05:22:49,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-08 05:22:49,935 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:22:49,935 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:22:49,936 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:22:49,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:22:49,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1621648930, now seen corresponding path program 1 times [2019-09-08 05:22:49,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:22:49,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:22:49,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:49,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:22:49,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:49,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:22:50,125 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:22:50,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:22:50,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:22:50,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:22:50,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:22:50,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:22:50,128 INFO L87 Difference]: Start difference. First operand 17127 states and 32574 transitions. Second operand 8 states. [2019-09-08 05:22:55,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:22:55,358 INFO L93 Difference]: Finished difference Result 53267 states and 110444 transitions. [2019-09-08 05:22:55,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 05:22:55,359 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 228 [2019-09-08 05:22:55,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:22:55,598 INFO L225 Difference]: With dead ends: 53267 [2019-09-08 05:22:55,599 INFO L226 Difference]: Without dead ends: 36205 [2019-09-08 05:22:55,671 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-08 05:22:55,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36205 states. [2019-09-08 05:22:58,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36205 to 30647. [2019-09-08 05:22:58,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30647 states. [2019-09-08 05:22:58,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30647 states to 30647 states and 65490 transitions. [2019-09-08 05:22:59,001 INFO L78 Accepts]: Start accepts. Automaton has 30647 states and 65490 transitions. Word has length 228 [2019-09-08 05:22:59,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:22:59,002 INFO L475 AbstractCegarLoop]: Abstraction has 30647 states and 65490 transitions. [2019-09-08 05:22:59,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:22:59,002 INFO L276 IsEmpty]: Start isEmpty. Operand 30647 states and 65490 transitions. [2019-09-08 05:22:59,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-08 05:22:59,219 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:22:59,219 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:22:59,219 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:22:59,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:22:59,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1871687551, now seen corresponding path program 1 times [2019-09-08 05:22:59,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:22:59,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:22:59,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:59,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:22:59,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:59,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:22:59,436 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 05:22:59,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:22:59,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 05:22:59,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 05:22:59,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 05:22:59,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 05:22:59,438 INFO L87 Difference]: Start difference. First operand 30647 states and 65490 transitions. Second operand 11 states. [2019-09-08 05:23:00,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:23:00,948 INFO L93 Difference]: Finished difference Result 36295 states and 72743 transitions. [2019-09-08 05:23:00,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 05:23:00,949 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 247 [2019-09-08 05:23:00,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:23:01,177 INFO L225 Difference]: With dead ends: 36295 [2019-09-08 05:23:01,177 INFO L226 Difference]: Without dead ends: 34395 [2019-09-08 05:23:01,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2019-09-08 05:23:01,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34395 states. [2019-09-08 05:23:04,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34395 to 34171. [2019-09-08 05:23:04,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34171 states. [2019-09-08 05:23:04,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34171 states to 34171 states and 70093 transitions. [2019-09-08 05:23:04,451 INFO L78 Accepts]: Start accepts. Automaton has 34171 states and 70093 transitions. Word has length 247 [2019-09-08 05:23:04,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:23:04,452 INFO L475 AbstractCegarLoop]: Abstraction has 34171 states and 70093 transitions. [2019-09-08 05:23:04,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 05:23:04,452 INFO L276 IsEmpty]: Start isEmpty. Operand 34171 states and 70093 transitions. [2019-09-08 05:23:04,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-08 05:23:04,576 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:23:04,576 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:23:04,577 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:23:04,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:23:04,577 INFO L82 PathProgramCache]: Analyzing trace with hash 922841463, now seen corresponding path program 1 times [2019-09-08 05:23:04,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:23:04,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:23:04,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:23:04,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:23:04,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:23:04,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:23:04,746 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-08 05:23:04,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:23:04,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:23:04,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:23:04,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:23:04,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:23:04,747 INFO L87 Difference]: Start difference. First operand 34171 states and 70093 transitions. Second operand 6 states. [2019-09-08 05:23:06,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:23:06,415 INFO L93 Difference]: Finished difference Result 68355 states and 140485 transitions. [2019-09-08 05:23:06,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 05:23:06,415 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 250 [2019-09-08 05:23:06,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:23:06,612 INFO L225 Difference]: With dead ends: 68355 [2019-09-08 05:23:06,613 INFO L226 Difference]: Without dead ends: 34249 [2019-09-08 05:23:06,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-09-08 05:23:06,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34249 states. [2019-09-08 05:23:08,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34249 to 34247. [2019-09-08 05:23:08,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34247 states. [2019-09-08 05:23:08,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34247 states to 34247 states and 70175 transitions. [2019-09-08 05:23:08,678 INFO L78 Accepts]: Start accepts. Automaton has 34247 states and 70175 transitions. Word has length 250 [2019-09-08 05:23:08,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:23:08,678 INFO L475 AbstractCegarLoop]: Abstraction has 34247 states and 70175 transitions. [2019-09-08 05:23:08,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:23:08,678 INFO L276 IsEmpty]: Start isEmpty. Operand 34247 states and 70175 transitions. [2019-09-08 05:23:08,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-09-08 05:23:08,792 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:23:08,792 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:23:08,793 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:23:08,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:23:08,793 INFO L82 PathProgramCache]: Analyzing trace with hash 976818141, now seen corresponding path program 1 times [2019-09-08 05:23:08,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:23:08,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:23:08,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:23:08,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:23:08,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:23:08,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:23:08,956 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:23:08,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:23:08,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:23:08,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:23:08,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:23:08,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:23:08,958 INFO L87 Difference]: Start difference. First operand 34247 states and 70175 transitions. Second operand 6 states. [2019-09-08 05:23:12,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:23:12,023 INFO L93 Difference]: Finished difference Result 68537 states and 142287 transitions. [2019-09-08 05:23:12,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:23:12,024 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 233 [2019-09-08 05:23:12,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:23:12,170 INFO L225 Difference]: With dead ends: 68537 [2019-09-08 05:23:12,171 INFO L226 Difference]: Without dead ends: 34367 [2019-09-08 05:23:12,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:23:12,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34367 states. [2019-09-08 05:23:13,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34367 to 34367. [2019-09-08 05:23:13,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34367 states. [2019-09-08 05:23:13,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34367 states to 34367 states and 69737 transitions. [2019-09-08 05:23:13,962 INFO L78 Accepts]: Start accepts. Automaton has 34367 states and 69737 transitions. Word has length 233 [2019-09-08 05:23:13,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:23:13,963 INFO L475 AbstractCegarLoop]: Abstraction has 34367 states and 69737 transitions. [2019-09-08 05:23:13,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:23:13,963 INFO L276 IsEmpty]: Start isEmpty. Operand 34367 states and 69737 transitions. [2019-09-08 05:23:14,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-08 05:23:14,071 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:23:14,072 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:23:14,072 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:23:14,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:23:14,072 INFO L82 PathProgramCache]: Analyzing trace with hash 591082007, now seen corresponding path program 1 times [2019-09-08 05:23:14,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:23:14,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:23:14,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:23:14,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:23:14,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:23:14,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:23:14,239 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:23:14,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:23:14,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:23:14,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:23:14,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:23:14,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:23:14,242 INFO L87 Difference]: Start difference. First operand 34367 states and 69737 transitions. Second operand 6 states. [2019-09-08 05:23:15,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:23:15,881 INFO L93 Difference]: Finished difference Result 68671 states and 148616 transitions. [2019-09-08 05:23:15,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:23:15,881 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 236 [2019-09-08 05:23:15,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:23:16,061 INFO L225 Difference]: With dead ends: 68671 [2019-09-08 05:23:16,061 INFO L226 Difference]: Without dead ends: 34381 [2019-09-08 05:23:16,174 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:23:16,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34381 states. [2019-09-08 05:23:17,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34381 to 34379. [2019-09-08 05:23:17,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34379 states. [2019-09-08 05:23:18,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34379 states to 34379 states and 64820 transitions. [2019-09-08 05:23:18,058 INFO L78 Accepts]: Start accepts. Automaton has 34379 states and 64820 transitions. Word has length 236 [2019-09-08 05:23:18,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:23:18,059 INFO L475 AbstractCegarLoop]: Abstraction has 34379 states and 64820 transitions. [2019-09-08 05:23:18,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:23:18,059 INFO L276 IsEmpty]: Start isEmpty. Operand 34379 states and 64820 transitions. [2019-09-08 05:23:18,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-08 05:23:18,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:23:18,162 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:23:18,162 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:23:18,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:23:18,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1840677898, now seen corresponding path program 1 times [2019-09-08 05:23:18,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:23:18,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:23:18,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:23:18,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:23:18,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:23:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:23:18,544 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-08 05:23:18,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:23:18,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 05:23:18,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 05:23:18,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 05:23:18,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=414, Unknown=0, NotChecked=0, Total=462 [2019-09-08 05:23:18,549 INFO L87 Difference]: Start difference. First operand 34379 states and 64820 transitions. Second operand 22 states. [2019-09-08 05:23:35,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:23:35,011 INFO L93 Difference]: Finished difference Result 74368 states and 130678 transitions. [2019-09-08 05:23:35,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-08 05:23:35,011 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 252 [2019-09-08 05:23:35,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:23:35,294 INFO L225 Difference]: With dead ends: 74368 [2019-09-08 05:23:35,294 INFO L226 Difference]: Without dead ends: 70519 [2019-09-08 05:23:35,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1149 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=483, Invalid=4209, Unknown=0, NotChecked=0, Total=4692 [2019-09-08 05:23:35,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70519 states. [2019-09-08 05:23:38,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70519 to 68863. [2019-09-08 05:23:38,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68863 states. [2019-09-08 05:23:39,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68863 states to 68863 states and 122961 transitions. [2019-09-08 05:23:39,017 INFO L78 Accepts]: Start accepts. Automaton has 68863 states and 122961 transitions. Word has length 252 [2019-09-08 05:23:39,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:23:39,018 INFO L475 AbstractCegarLoop]: Abstraction has 68863 states and 122961 transitions. [2019-09-08 05:23:39,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 05:23:39,018 INFO L276 IsEmpty]: Start isEmpty. Operand 68863 states and 122961 transitions. [2019-09-08 05:23:39,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-08 05:23:39,188 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:23:39,188 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:23:39,189 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:23:39,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:23:39,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1511016950, now seen corresponding path program 1 times [2019-09-08 05:23:39,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:23:39,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:23:39,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:23:39,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:23:39,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:23:39,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:23:39,324 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:23:39,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:23:39,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:23:39,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:23:39,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:23:39,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:23:39,326 INFO L87 Difference]: Start difference. First operand 68863 states and 122961 transitions. Second operand 5 states. [2019-09-08 05:23:41,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:23:41,744 INFO L93 Difference]: Finished difference Result 87102 states and 146264 transitions. [2019-09-08 05:23:41,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 05:23:41,744 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 236 [2019-09-08 05:23:41,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:23:42,002 INFO L225 Difference]: With dead ends: 87102 [2019-09-08 05:23:42,002 INFO L226 Difference]: Without dead ends: 59767 [2019-09-08 05:23:42,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:23:42,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59767 states. [2019-09-08 05:23:47,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59767 to 59117. [2019-09-08 05:23:47,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59117 states. [2019-09-08 05:23:47,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59117 states to 59117 states and 109408 transitions. [2019-09-08 05:23:47,602 INFO L78 Accepts]: Start accepts. Automaton has 59117 states and 109408 transitions. Word has length 236 [2019-09-08 05:23:47,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:23:47,603 INFO L475 AbstractCegarLoop]: Abstraction has 59117 states and 109408 transitions. [2019-09-08 05:23:47,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:23:47,603 INFO L276 IsEmpty]: Start isEmpty. Operand 59117 states and 109408 transitions. [2019-09-08 05:23:47,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-08 05:23:47,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:23:47,857 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:23:47,857 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:23:47,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:23:47,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1424860128, now seen corresponding path program 1 times [2019-09-08 05:23:47,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:23:47,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:23:47,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:23:47,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:23:47,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:23:47,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:23:48,156 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 05:23:48,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:23:48,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 05:23:48,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:23:48,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:23:48,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:23:48,157 INFO L87 Difference]: Start difference. First operand 59117 states and 109408 transitions. Second operand 18 states. [2019-09-08 05:23:59,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:23:59,929 INFO L93 Difference]: Finished difference Result 67157 states and 120469 transitions. [2019-09-08 05:23:59,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-08 05:23:59,930 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 250 [2019-09-08 05:23:59,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:24:00,185 INFO L225 Difference]: With dead ends: 67157 [2019-09-08 05:24:00,185 INFO L226 Difference]: Without dead ends: 61042 [2019-09-08 05:24:00,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=312, Invalid=2138, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 05:24:00,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61042 states. [2019-09-08 05:24:03,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61042 to 58310. [2019-09-08 05:24:03,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58310 states. [2019-09-08 05:24:03,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58310 states to 58310 states and 108622 transitions. [2019-09-08 05:24:03,275 INFO L78 Accepts]: Start accepts. Automaton has 58310 states and 108622 transitions. Word has length 250 [2019-09-08 05:24:03,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:24:03,275 INFO L475 AbstractCegarLoop]: Abstraction has 58310 states and 108622 transitions. [2019-09-08 05:24:03,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 05:24:03,276 INFO L276 IsEmpty]: Start isEmpty. Operand 58310 states and 108622 transitions. [2019-09-08 05:24:05,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-09-08 05:24:05,688 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:24:05,689 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:24:05,689 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:24:05,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:24:05,689 INFO L82 PathProgramCache]: Analyzing trace with hash 2080193308, now seen corresponding path program 1 times [2019-09-08 05:24:05,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:24:05,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:24:05,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:24:05,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:24:05,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:24:05,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:24:05,912 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-08 05:24:05,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:24:05,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 05:24:05,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 05:24:05,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 05:24:05,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-08 05:24:05,913 INFO L87 Difference]: Start difference. First operand 58310 states and 108622 transitions. Second operand 14 states. [2019-09-08 05:24:07,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:24:07,785 INFO L93 Difference]: Finished difference Result 75489 states and 131246 transitions. [2019-09-08 05:24:07,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 05:24:07,787 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 235 [2019-09-08 05:24:07,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:24:08,053 INFO L225 Difference]: With dead ends: 75489 [2019-09-08 05:24:08,053 INFO L226 Difference]: Without dead ends: 57706 [2019-09-08 05:24:08,113 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-08 05:24:08,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57706 states. [2019-09-08 05:24:10,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57706 to 57618. [2019-09-08 05:24:10,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57618 states. [2019-09-08 05:24:13,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57618 states to 57618 states and 107258 transitions. [2019-09-08 05:24:13,645 INFO L78 Accepts]: Start accepts. Automaton has 57618 states and 107258 transitions. Word has length 235 [2019-09-08 05:24:13,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:24:13,645 INFO L475 AbstractCegarLoop]: Abstraction has 57618 states and 107258 transitions. [2019-09-08 05:24:13,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 05:24:13,645 INFO L276 IsEmpty]: Start isEmpty. Operand 57618 states and 107258 transitions. [2019-09-08 05:24:13,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-09-08 05:24:13,817 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:24:13,817 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:24:13,817 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:24:13,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:24:13,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1594012019, now seen corresponding path program 1 times [2019-09-08 05:24:13,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:24:13,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:24:13,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:24:13,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:24:13,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:24:13,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:24:13,953 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:24:13,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:24:13,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:24:13,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:24:13,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:24:13,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:24:13,955 INFO L87 Difference]: Start difference. First operand 57618 states and 107258 transitions. Second operand 5 states. [2019-09-08 05:24:15,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:24:15,531 INFO L93 Difference]: Finished difference Result 66311 states and 118350 transitions. [2019-09-08 05:24:15,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 05:24:15,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 235 [2019-09-08 05:24:15,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:24:15,739 INFO L225 Difference]: With dead ends: 66311 [2019-09-08 05:24:15,739 INFO L226 Difference]: Without dead ends: 57112 [2019-09-08 05:24:15,777 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-08 05:24:15,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57112 states. [2019-09-08 05:24:18,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57112 to 56376. [2019-09-08 05:24:18,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56376 states. [2019-09-08 05:24:18,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56376 states to 56376 states and 105456 transitions. [2019-09-08 05:24:18,454 INFO L78 Accepts]: Start accepts. Automaton has 56376 states and 105456 transitions. Word has length 235 [2019-09-08 05:24:18,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:24:18,454 INFO L475 AbstractCegarLoop]: Abstraction has 56376 states and 105456 transitions. [2019-09-08 05:24:18,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:24:18,454 INFO L276 IsEmpty]: Start isEmpty. Operand 56376 states and 105456 transitions. [2019-09-08 05:24:19,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-08 05:24:19,008 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:24:19,008 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:24:19,009 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:24:19,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:24:19,009 INFO L82 PathProgramCache]: Analyzing trace with hash -2037874939, now seen corresponding path program 1 times [2019-09-08 05:24:19,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:24:19,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:24:19,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:24:19,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:24:19,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:24:19,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:24:19,373 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:24:19,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:24:19,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 05:24:19,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:24:19,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:24:19,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:24:19,376 INFO L87 Difference]: Start difference. First operand 56376 states and 105456 transitions. Second operand 18 states. [2019-09-08 05:24:30,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:24:30,084 INFO L93 Difference]: Finished difference Result 61395 states and 112001 transitions. [2019-09-08 05:24:30,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-08 05:24:30,085 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 236 [2019-09-08 05:24:30,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:24:30,300 INFO L225 Difference]: With dead ends: 61395 [2019-09-08 05:24:30,300 INFO L226 Difference]: Without dead ends: 57231 [2019-09-08 05:24:30,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=312, Invalid=2138, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 05:24:30,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57231 states. [2019-09-08 05:24:33,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57231 to 56134. [2019-09-08 05:24:33,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56134 states. [2019-09-08 05:24:33,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56134 states to 56134 states and 105162 transitions. [2019-09-08 05:24:33,390 INFO L78 Accepts]: Start accepts. Automaton has 56134 states and 105162 transitions. Word has length 236 [2019-09-08 05:24:33,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:24:33,391 INFO L475 AbstractCegarLoop]: Abstraction has 56134 states and 105162 transitions. [2019-09-08 05:24:33,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 05:24:33,391 INFO L276 IsEmpty]: Start isEmpty. Operand 56134 states and 105162 transitions. [2019-09-08 05:24:33,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-09-08 05:24:33,556 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:24:33,556 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:24:33,556 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:24:33,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:24:33,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1353971510, now seen corresponding path program 1 times [2019-09-08 05:24:33,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:24:33,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:24:33,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:24:33,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:24:33,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:24:33,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:24:33,709 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:24:33,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:24:33,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:24:33,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:24:33,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:24:33,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:24:33,710 INFO L87 Difference]: Start difference. First operand 56134 states and 105162 transitions. Second operand 6 states. [2019-09-08 05:24:38,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:24:38,084 INFO L93 Difference]: Finished difference Result 112275 states and 210698 transitions. [2019-09-08 05:24:38,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:24:38,085 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 251 [2019-09-08 05:24:38,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:24:38,324 INFO L225 Difference]: With dead ends: 112275 [2019-09-08 05:24:38,324 INFO L226 Difference]: Without dead ends: 56134 [2019-09-08 05:24:38,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:24:38,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56134 states. [2019-09-08 05:24:41,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56134 to 56026. [2019-09-08 05:24:41,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56026 states. [2019-09-08 05:24:41,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56026 states to 56026 states and 104981 transitions. [2019-09-08 05:24:41,319 INFO L78 Accepts]: Start accepts. Automaton has 56026 states and 104981 transitions. Word has length 251 [2019-09-08 05:24:41,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:24:41,319 INFO L475 AbstractCegarLoop]: Abstraction has 56026 states and 104981 transitions. [2019-09-08 05:24:41,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:24:41,320 INFO L276 IsEmpty]: Start isEmpty. Operand 56026 states and 104981 transitions. [2019-09-08 05:24:41,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-08 05:24:41,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:24:41,491 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:24:41,492 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:24:41,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:24:41,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1848268132, now seen corresponding path program 1 times [2019-09-08 05:24:41,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:24:41,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:24:41,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:24:41,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:24:41,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:24:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:24:41,625 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:24:41,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:24:41,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:24:41,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:24:41,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:24:41,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:24:41,627 INFO L87 Difference]: Start difference. First operand 56026 states and 104981 transitions. Second operand 6 states. [2019-09-08 05:24:44,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:24:44,229 INFO L93 Difference]: Finished difference Result 112143 states and 212184 transitions. [2019-09-08 05:24:44,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:24:44,229 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 236 [2019-09-08 05:24:44,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:24:44,445 INFO L225 Difference]: With dead ends: 112143 [2019-09-08 05:24:44,445 INFO L226 Difference]: Without dead ends: 56206 [2019-09-08 05:24:44,572 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:24:44,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56206 states. [2019-09-08 05:24:49,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56206 to 56206. [2019-09-08 05:24:49,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56206 states. [2019-09-08 05:24:50,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56206 states to 56206 states and 104762 transitions. [2019-09-08 05:24:50,029 INFO L78 Accepts]: Start accepts. Automaton has 56206 states and 104762 transitions. Word has length 236 [2019-09-08 05:24:50,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:24:50,029 INFO L475 AbstractCegarLoop]: Abstraction has 56206 states and 104762 transitions. [2019-09-08 05:24:50,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:24:50,030 INFO L276 IsEmpty]: Start isEmpty. Operand 56206 states and 104762 transitions. [2019-09-08 05:24:50,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-08 05:24:50,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:24:50,253 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:24:50,253 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:24:50,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:24:50,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1292419832, now seen corresponding path program 1 times [2019-09-08 05:24:50,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:24:50,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:24:50,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:24:50,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:24:50,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:24:50,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:24:50,383 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:24:50,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:24:50,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:24:50,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:24:50,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:24:50,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:24:50,385 INFO L87 Difference]: Start difference. First operand 56206 states and 104762 transitions. Second operand 6 states. [2019-09-08 05:24:53,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:24:53,028 INFO L93 Difference]: Finished difference Result 112323 states and 218634 transitions. [2019-09-08 05:24:53,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:24:53,028 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 239 [2019-09-08 05:24:53,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:24:53,222 INFO L225 Difference]: With dead ends: 112323 [2019-09-08 05:24:53,222 INFO L226 Difference]: Without dead ends: 56206 [2019-09-08 05:24:53,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:24:53,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56206 states. [2019-09-08 05:24:56,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56206 to 56206. [2019-09-08 05:24:56,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56206 states. [2019-09-08 05:24:56,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56206 states to 56206 states and 99668 transitions. [2019-09-08 05:24:56,214 INFO L78 Accepts]: Start accepts. Automaton has 56206 states and 99668 transitions. Word has length 239 [2019-09-08 05:24:56,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:24:56,214 INFO L475 AbstractCegarLoop]: Abstraction has 56206 states and 99668 transitions. [2019-09-08 05:24:56,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:24:56,214 INFO L276 IsEmpty]: Start isEmpty. Operand 56206 states and 99668 transitions. [2019-09-08 05:24:56,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-09-08 05:24:56,393 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:24:56,394 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:24:56,394 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:24:56,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:24:56,394 INFO L82 PathProgramCache]: Analyzing trace with hash 389909881, now seen corresponding path program 1 times [2019-09-08 05:24:56,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:24:56,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:24:56,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:24:56,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:24:56,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:24:56,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:24:56,587 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-08 05:24:56,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:24:56,588 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 05:24:56,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:24:57,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:24:57,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 3009 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:24:57,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:24:57,314 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:24:57,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:24:57,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 13 [2019-09-08 05:24:57,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 05:24:57,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 05:24:57,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:24:57,333 INFO L87 Difference]: Start difference. First operand 56206 states and 99668 transitions. Second operand 13 states. [2019-09-08 05:25:03,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:25:03,740 INFO L93 Difference]: Finished difference Result 112360 states and 199274 transitions. [2019-09-08 05:25:03,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 05:25:03,741 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 278 [2019-09-08 05:25:03,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:25:04,203 INFO L225 Difference]: With dead ends: 112360 [2019-09-08 05:25:04,203 INFO L226 Difference]: Without dead ends: 56210 [2019-09-08 05:25:04,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2019-09-08 05:25:04,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56210 states. [2019-09-08 05:25:09,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56210 to 56206. [2019-09-08 05:25:09,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56206 states. [2019-09-08 05:25:09,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56206 states to 56206 states and 99666 transitions. [2019-09-08 05:25:09,326 INFO L78 Accepts]: Start accepts. Automaton has 56206 states and 99666 transitions. Word has length 278 [2019-09-08 05:25:09,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:25:09,327 INFO L475 AbstractCegarLoop]: Abstraction has 56206 states and 99666 transitions. [2019-09-08 05:25:09,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 05:25:09,327 INFO L276 IsEmpty]: Start isEmpty. Operand 56206 states and 99666 transitions. [2019-09-08 05:25:09,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-08 05:25:09,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:25:09,575 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:25:09,575 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:25:09,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:25:09,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1772045704, now seen corresponding path program 1 times [2019-09-08 05:25:09,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:25:09,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:25:09,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:09,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:25:09,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:09,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:25:09,837 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 05:25:09,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:25:09,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 05:25:09,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:25:09,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:25:09,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:25:09,839 INFO L87 Difference]: Start difference. First operand 56206 states and 99666 transitions. Second operand 7 states. [2019-09-08 05:25:12,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:25:12,285 INFO L93 Difference]: Finished difference Result 112334 states and 199239 transitions. [2019-09-08 05:25:12,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 05:25:12,286 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 262 [2019-09-08 05:25:12,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:25:12,606 INFO L225 Difference]: With dead ends: 112334 [2019-09-08 05:25:12,606 INFO L226 Difference]: Without dead ends: 56208 [2019-09-08 05:25:12,823 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-09-08 05:25:12,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56208 states. [2019-09-08 05:25:15,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56208 to 56206. [2019-09-08 05:25:15,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56206 states. [2019-09-08 05:25:16,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56206 states to 56206 states and 99665 transitions. [2019-09-08 05:25:16,126 INFO L78 Accepts]: Start accepts. Automaton has 56206 states and 99665 transitions. Word has length 262 [2019-09-08 05:25:16,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:25:16,127 INFO L475 AbstractCegarLoop]: Abstraction has 56206 states and 99665 transitions. [2019-09-08 05:25:16,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 05:25:16,127 INFO L276 IsEmpty]: Start isEmpty. Operand 56206 states and 99665 transitions. [2019-09-08 05:25:16,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-09-08 05:25:16,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:25:16,282 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:25:16,282 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:25:16,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:25:16,282 INFO L82 PathProgramCache]: Analyzing trace with hash 937776105, now seen corresponding path program 2 times [2019-09-08 05:25:16,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:25:16,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:25:16,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:16,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:25:16,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:16,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:25:16,528 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:25:16,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:25:16,528 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 05:25:19,141 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:25:19,560 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 05:25:19,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 05:25:19,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 2948 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-08 05:25:19,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:25:19,802 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:25:19,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:25:19,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2019-09-08 05:25:19,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 05:25:19,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 05:25:19,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-08 05:25:19,814 INFO L87 Difference]: Start difference. First operand 56206 states and 99665 transitions. Second operand 19 states. [2019-09-08 05:25:30,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:25:30,319 INFO L93 Difference]: Finished difference Result 146142 states and 272249 transitions. [2019-09-08 05:25:30,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 05:25:30,319 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 263 [2019-09-08 05:25:30,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:25:30,851 INFO L225 Difference]: With dead ends: 146142 [2019-09-08 05:25:30,851 INFO L226 Difference]: Without dead ends: 142013 [2019-09-08 05:25:30,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=198, Invalid=992, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 05:25:31,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142013 states. [2019-09-08 05:25:39,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142013 to 113255. [2019-09-08 05:25:39,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113255 states. [2019-09-08 05:25:39,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113255 states to 113255 states and 203610 transitions. [2019-09-08 05:25:39,683 INFO L78 Accepts]: Start accepts. Automaton has 113255 states and 203610 transitions. Word has length 263 [2019-09-08 05:25:39,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:25:39,683 INFO L475 AbstractCegarLoop]: Abstraction has 113255 states and 203610 transitions. [2019-09-08 05:25:39,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 05:25:39,683 INFO L276 IsEmpty]: Start isEmpty. Operand 113255 states and 203610 transitions. [2019-09-08 05:25:40,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-09-08 05:25:40,077 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:25:40,077 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:25:40,077 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:25:40,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:25:40,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1331916048, now seen corresponding path program 1 times [2019-09-08 05:25:40,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:25:40,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:25:40,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:40,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 05:25:40,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:40,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:25:40,240 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-08 05:25:40,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:25:40,241 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 05:25:40,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:25:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:25:40,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 2955 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:25:40,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:25:40,944 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 05:25:40,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:25:40,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 13 [2019-09-08 05:25:40,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 05:25:40,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 05:25:40,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:25:40,962 INFO L87 Difference]: Start difference. First operand 113255 states and 203610 transitions. Second operand 13 states. [2019-09-08 05:25:50,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:25:50,490 INFO L93 Difference]: Finished difference Result 226792 states and 407486 transitions. [2019-09-08 05:25:50,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 05:25:50,491 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 265 [2019-09-08 05:25:50,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:25:50,971 INFO L225 Difference]: With dead ends: 226792 [2019-09-08 05:25:50,971 INFO L226 Difference]: Without dead ends: 113645 [2019-09-08 05:25:51,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-09-08 05:25:51,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113645 states. [2019-09-08 05:25:57,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113645 to 113259. [2019-09-08 05:25:57,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113259 states. [2019-09-08 05:25:58,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113259 states to 113259 states and 203612 transitions. [2019-09-08 05:25:58,658 INFO L78 Accepts]: Start accepts. Automaton has 113259 states and 203612 transitions. Word has length 265 [2019-09-08 05:25:58,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:25:58,658 INFO L475 AbstractCegarLoop]: Abstraction has 113259 states and 203612 transitions. [2019-09-08 05:25:58,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 05:25:58,658 INFO L276 IsEmpty]: Start isEmpty. Operand 113259 states and 203612 transitions. [2019-09-08 05:25:59,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-09-08 05:25:59,045 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:25:59,046 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:25:59,046 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:25:59,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:25:59,046 INFO L82 PathProgramCache]: Analyzing trace with hash 315214031, now seen corresponding path program 1 times [2019-09-08 05:25:59,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:25:59,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:25:59,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:59,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:25:59,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:59,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:25:59,237 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-08 05:25:59,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:25:59,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 05:25:59,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 05:25:59,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 05:25:59,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 05:25:59,240 INFO L87 Difference]: Start difference. First operand 113259 states and 203612 transitions. Second operand 9 states. [2019-09-08 05:26:06,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:26:06,988 INFO L93 Difference]: Finished difference Result 226412 states and 407100 transitions. [2019-09-08 05:26:06,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 05:26:06,988 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 267 [2019-09-08 05:26:06,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:26:07,412 INFO L225 Difference]: With dead ends: 226412 [2019-09-08 05:26:07,412 INFO L226 Difference]: Without dead ends: 113265 [2019-09-08 05:26:07,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-09-08 05:26:07,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113265 states. [2019-09-08 05:26:14,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113265 to 113259. [2019-09-08 05:26:14,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113259 states. [2019-09-08 05:26:14,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113259 states to 113259 states and 203610 transitions. [2019-09-08 05:26:14,508 INFO L78 Accepts]: Start accepts. Automaton has 113259 states and 203610 transitions. Word has length 267 [2019-09-08 05:26:14,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:26:14,508 INFO L475 AbstractCegarLoop]: Abstraction has 113259 states and 203610 transitions. [2019-09-08 05:26:14,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 05:26:14,508 INFO L276 IsEmpty]: Start isEmpty. Operand 113259 states and 203610 transitions. [2019-09-08 05:26:14,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-09-08 05:26:14,872 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:26:14,872 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:26:14,872 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:26:14,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:26:14,873 INFO L82 PathProgramCache]: Analyzing trace with hash -844023319, now seen corresponding path program 1 times [2019-09-08 05:26:14,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:26:14,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:26:14,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:26:14,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:26:14,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:26:14,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:26:15,341 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-08 05:26:15,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:26:15,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-08 05:26:15,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 05:26:15,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 05:26:15,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2019-09-08 05:26:15,344 INFO L87 Difference]: Start difference. First operand 113259 states and 203610 transitions. Second operand 20 states. [2019-09-08 05:26:26,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:26:26,235 INFO L93 Difference]: Finished difference Result 124409 states and 218240 transitions. [2019-09-08 05:26:26,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 05:26:26,235 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 266 [2019-09-08 05:26:26,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:26:26,753 INFO L225 Difference]: With dead ends: 124409 [2019-09-08 05:26:26,753 INFO L226 Difference]: Without dead ends: 120266 [2019-09-08 05:26:26,815 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=292, Invalid=1870, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 05:26:26,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120266 states. [2019-09-08 05:26:33,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120266 to 118862. [2019-09-08 05:26:33,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118862 states. [2019-09-08 05:26:34,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118862 states to 118862 states and 210922 transitions. [2019-09-08 05:26:34,083 INFO L78 Accepts]: Start accepts. Automaton has 118862 states and 210922 transitions. Word has length 266 [2019-09-08 05:26:34,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:26:34,083 INFO L475 AbstractCegarLoop]: Abstraction has 118862 states and 210922 transitions. [2019-09-08 05:26:34,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 05:26:34,083 INFO L276 IsEmpty]: Start isEmpty. Operand 118862 states and 210922 transitions. [2019-09-08 05:26:34,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-08 05:26:34,449 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:26:34,450 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:26:34,450 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:26:34,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:26:34,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1346020203, now seen corresponding path program 1 times [2019-09-08 05:26:34,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:26:34,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:26:34,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:26:34,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:26:34,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:26:34,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:26:34,692 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 05:26:34,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:26:34,693 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 05:26:34,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:26:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:26:35,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 2889 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 05:26:35,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:26:35,236 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:26:35,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:26:35,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4] total 13 [2019-09-08 05:26:35,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 05:26:35,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 05:26:35,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:26:35,254 INFO L87 Difference]: Start difference. First operand 118862 states and 210922 transitions. Second operand 13 states. [2019-09-08 05:26:56,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:26:56,209 INFO L93 Difference]: Finished difference Result 334596 states and 611293 transitions. [2019-09-08 05:26:56,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 05:26:56,209 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 250 [2019-09-08 05:26:56,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:26:58,044 INFO L225 Difference]: With dead ends: 334596 [2019-09-08 05:26:58,044 INFO L226 Difference]: Without dead ends: 297490 [2019-09-08 05:26:58,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=777, Unknown=0, NotChecked=0, Total=930 [2019-09-08 05:26:58,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297490 states. [2019-09-08 05:27:14,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297490 to 239085. [2019-09-08 05:27:14,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239085 states. [2019-09-08 05:27:15,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239085 states to 239085 states and 431240 transitions. [2019-09-08 05:27:15,372 INFO L78 Accepts]: Start accepts. Automaton has 239085 states and 431240 transitions. Word has length 250 [2019-09-08 05:27:15,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:27:15,372 INFO L475 AbstractCegarLoop]: Abstraction has 239085 states and 431240 transitions. [2019-09-08 05:27:15,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 05:27:15,373 INFO L276 IsEmpty]: Start isEmpty. Operand 239085 states and 431240 transitions. [2019-09-08 05:27:24,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-09-08 05:27:24,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:27:24,518 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:27:24,518 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:27:24,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:27:24,519 INFO L82 PathProgramCache]: Analyzing trace with hash -363733395, now seen corresponding path program 1 times [2019-09-08 05:27:24,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:27:24,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:27:24,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:27:24,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:27:24,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:27:24,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:27:24,675 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-08 05:27:24,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:27:24,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:27:24,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:27:24,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:27:24,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:27:24,677 INFO L87 Difference]: Start difference. First operand 239085 states and 431240 transitions. Second operand 6 states. [2019-09-08 05:27:37,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:27:37,092 INFO L93 Difference]: Finished difference Result 478159 states and 863717 transitions. [2019-09-08 05:27:37,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 05:27:37,093 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 286 [2019-09-08 05:27:37,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:27:38,766 INFO L225 Difference]: With dead ends: 478159 [2019-09-08 05:27:38,766 INFO L226 Difference]: Without dead ends: 239477 [2019-09-08 05:27:39,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:27:39,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239477 states. [2019-09-08 05:28:01,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239477 to 238931. [2019-09-08 05:28:01,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238931 states. [2019-09-08 05:28:02,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238931 states to 238931 states and 430858 transitions. [2019-09-08 05:28:02,702 INFO L78 Accepts]: Start accepts. Automaton has 238931 states and 430858 transitions. Word has length 286 [2019-09-08 05:28:02,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:28:02,703 INFO L475 AbstractCegarLoop]: Abstraction has 238931 states and 430858 transitions. [2019-09-08 05:28:02,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:28:02,703 INFO L276 IsEmpty]: Start isEmpty. Operand 238931 states and 430858 transitions. [2019-09-08 05:28:13,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-09-08 05:28:13,103 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:28:13,103 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:28:13,104 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:28:13,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:28:13,104 INFO L82 PathProgramCache]: Analyzing trace with hash -273673105, now seen corresponding path program 1 times [2019-09-08 05:28:13,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:28:13,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:28:13,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:28:13,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:28:13,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:28:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:28:13,333 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-08 05:28:13,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:28:13,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 05:28:13,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:28:13,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:28:13,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:28:13,334 INFO L87 Difference]: Start difference. First operand 238931 states and 430858 transitions. Second operand 7 states. [2019-09-08 05:28:26,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:28:26,090 INFO L93 Difference]: Finished difference Result 448653 states and 796691 transitions. [2019-09-08 05:28:26,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 05:28:26,090 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 286 [2019-09-08 05:28:26,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:28:26,959 INFO L225 Difference]: With dead ends: 448653 [2019-09-08 05:28:26,959 INFO L226 Difference]: Without dead ends: 209933 [2019-09-08 05:28:27,523 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-09-08 05:28:27,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209933 states. [2019-09-08 05:28:49,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209933 to 209837. [2019-09-08 05:28:49,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209837 states. [2019-09-08 05:28:50,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209837 states to 209837 states and 364512 transitions. [2019-09-08 05:28:50,103 INFO L78 Accepts]: Start accepts. Automaton has 209837 states and 364512 transitions. Word has length 286 [2019-09-08 05:28:50,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:28:50,103 INFO L475 AbstractCegarLoop]: Abstraction has 209837 states and 364512 transitions. [2019-09-08 05:28:50,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 05:28:50,103 INFO L276 IsEmpty]: Start isEmpty. Operand 209837 states and 364512 transitions. [2019-09-08 05:28:50,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-09-08 05:28:50,805 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:28:50,805 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:28:50,806 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:28:50,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:28:50,806 INFO L82 PathProgramCache]: Analyzing trace with hash -774869658, now seen corresponding path program 1 times [2019-09-08 05:28:50,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:28:50,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:28:50,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:28:50,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:28:50,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:28:50,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:28:50,923 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 05:28:50,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:28:50,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:28:50,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:28:50,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:28:50,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:28:50,924 INFO L87 Difference]: Start difference. First operand 209837 states and 364512 transitions. Second operand 3 states. [2019-09-08 05:29:13,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:29:13,511 INFO L93 Difference]: Finished difference Result 497793 states and 904107 transitions. [2019-09-08 05:29:13,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:29:13,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 264 [2019-09-08 05:29:13,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:29:14,665 INFO L225 Difference]: With dead ends: 497793 [2019-09-08 05:29:14,665 INFO L226 Difference]: Without dead ends: 288613 [2019-09-08 05:29:15,764 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-08 05:29:15,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288613 states. [2019-09-08 05:29:36,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288613 to 288589. [2019-09-08 05:29:36,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288589 states. [2019-09-08 05:29:38,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288589 states to 288589 states and 538108 transitions. [2019-09-08 05:29:38,869 INFO L78 Accepts]: Start accepts. Automaton has 288589 states and 538108 transitions. Word has length 264 [2019-09-08 05:29:38,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:29:38,870 INFO L475 AbstractCegarLoop]: Abstraction has 288589 states and 538108 transitions. [2019-09-08 05:29:38,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:29:38,870 INFO L276 IsEmpty]: Start isEmpty. Operand 288589 states and 538108 transitions. [2019-09-08 05:29:40,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-09-08 05:29:40,125 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:29:40,125 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:29:40,125 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:29:40,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:29:40,126 INFO L82 PathProgramCache]: Analyzing trace with hash 660914856, now seen corresponding path program 1 times [2019-09-08 05:29:40,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:29:40,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:29:40,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:29:40,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:29:40,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:29:40,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:29:40,263 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:29:40,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:29:40,264 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:29:40,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:29:40,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:29:40,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 2951 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 05:29:40,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:29:40,747 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:29:40,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:29:40,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-08 05:29:40,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:29:40,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:29:40,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:29:40,756 INFO L87 Difference]: Start difference. First operand 288589 states and 538108 transitions. Second operand 6 states. [2019-09-08 05:30:02,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:30:02,556 INFO L93 Difference]: Finished difference Result 376291 states and 660127 transitions. [2019-09-08 05:30:02,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 05:30:02,561 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 267 [2019-09-08 05:30:02,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:30:03,713 INFO L225 Difference]: With dead ends: 376291 [2019-09-08 05:30:03,714 INFO L226 Difference]: Without dead ends: 302727 [2019-09-08 05:30:03,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:30:04,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302727 states. [2019-09-08 05:30:26,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302727 to 301297. [2019-09-08 05:30:26,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301297 states. [2019-09-08 05:30:39,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301297 states to 301297 states and 562357 transitions. [2019-09-08 05:30:39,801 INFO L78 Accepts]: Start accepts. Automaton has 301297 states and 562357 transitions. Word has length 267 [2019-09-08 05:30:39,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:30:39,801 INFO L475 AbstractCegarLoop]: Abstraction has 301297 states and 562357 transitions. [2019-09-08 05:30:39,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:30:39,801 INFO L276 IsEmpty]: Start isEmpty. Operand 301297 states and 562357 transitions. [2019-09-08 05:30:41,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-09-08 05:30:41,081 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:30:41,081 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:30:41,082 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:30:41,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:30:41,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1131391466, now seen corresponding path program 2 times [2019-09-08 05:30:41,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:30:41,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:30:41,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:30:41,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:30:41,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:30:41,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:30:41,224 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 05:30:41,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:30:41,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:30:41,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:30:41,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:30:41,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:30:41,226 INFO L87 Difference]: Start difference. First operand 301297 states and 562357 transitions. Second operand 6 states. [2019-09-08 05:31:06,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:31:06,871 INFO L93 Difference]: Finished difference Result 589351 states and 1099791 transitions. [2019-09-08 05:31:06,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:31:06,872 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 284 [2019-09-08 05:31:06,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:31:08,202 INFO L225 Difference]: With dead ends: 589351 [2019-09-08 05:31:08,203 INFO L226 Difference]: Without dead ends: 301321 [2019-09-08 05:31:09,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:31:09,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301321 states. [2019-09-08 05:31:33,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301321 to 301297. [2019-09-08 05:31:33,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301297 states. [2019-09-08 05:31:35,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301297 states to 301297 states and 560049 transitions. [2019-09-08 05:31:35,210 INFO L78 Accepts]: Start accepts. Automaton has 301297 states and 560049 transitions. Word has length 284 [2019-09-08 05:31:35,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:31:35,211 INFO L475 AbstractCegarLoop]: Abstraction has 301297 states and 560049 transitions. [2019-09-08 05:31:35,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:31:35,211 INFO L276 IsEmpty]: Start isEmpty. Operand 301297 states and 560049 transitions. [2019-09-08 05:31:48,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-09-08 05:31:48,708 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:31:48,708 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:31:48,708 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:31:48,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:31:48,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1190535649, now seen corresponding path program 1 times [2019-09-08 05:31:48,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:31:48,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:31:48,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:31:48,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 05:31:48,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:31:48,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:31:48,869 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:31:48,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:31:48,870 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:31:48,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:31:49,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:31:49,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 3004 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 05:31:49,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:31:49,370 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:31:49,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:31:49,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-08 05:31:49,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:31:49,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:31:49,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:31:49,384 INFO L87 Difference]: Start difference. First operand 301297 states and 560049 transitions. Second operand 7 states. [2019-09-08 05:32:08,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:32:08,239 INFO L93 Difference]: Finished difference Result 434031 states and 780973 transitions. [2019-09-08 05:32:08,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:32:08,239 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 282 [2019-09-08 05:32:08,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:32:09,776 INFO L225 Difference]: With dead ends: 434031 [2019-09-08 05:32:09,776 INFO L226 Difference]: Without dead ends: 360495 [2019-09-08 05:32:09,990 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:32:10,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360495 states. [2019-09-08 05:32:39,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360495 to 360443. [2019-09-08 05:32:39,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360443 states.