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_spec0_product26.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:42:14,041 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:42:14,043 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:42:14,056 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:42:14,056 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:42:14,057 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:42:14,059 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:42:14,060 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:42:14,062 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:42:14,063 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:42:14,064 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:42:14,065 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:42:14,066 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:42:14,067 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:42:14,067 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:42:14,069 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:42:14,070 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:42:14,071 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:42:14,072 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:42:14,075 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:42:14,076 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:42:14,077 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:42:14,079 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:42:14,080 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:42:14,082 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:42:14,082 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:42:14,083 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:42:14,084 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:42:14,084 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:42:14,085 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:42:14,085 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:42:14,086 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:42:14,087 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:42:14,088 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:42:14,089 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:42:14,089 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:42:14,090 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:42:14,090 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:42:14,090 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:42:14,091 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:42:14,092 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:42:14,093 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-10-02 12:42:14,108 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:42:14,108 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:42:14,110 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:42:14,110 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:42:14,110 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:42:14,110 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:42:14,111 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:42:14,111 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:42:14,111 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:42:14,111 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:42:14,111 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:42:14,112 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:42:14,112 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:42:14,112 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:42:14,112 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:42:14,112 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:42:14,112 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:42:14,113 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:42:14,113 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:42:14,113 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:42:14,113 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:42:14,114 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:42:14,114 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:42:14,114 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:42:14,114 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:42:14,114 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:42:14,115 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:42:14,115 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:42:14,115 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:42:14,148 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:42:14,160 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:42:14,164 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:42:14,166 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:42:14,166 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:42:14,167 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec0_product26.cil.c [2019-10-02 12:42:14,230 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f63f31af0/13157064e3d443979f93cd79f81fcc41/FLAG41ed17ffd [2019-10-02 12:42:14,890 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:42:14,892 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec0_product26.cil.c [2019-10-02 12:42:14,922 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f63f31af0/13157064e3d443979f93cd79f81fcc41/FLAG41ed17ffd [2019-10-02 12:42:15,120 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f63f31af0/13157064e3d443979f93cd79f81fcc41 [2019-10-02 12:42:15,129 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:42:15,131 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:42:15,132 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:42:15,132 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:42:15,136 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:42:15,137 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:42:15" (1/1) ... [2019-10-02 12:42:15,140 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11498c8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:42:15, skipping insertion in model container [2019-10-02 12:42:15,140 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:42:15" (1/1) ... [2019-10-02 12:42:15,149 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:42:15,217 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:42:16,063 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:42:16,089 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:42:16,277 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:42:16,422 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:42:16,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:42:16 WrapperNode [2019-10-02 12:42:16,424 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:42:16,425 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:42:16,425 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:42:16,425 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:42:16,440 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:42:16" (1/1) ... [2019-10-02 12:42:16,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:42:16" (1/1) ... [2019-10-02 12:42:16,503 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:42:16" (1/1) ... [2019-10-02 12:42:16,503 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:42:16" (1/1) ... [2019-10-02 12:42:16,581 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:42:16" (1/1) ... [2019-10-02 12:42:16,600 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:42:16" (1/1) ... [2019-10-02 12:42:16,611 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:42:16" (1/1) ... [2019-10-02 12:42:16,628 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:42:16,629 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:42:16,629 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:42:16,629 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:42:16,632 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:42:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:42:16,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:42:16,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:42:16,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:42:16,697 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 12:42:16,698 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 12:42:16,698 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-10-02 12:42:16,698 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 12:42:16,699 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 12:42:16,699 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-10-02 12:42:16,699 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AddressBook [2019-10-02 12:42:16,699 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-10-02 12:42:16,700 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 12:42:16,700 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 12:42:16,700 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 12:42:16,701 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 12:42:16,702 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 12:42:16,704 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 12:42:16,704 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 12:42:16,704 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 12:42:16,705 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 12:42:16,706 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-02 12:42:16,707 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-02 12:42:16,707 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-02 12:42:16,707 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 12:42:16,707 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 12:42:16,708 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 12:42:16,708 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 12:42:16,708 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 12:42:16,708 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 12:42:16,708 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 12:42:16,708 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 12:42:16,709 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 12:42:16,709 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 12:42:16,709 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 12:42:16,709 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 12:42:16,709 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 12:42:16,710 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 12:42:16,710 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 12:42:16,710 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 12:42:16,710 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 12:42:16,710 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 12:42:16,710 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 12:42:16,711 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 12:42:16,711 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 12:42:16,711 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 12:42:16,711 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 12:42:16,712 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 12:42:16,712 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 12:42:16,712 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 12:42:16,712 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 12:42:16,712 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 12:42:16,712 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 12:42:16,713 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:42:16,713 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:42:16,713 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 12:42:16,713 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 12:42:16,713 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 12:42:16,713 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 12:42:16,714 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 12:42:16,714 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 12:42:16,714 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 12:42:16,714 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 12:42:16,714 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 12:42:16,715 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-02 12:42:16,715 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-02 12:42:16,715 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-02 12:42:16,715 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:42:16,716 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 12:42:16,716 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 12:42:16,716 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 12:42:16,716 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 12:42:16,716 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 12:42:16,717 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 12:42:16,717 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:42:16,718 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:42:16,718 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:42:16,718 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:42:16,718 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 12:42:16,718 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 12:42:16,718 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 12:42:16,718 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 12:42:16,719 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 12:42:16,719 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 12:42:16,719 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 12:42:16,720 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 12:42:16,720 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 12:42:16,720 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 12:42:16,721 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 12:42:16,721 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 12:42:16,721 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 12:42:16,722 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 12:42:16,722 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 12:42:16,722 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 12:42:16,722 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 12:42:16,722 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 12:42:16,723 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 12:42:16,723 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 12:42:16,723 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 12:42:16,723 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 12:42:16,723 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 12:42:16,723 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 12:42:16,723 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 12:42:16,724 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 12:42:16,724 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 12:42:16,724 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 12:42:16,724 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 12:42:16,724 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__DecryptForward_spec__1 [2019-10-02 12:42:16,724 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:42:16,724 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:42:16,725 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:42:16,725 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:42:16,725 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:42:16,725 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:42:16,725 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 12:42:16,725 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:42:16,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:42:16,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:42:16,726 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:42:16,726 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 12:42:16,727 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 12:42:16,727 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 12:42:16,727 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 12:42:16,727 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 12:42:16,728 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 12:42:16,729 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 12:42:16,729 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 12:42:16,729 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 12:42:16,729 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 12:42:16,729 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 12:42:16,730 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 12:42:16,730 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 12:42:16,730 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 12:42:16,730 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 12:42:16,730 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 12:42:16,731 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 12:42:16,731 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 12:42:16,731 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 12:42:16,731 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 12:42:16,731 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 12:42:16,732 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 12:42:16,735 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 12:42:16,736 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 12:42:16,736 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 12:42:16,737 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 12:42:16,742 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 12:42:16,742 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 12:42:16,742 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 12:42:16,742 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 12:42:16,742 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 12:42:16,743 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 12:42:16,743 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-02 12:42:16,743 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-02 12:42:16,743 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-02 12:42:16,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:42:16,743 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 12:42:16,743 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-10-02 12:42:16,744 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-10-02 12:42:16,744 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AddressBook [2019-10-02 12:42:16,744 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-10-02 12:42:16,744 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__DecryptForward_spec__1 [2019-10-02 12:42:16,744 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 12:42:16,744 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 12:42:16,744 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 12:42:16,745 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 12:42:16,745 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 12:42:16,745 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 12:42:16,745 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 12:42:16,745 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 12:42:16,745 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 12:42:16,745 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 12:42:16,745 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 12:42:16,745 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 12:42:16,746 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 12:42:16,746 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 12:42:16,746 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 12:42:16,746 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 12:42:16,746 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 12:42:16,746 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 12:42:16,748 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 12:42:16,748 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 12:42:16,748 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 12:42:16,749 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 12:42:16,749 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 12:42:16,749 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 12:42:16,749 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:42:16,749 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:42:16,749 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:42:16,749 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 12:42:16,750 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 12:42:16,750 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 12:42:16,750 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 12:42:16,750 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 12:42:16,750 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:42:16,750 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:42:16,750 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:42:16,750 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 12:42:16,751 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 12:42:16,751 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 12:42:16,751 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 12:42:16,751 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 12:42:16,751 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 12:42:16,751 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 12:42:16,751 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 12:42:16,751 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 12:42:16,752 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-02 12:42:16,752 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-02 12:42:16,752 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-02 12:42:16,752 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 12:42:16,752 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 12:42:16,752 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 12:42:16,752 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 12:42:16,753 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 12:42:16,753 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 12:42:16,753 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 12:42:16,753 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:42:16,753 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 12:42:16,753 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 12:42:16,753 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 12:42:16,753 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 12:42:16,754 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 12:42:16,754 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 12:42:16,754 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 12:42:16,754 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 12:42:16,754 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 12:42:16,754 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:42:16,754 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:42:16,754 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:42:16,755 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:42:16,755 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:42:16,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:42:16,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:42:16,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:42:16,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:42:16,756 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:42:16,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:42:16,756 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:42:16,756 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:42:16,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:42:16,757 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:42:16,757 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:42:16,757 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:42:16,757 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 12:42:16,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:42:16,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:42:16,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:42:18,668 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:42:18,669 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 12:42:18,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:42:18 BoogieIcfgContainer [2019-10-02 12:42:18,671 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:42:18,672 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:42:18,673 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:42:18,676 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:42:18,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:42:15" (1/3) ... [2019-10-02 12:42:18,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12e28882 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:42:18, skipping insertion in model container [2019-10-02 12:42:18,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:42:16" (2/3) ... [2019-10-02 12:42:18,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12e28882 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:42:18, skipping insertion in model container [2019-10-02 12:42:18,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:42:18" (3/3) ... [2019-10-02 12:42:18,680 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec0_product26.cil.c [2019-10-02 12:42:18,692 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:42:18,702 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:42:18,722 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:42:18,761 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:42:18,762 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:42:18,762 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:42:18,762 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:42:18,763 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:42:18,763 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:42:18,763 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:42:18,763 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:42:18,763 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:42:18,798 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states. [2019-10-02 12:42:18,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-02 12:42:18,822 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:42:18,824 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:42:18,827 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:42:18,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:42:18,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1050293999, now seen corresponding path program 1 times [2019-10-02 12:42:18,836 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:42:18,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:42:18,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:18,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:42:18,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:19,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:42:19,677 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 12:42:19,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:42:19,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 12:42:19,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 12:42:19,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 12:42:19,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 12:42:19,704 INFO L87 Difference]: Start difference. First operand 598 states. Second operand 2 states. [2019-10-02 12:42:19,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:42:19,790 INFO L93 Difference]: Finished difference Result 871 states and 1181 transitions. [2019-10-02 12:42:19,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 12:42:19,792 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 209 [2019-10-02 12:42:19,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:42:19,833 INFO L225 Difference]: With dead ends: 871 [2019-10-02 12:42:19,833 INFO L226 Difference]: Without dead ends: 569 [2019-10-02 12:42:19,847 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 12:42:19,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-10-02 12:42:19,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2019-10-02 12:42:19,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2019-10-02 12:42:19,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 775 transitions. [2019-10-02 12:42:20,000 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 775 transitions. Word has length 209 [2019-10-02 12:42:20,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:42:20,003 INFO L475 AbstractCegarLoop]: Abstraction has 569 states and 775 transitions. [2019-10-02 12:42:20,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 12:42:20,003 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 775 transitions. [2019-10-02 12:42:20,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-02 12:42:20,010 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:42:20,010 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:42:20,010 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:42:20,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:42:20,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1566712798, now seen corresponding path program 1 times [2019-10-02 12:42:20,011 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:42:20,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:42:20,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:20,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:42:20,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:20,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:42:20,357 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 12:42:20,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:42:20,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:42:20,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:42:20,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:42:20,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:42:20,364 INFO L87 Difference]: Start difference. First operand 569 states and 775 transitions. Second operand 3 states. [2019-10-02 12:42:20,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:42:20,453 INFO L93 Difference]: Finished difference Result 854 states and 1144 transitions. [2019-10-02 12:42:20,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:42:20,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2019-10-02 12:42:20,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:42:20,463 INFO L225 Difference]: With dead ends: 854 [2019-10-02 12:42:20,464 INFO L226 Difference]: Without dead ends: 572 [2019-10-02 12:42:20,479 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:42:20,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-10-02 12:42:20,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 571. [2019-10-02 12:42:20,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-02 12:42:20,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 777 transitions. [2019-10-02 12:42:20,530 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 777 transitions. Word has length 210 [2019-10-02 12:42:20,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:42:20,532 INFO L475 AbstractCegarLoop]: Abstraction has 571 states and 777 transitions. [2019-10-02 12:42:20,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:42:20,532 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 777 transitions. [2019-10-02 12:42:20,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-02 12:42:20,539 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:42:20,540 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:42:20,540 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:42:20,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:42:20,540 INFO L82 PathProgramCache]: Analyzing trace with hash 641729421, now seen corresponding path program 1 times [2019-10-02 12:42:20,541 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:42:20,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:42:20,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:20,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:42:20,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:20,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:42:20,802 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 12:42:20,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:42:20,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:42:20,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:42:20,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:42:20,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:42:20,808 INFO L87 Difference]: Start difference. First operand 571 states and 777 transitions. Second operand 3 states. [2019-10-02 12:42:20,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:42:20,875 INFO L93 Difference]: Finished difference Result 1122 states and 1558 transitions. [2019-10-02 12:42:20,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:42:20,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 222 [2019-10-02 12:42:20,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:42:20,887 INFO L225 Difference]: With dead ends: 1122 [2019-10-02 12:42:20,887 INFO L226 Difference]: Without dead ends: 616 [2019-10-02 12:42:20,890 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:42:20,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-10-02 12:42:20,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 615. [2019-10-02 12:42:20,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2019-10-02 12:42:20,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 852 transitions. [2019-10-02 12:42:20,944 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 852 transitions. Word has length 222 [2019-10-02 12:42:20,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:42:20,946 INFO L475 AbstractCegarLoop]: Abstraction has 615 states and 852 transitions. [2019-10-02 12:42:20,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:42:20,946 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 852 transitions. [2019-10-02 12:42:20,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-10-02 12:42:20,957 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:42:20,957 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:42:20,958 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:42:20,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:42:20,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1183894692, now seen corresponding path program 1 times [2019-10-02 12:42:20,959 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:42:20,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:42:20,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:20,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:42:20,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:21,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:42:21,261 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 12:42:21,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:42:21,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:42:21,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:42:21,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:42:21,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:42:21,264 INFO L87 Difference]: Start difference. First operand 615 states and 852 transitions. Second operand 3 states. [2019-10-02 12:42:21,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:42:21,329 INFO L93 Difference]: Finished difference Result 1251 states and 1778 transitions. [2019-10-02 12:42:21,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:42:21,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 223 [2019-10-02 12:42:21,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:42:21,341 INFO L225 Difference]: With dead ends: 1251 [2019-10-02 12:42:21,341 INFO L226 Difference]: Without dead ends: 701 [2019-10-02 12:42:21,344 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:42:21,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2019-10-02 12:42:21,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 700. [2019-10-02 12:42:21,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2019-10-02 12:42:21,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 996 transitions. [2019-10-02 12:42:21,384 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 996 transitions. Word has length 223 [2019-10-02 12:42:21,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:42:21,384 INFO L475 AbstractCegarLoop]: Abstraction has 700 states and 996 transitions. [2019-10-02 12:42:21,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:42:21,385 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 996 transitions. [2019-10-02 12:42:21,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-10-02 12:42:21,391 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:42:21,391 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:42:21,392 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:42:21,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:42:21,392 INFO L82 PathProgramCache]: Analyzing trace with hash -577752831, now seen corresponding path program 1 times [2019-10-02 12:42:21,393 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:42:21,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:42:21,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:21,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:42:21,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:21,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:42:22,026 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:42:22,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:42:22,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-02 12:42:22,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 12:42:22,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 12:42:22,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:42:22,029 INFO L87 Difference]: Start difference. First operand 700 states and 996 transitions. Second operand 19 states. [2019-10-02 12:42:27,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:42:27,714 INFO L93 Difference]: Finished difference Result 2240 states and 3191 transitions. [2019-10-02 12:42:27,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-02 12:42:27,715 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 226 [2019-10-02 12:42:27,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:42:27,732 INFO L225 Difference]: With dead ends: 2240 [2019-10-02 12:42:27,733 INFO L226 Difference]: Without dead ends: 1971 [2019-10-02 12:42:27,736 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=287, Invalid=2683, Unknown=0, NotChecked=0, Total=2970 [2019-10-02 12:42:27,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1971 states. [2019-10-02 12:42:27,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1971 to 1934. [2019-10-02 12:42:27,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1934 states. [2019-10-02 12:42:27,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1934 states and 2772 transitions. [2019-10-02 12:42:27,854 INFO L78 Accepts]: Start accepts. Automaton has 1934 states and 2772 transitions. Word has length 226 [2019-10-02 12:42:27,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:42:27,855 INFO L475 AbstractCegarLoop]: Abstraction has 1934 states and 2772 transitions. [2019-10-02 12:42:27,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 12:42:27,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1934 states and 2772 transitions. [2019-10-02 12:42:27,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-10-02 12:42:27,865 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:42:27,866 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:42:27,866 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:42:27,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:42:27,867 INFO L82 PathProgramCache]: Analyzing trace with hash 893920590, now seen corresponding path program 1 times [2019-10-02 12:42:27,867 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:42:27,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:42:27,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:27,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:42:27,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:42:28,189 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:42:28,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:42:28,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:42:28,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:42:28,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:42:28,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:42:28,192 INFO L87 Difference]: Start difference. First operand 1934 states and 2772 transitions. Second operand 11 states. [2019-10-02 12:42:28,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:42:28,759 INFO L93 Difference]: Finished difference Result 3191 states and 4529 transitions. [2019-10-02 12:42:28,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:42:28,760 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 227 [2019-10-02 12:42:28,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:42:28,778 INFO L225 Difference]: With dead ends: 3191 [2019-10-02 12:42:28,779 INFO L226 Difference]: Without dead ends: 2056 [2019-10-02 12:42:28,788 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:42:28,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2056 states. [2019-10-02 12:42:28,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2056 to 2056. [2019-10-02 12:42:28,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2019-10-02 12:42:28,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 2969 transitions. [2019-10-02 12:42:28,958 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 2969 transitions. Word has length 227 [2019-10-02 12:42:28,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:42:28,961 INFO L475 AbstractCegarLoop]: Abstraction has 2056 states and 2969 transitions. [2019-10-02 12:42:28,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:42:28,961 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2969 transitions. [2019-10-02 12:42:28,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-10-02 12:42:28,975 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:42:28,976 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:42:28,976 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:42:28,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:42:28,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1022222007, now seen corresponding path program 1 times [2019-10-02 12:42:28,977 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:42:28,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:42:28,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:28,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:42:28,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:42:29,428 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:42:29,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:42:29,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-02 12:42:29,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:42:29,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:42:29,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:42:29,431 INFO L87 Difference]: Start difference. First operand 2056 states and 2969 transitions. Second operand 15 states. [2019-10-02 12:42:33,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:42:33,084 INFO L93 Difference]: Finished difference Result 3371 states and 4832 transitions. [2019-10-02 12:42:33,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-02 12:42:33,085 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 227 [2019-10-02 12:42:33,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:42:33,104 INFO L225 Difference]: With dead ends: 3371 [2019-10-02 12:42:33,104 INFO L226 Difference]: Without dead ends: 2174 [2019-10-02 12:42:33,112 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=229, Invalid=1933, Unknown=0, NotChecked=0, Total=2162 [2019-10-02 12:42:33,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2174 states. [2019-10-02 12:42:33,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2174 to 2137. [2019-10-02 12:42:33,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2137 states. [2019-10-02 12:42:33,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2137 states to 2137 states and 3106 transitions. [2019-10-02 12:42:33,273 INFO L78 Accepts]: Start accepts. Automaton has 2137 states and 3106 transitions. Word has length 227 [2019-10-02 12:42:33,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:42:33,276 INFO L475 AbstractCegarLoop]: Abstraction has 2137 states and 3106 transitions. [2019-10-02 12:42:33,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:42:33,276 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 3106 transitions. [2019-10-02 12:42:33,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-02 12:42:33,290 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:42:33,290 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:42:33,291 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:42:33,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:42:33,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1403215942, now seen corresponding path program 1 times [2019-10-02 12:42:33,292 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:42:33,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:42:33,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:33,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:42:33,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:33,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:42:33,466 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 12:42:33,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:42:33,466 INFO L224 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:42:33,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:42:34,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:42:34,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 2952 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 12:42:34,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:42:34,395 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 12:42:34,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:42:34,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2019-10-02 12:42:34,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:42:34,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:42:34,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:42:34,417 INFO L87 Difference]: Start difference. First operand 2137 states and 3106 transitions. Second operand 12 states. [2019-10-02 12:42:36,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:42:36,898 INFO L93 Difference]: Finished difference Result 3895 states and 5689 transitions. [2019-10-02 12:42:36,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:42:36,899 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 230 [2019-10-02 12:42:36,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:42:36,921 INFO L225 Difference]: With dead ends: 3895 [2019-10-02 12:42:36,921 INFO L226 Difference]: Without dead ends: 1791 [2019-10-02 12:42:36,935 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:42:36,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1791 states. [2019-10-02 12:42:37,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1791 to 1791. [2019-10-02 12:42:37,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1791 states. [2019-10-02 12:42:37,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 2609 transitions. [2019-10-02 12:42:37,091 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 2609 transitions. Word has length 230 [2019-10-02 12:42:37,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:42:37,092 INFO L475 AbstractCegarLoop]: Abstraction has 1791 states and 2609 transitions. [2019-10-02 12:42:37,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:42:37,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 2609 transitions. [2019-10-02 12:42:37,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-10-02 12:42:37,110 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:42:37,111 INFO L411 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] [2019-10-02 12:42:37,111 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:42:37,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:42:37,112 INFO L82 PathProgramCache]: Analyzing trace with hash -549731115, now seen corresponding path program 1 times [2019-10-02 12:42:37,112 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:42:37,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:42:37,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:37,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:42:37,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:37,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:42:37,710 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:42:37,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:42:37,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-02 12:42:37,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:42:37,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:42:37,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:42:37,713 INFO L87 Difference]: Start difference. First operand 1791 states and 2609 transitions. Second operand 15 states. [2019-10-02 12:42:41,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:42:41,283 INFO L93 Difference]: Finished difference Result 2481 states and 3597 transitions. [2019-10-02 12:42:41,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-02 12:42:41,284 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 229 [2019-10-02 12:42:41,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:42:41,299 INFO L225 Difference]: With dead ends: 2481 [2019-10-02 12:42:41,299 INFO L226 Difference]: Without dead ends: 1819 [2019-10-02 12:42:41,305 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=1166, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 12:42:41,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1819 states. [2019-10-02 12:42:41,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1819 to 1791. [2019-10-02 12:42:41,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1791 states. [2019-10-02 12:42:41,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 2609 transitions. [2019-10-02 12:42:41,420 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 2609 transitions. Word has length 229 [2019-10-02 12:42:41,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:42:41,421 INFO L475 AbstractCegarLoop]: Abstraction has 1791 states and 2609 transitions. [2019-10-02 12:42:41,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:42:41,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 2609 transitions. [2019-10-02 12:42:41,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-02 12:42:41,433 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:42:41,433 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:42:41,434 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:42:41,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:42:41,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1173667209, now seen corresponding path program 1 times [2019-10-02 12:42:41,434 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:42:41,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:42:41,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:41,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:42:41,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:41,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:42:41,886 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 12:42:41,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:42:41,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-10-02 12:42:41,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 12:42:41,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 12:42:41,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:42:41,889 INFO L87 Difference]: Start difference. First operand 1791 states and 2609 transitions. Second operand 16 states. [2019-10-02 12:42:42,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:42:42,600 INFO L93 Difference]: Finished difference Result 2780 states and 3986 transitions. [2019-10-02 12:42:42,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 12:42:42,601 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 228 [2019-10-02 12:42:42,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:42:42,613 INFO L225 Difference]: With dead ends: 2780 [2019-10-02 12:42:42,614 INFO L226 Difference]: Without dead ends: 1823 [2019-10-02 12:42:42,620 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-10-02 12:42:42,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states. [2019-10-02 12:42:42,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 1821. [2019-10-02 12:42:42,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1821 states. [2019-10-02 12:42:42,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 2639 transitions. [2019-10-02 12:42:42,714 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 2639 transitions. Word has length 228 [2019-10-02 12:42:42,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:42:42,716 INFO L475 AbstractCegarLoop]: Abstraction has 1821 states and 2639 transitions. [2019-10-02 12:42:42,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 12:42:42,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2639 transitions. [2019-10-02 12:42:42,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-02 12:42:42,724 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:42:42,725 INFO L411 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] [2019-10-02 12:42:42,725 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:42:42,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:42:42,726 INFO L82 PathProgramCache]: Analyzing trace with hash -311397876, now seen corresponding path program 1 times [2019-10-02 12:42:42,726 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:42:42,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:42:42,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:42,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:42:42,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:42:42,923 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:42:42,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:42:42,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:42:42,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:42:42,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:42:42,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:42:42,925 INFO L87 Difference]: Start difference. First operand 1821 states and 2639 transitions. Second operand 5 states. [2019-10-02 12:42:44,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:42:44,108 INFO L93 Difference]: Finished difference Result 4525 states and 6470 transitions. [2019-10-02 12:42:44,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:42:44,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 228 [2019-10-02 12:42:44,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:42:44,135 INFO L225 Difference]: With dead ends: 4525 [2019-10-02 12:42:44,135 INFO L226 Difference]: Without dead ends: 3856 [2019-10-02 12:42:44,140 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:42:44,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3856 states. [2019-10-02 12:42:44,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3856 to 3842. [2019-10-02 12:42:44,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3842 states. [2019-10-02 12:42:44,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3842 states to 3842 states and 5528 transitions. [2019-10-02 12:42:44,402 INFO L78 Accepts]: Start accepts. Automaton has 3842 states and 5528 transitions. Word has length 228 [2019-10-02 12:42:44,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:42:44,402 INFO L475 AbstractCegarLoop]: Abstraction has 3842 states and 5528 transitions. [2019-10-02 12:42:44,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:42:44,403 INFO L276 IsEmpty]: Start isEmpty. Operand 3842 states and 5528 transitions. [2019-10-02 12:42:44,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-02 12:42:44,414 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:42:44,415 INFO L411 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] [2019-10-02 12:42:44,415 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:42:44,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:42:44,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1542947661, now seen corresponding path program 1 times [2019-10-02 12:42:44,416 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:42:44,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:42:44,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:44,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:42:44,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:44,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:42:44,675 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 12:42:44,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:42:44,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 12:42:44,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 12:42:44,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 12:42:44,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:42:44,677 INFO L87 Difference]: Start difference. First operand 3842 states and 5528 transitions. Second operand 13 states. [2019-10-02 12:42:48,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:42:48,073 INFO L93 Difference]: Finished difference Result 10334 states and 15034 transitions. [2019-10-02 12:42:48,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 12:42:48,074 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 228 [2019-10-02 12:42:48,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:42:48,133 INFO L225 Difference]: With dead ends: 10334 [2019-10-02 12:42:48,133 INFO L226 Difference]: Without dead ends: 7715 [2019-10-02 12:42:48,154 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2019-10-02 12:42:48,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7715 states. [2019-10-02 12:42:48,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7715 to 7678. [2019-10-02 12:42:48,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7678 states. [2019-10-02 12:42:48,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7678 states to 7678 states and 11045 transitions. [2019-10-02 12:42:48,626 INFO L78 Accepts]: Start accepts. Automaton has 7678 states and 11045 transitions. Word has length 228 [2019-10-02 12:42:48,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:42:48,627 INFO L475 AbstractCegarLoop]: Abstraction has 7678 states and 11045 transitions. [2019-10-02 12:42:48,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 12:42:48,627 INFO L276 IsEmpty]: Start isEmpty. Operand 7678 states and 11045 transitions. [2019-10-02 12:42:48,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-10-02 12:42:48,649 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:42:48,650 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:42:48,650 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:42:48,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:42:48,651 INFO L82 PathProgramCache]: Analyzing trace with hash -328444415, now seen corresponding path program 1 times [2019-10-02 12:42:48,651 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:42:48,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:42:48,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:48,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:42:48,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:48,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:42:48,847 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 12:42:48,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:42:48,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:42:48,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:42:48,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:42:48,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:42:48,851 INFO L87 Difference]: Start difference. First operand 7678 states and 11045 transitions. Second operand 3 states. [2019-10-02 12:42:49,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:42:49,093 INFO L93 Difference]: Finished difference Result 16267 states and 23799 transitions. [2019-10-02 12:42:49,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:42:49,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 226 [2019-10-02 12:42:49,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:42:49,145 INFO L225 Difference]: With dead ends: 16267 [2019-10-02 12:42:49,146 INFO L226 Difference]: Without dead ends: 8668 [2019-10-02 12:42:49,180 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:42:49,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8668 states. [2019-10-02 12:42:49,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8668 to 8662. [2019-10-02 12:42:49,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8662 states. [2019-10-02 12:42:50,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8662 states to 8662 states and 12815 transitions. [2019-10-02 12:42:50,310 INFO L78 Accepts]: Start accepts. Automaton has 8662 states and 12815 transitions. Word has length 226 [2019-10-02 12:42:50,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:42:50,310 INFO L475 AbstractCegarLoop]: Abstraction has 8662 states and 12815 transitions. [2019-10-02 12:42:50,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:42:50,311 INFO L276 IsEmpty]: Start isEmpty. Operand 8662 states and 12815 transitions. [2019-10-02 12:42:50,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-10-02 12:42:50,336 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:42:50,337 INFO L411 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] [2019-10-02 12:42:50,337 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:42:50,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:42:50,338 INFO L82 PathProgramCache]: Analyzing trace with hash 564912818, now seen corresponding path program 1 times [2019-10-02 12:42:50,338 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:42:50,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:42:50,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:50,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:42:50,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:42:50,568 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:42:50,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:42:50,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:42:50,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:42:50,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:42:50,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:42:50,570 INFO L87 Difference]: Start difference. First operand 8662 states and 12815 transitions. Second operand 11 states. [2019-10-02 12:42:50,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:42:50,976 INFO L93 Difference]: Finished difference Result 14481 states and 21091 transitions. [2019-10-02 12:42:50,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:42:50,977 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 229 [2019-10-02 12:42:50,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:42:51,023 INFO L225 Difference]: With dead ends: 14481 [2019-10-02 12:42:51,023 INFO L226 Difference]: Without dead ends: 9208 [2019-10-02 12:42:51,047 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:42:51,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9208 states. [2019-10-02 12:42:51,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9208 to 9152. [2019-10-02 12:42:51,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9152 states. [2019-10-02 12:42:51,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9152 states to 9152 states and 13610 transitions. [2019-10-02 12:42:51,545 INFO L78 Accepts]: Start accepts. Automaton has 9152 states and 13610 transitions. Word has length 229 [2019-10-02 12:42:51,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:42:51,546 INFO L475 AbstractCegarLoop]: Abstraction has 9152 states and 13610 transitions. [2019-10-02 12:42:51,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:42:51,546 INFO L276 IsEmpty]: Start isEmpty. Operand 9152 states and 13610 transitions. [2019-10-02 12:42:51,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-02 12:42:51,574 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:42:51,574 INFO L411 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] [2019-10-02 12:42:51,575 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:42:51,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:42:51,575 INFO L82 PathProgramCache]: Analyzing trace with hash 532738946, now seen corresponding path program 1 times [2019-10-02 12:42:51,575 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:42:51,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:42:51,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:51,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:42:51,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:51,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:42:51,776 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:42:51,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:42:51,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:42:51,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:42:51,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:42:51,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:42:51,778 INFO L87 Difference]: Start difference. First operand 9152 states and 13610 transitions. Second operand 9 states. [2019-10-02 12:42:52,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:42:52,222 INFO L93 Difference]: Finished difference Result 15035 states and 22051 transitions. [2019-10-02 12:42:52,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:42:52,222 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 230 [2019-10-02 12:42:52,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:42:52,269 INFO L225 Difference]: With dead ends: 15035 [2019-10-02 12:42:52,269 INFO L226 Difference]: Without dead ends: 9240 [2019-10-02 12:42:52,293 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:42:52,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9240 states. [2019-10-02 12:42:52,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9240 to 9184. [2019-10-02 12:42:52,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9184 states. [2019-10-02 12:42:52,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9184 states to 9184 states and 13642 transitions. [2019-10-02 12:42:52,803 INFO L78 Accepts]: Start accepts. Automaton has 9184 states and 13642 transitions. Word has length 230 [2019-10-02 12:42:52,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:42:52,804 INFO L475 AbstractCegarLoop]: Abstraction has 9184 states and 13642 transitions. [2019-10-02 12:42:52,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:42:52,804 INFO L276 IsEmpty]: Start isEmpty. Operand 9184 states and 13642 transitions. [2019-10-02 12:42:52,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-10-02 12:42:52,831 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:42:52,831 INFO L411 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] [2019-10-02 12:42:52,832 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:42:52,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:42:52,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1113786308, now seen corresponding path program 1 times [2019-10-02 12:42:52,832 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:42:52,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:42:52,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:52,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:42:52,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:42:53,082 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:42:53,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:42:53,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:42:53,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:42:53,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:42:53,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:42:53,085 INFO L87 Difference]: Start difference. First operand 9184 states and 13642 transitions. Second operand 6 states. [2019-10-02 12:42:54,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:42:54,025 INFO L93 Difference]: Finished difference Result 24340 states and 35990 transitions. [2019-10-02 12:42:54,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:42:54,025 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 229 [2019-10-02 12:42:54,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:42:54,112 INFO L225 Difference]: With dead ends: 24340 [2019-10-02 12:42:54,113 INFO L226 Difference]: Without dead ends: 18513 [2019-10-02 12:42:54,136 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:42:54,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18513 states. [2019-10-02 12:42:55,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18513 to 18394. [2019-10-02 12:42:55,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18394 states. [2019-10-02 12:42:55,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18394 states to 18394 states and 27369 transitions. [2019-10-02 12:42:55,174 INFO L78 Accepts]: Start accepts. Automaton has 18394 states and 27369 transitions. Word has length 229 [2019-10-02 12:42:55,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:42:55,175 INFO L475 AbstractCegarLoop]: Abstraction has 18394 states and 27369 transitions. [2019-10-02 12:42:55,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:42:55,175 INFO L276 IsEmpty]: Start isEmpty. Operand 18394 states and 27369 transitions. [2019-10-02 12:42:55,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-02 12:42:55,225 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:42:55,226 INFO L411 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] [2019-10-02 12:42:55,226 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:42:55,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:42:55,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1425221971, now seen corresponding path program 1 times [2019-10-02 12:42:55,227 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:42:55,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:42:55,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:55,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:42:55,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:55,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:42:55,428 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:42:55,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:42:55,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:42:55,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:42:55,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:42:55,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:42:55,431 INFO L87 Difference]: Start difference. First operand 18394 states and 27369 transitions. Second operand 6 states. [2019-10-02 12:42:56,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:42:56,694 INFO L93 Difference]: Finished difference Result 48988 states and 72467 transitions. [2019-10-02 12:42:56,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:42:56,695 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 231 [2019-10-02 12:42:56,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:42:56,869 INFO L225 Difference]: With dead ends: 48988 [2019-10-02 12:42:56,870 INFO L226 Difference]: Without dead ends: 37229 [2019-10-02 12:42:56,928 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:42:56,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37229 states. [2019-10-02 12:42:59,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37229 to 36802. [2019-10-02 12:42:59,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36802 states. [2019-10-02 12:42:59,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36802 states to 36802 states and 54865 transitions. [2019-10-02 12:42:59,197 INFO L78 Accepts]: Start accepts. Automaton has 36802 states and 54865 transitions. Word has length 231 [2019-10-02 12:42:59,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:42:59,197 INFO L475 AbstractCegarLoop]: Abstraction has 36802 states and 54865 transitions. [2019-10-02 12:42:59,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:42:59,198 INFO L276 IsEmpty]: Start isEmpty. Operand 36802 states and 54865 transitions. [2019-10-02 12:42:59,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-10-02 12:42:59,265 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:42:59,266 INFO L411 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] [2019-10-02 12:42:59,266 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:42:59,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:42:59,267 INFO L82 PathProgramCache]: Analyzing trace with hash 779938534, now seen corresponding path program 1 times [2019-10-02 12:42:59,267 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:42:59,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:42:59,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:59,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:42:59,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:59,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:43:00,609 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:43:00,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:43:00,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:43:00,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:43:00,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:43:00,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:43:00,611 INFO L87 Difference]: Start difference. First operand 36802 states and 54865 transitions. Second operand 9 states. [2019-10-02 12:43:01,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:43:01,516 INFO L93 Difference]: Finished difference Result 62013 states and 90811 transitions. [2019-10-02 12:43:01,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:43:01,516 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 232 [2019-10-02 12:43:01,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:43:01,704 INFO L225 Difference]: With dead ends: 62013 [2019-10-02 12:43:01,704 INFO L226 Difference]: Without dead ends: 38530 [2019-10-02 12:43:01,786 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:43:01,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38530 states. [2019-10-02 12:43:03,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38530 to 38402. [2019-10-02 12:43:03,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38402 states. [2019-10-02 12:43:03,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38402 states to 38402 states and 57429 transitions. [2019-10-02 12:43:03,634 INFO L78 Accepts]: Start accepts. Automaton has 38402 states and 57429 transitions. Word has length 232 [2019-10-02 12:43:03,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:43:03,634 INFO L475 AbstractCegarLoop]: Abstraction has 38402 states and 57429 transitions. [2019-10-02 12:43:03,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:43:03,635 INFO L276 IsEmpty]: Start isEmpty. Operand 38402 states and 57429 transitions. [2019-10-02 12:43:03,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-02 12:43:03,700 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:43:03,701 INFO L411 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] [2019-10-02 12:43:03,702 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:43:03,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:43:03,702 INFO L82 PathProgramCache]: Analyzing trace with hash 469472658, now seen corresponding path program 1 times [2019-10-02 12:43:03,702 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:43:03,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:43:03,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:43:03,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:43:03,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:43:03,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:43:03,923 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:43:03,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:43:03,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:43:03,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:43:03,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:43:03,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:43:03,926 INFO L87 Difference]: Start difference. First operand 38402 states and 57429 transitions. Second operand 11 states. [2019-10-02 12:43:05,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:43:05,257 INFO L93 Difference]: Finished difference Result 64213 states and 94699 transitions. [2019-10-02 12:43:05,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:43:05,258 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 233 [2019-10-02 12:43:05,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:43:05,411 INFO L225 Difference]: With dead ends: 64213 [2019-10-02 12:43:05,411 INFO L226 Difference]: Without dead ends: 39002 [2019-10-02 12:43:05,483 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:43:05,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39002 states. [2019-10-02 12:43:07,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39002 to 38874. [2019-10-02 12:43:07,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38874 states. [2019-10-02 12:43:07,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38874 states to 38874 states and 58077 transitions. [2019-10-02 12:43:07,299 INFO L78 Accepts]: Start accepts. Automaton has 38874 states and 58077 transitions. Word has length 233 [2019-10-02 12:43:07,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:43:07,300 INFO L475 AbstractCegarLoop]: Abstraction has 38874 states and 58077 transitions. [2019-10-02 12:43:07,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:43:07,300 INFO L276 IsEmpty]: Start isEmpty. Operand 38874 states and 58077 transitions. [2019-10-02 12:43:07,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-02 12:43:07,349 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:43:07,349 INFO L411 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] [2019-10-02 12:43:07,350 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:43:07,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:43:07,350 INFO L82 PathProgramCache]: Analyzing trace with hash -982865632, now seen corresponding path program 1 times [2019-10-02 12:43:07,350 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:43:07,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:43:07,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:43:07,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:43:07,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:43:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:43:07,528 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:43:07,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:43:07,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:43:07,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:43:07,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:43:07,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:43:07,530 INFO L87 Difference]: Start difference. First operand 38874 states and 58077 transitions. Second operand 9 states. [2019-10-02 12:43:08,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:43:08,533 INFO L93 Difference]: Finished difference Result 64469 states and 94461 transitions. [2019-10-02 12:43:08,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:43:08,534 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 231 [2019-10-02 12:43:08,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:43:08,724 INFO L225 Difference]: With dead ends: 64469 [2019-10-02 12:43:08,724 INFO L226 Difference]: Without dead ends: 38914 [2019-10-02 12:43:08,811 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:43:08,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38914 states. [2019-10-02 12:43:11,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38914 to 38714. [2019-10-02 12:43:11,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38714 states. [2019-10-02 12:43:11,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38714 states to 38714 states and 57611 transitions. [2019-10-02 12:43:11,998 INFO L78 Accepts]: Start accepts. Automaton has 38714 states and 57611 transitions. Word has length 231 [2019-10-02 12:43:11,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:43:11,999 INFO L475 AbstractCegarLoop]: Abstraction has 38714 states and 57611 transitions. [2019-10-02 12:43:11,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:43:11,999 INFO L276 IsEmpty]: Start isEmpty. Operand 38714 states and 57611 transitions. [2019-10-02 12:43:12,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-02 12:43:12,044 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:43:12,045 INFO L411 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] [2019-10-02 12:43:12,045 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:43:12,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:43:12,045 INFO L82 PathProgramCache]: Analyzing trace with hash -2101710236, now seen corresponding path program 1 times [2019-10-02 12:43:12,045 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:43:12,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:43:12,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:43:12,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:43:12,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:43:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:43:12,267 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:43:12,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:43:12,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:43:12,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:43:12,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:43:12,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:43:12,269 INFO L87 Difference]: Start difference. First operand 38714 states and 57611 transitions. Second operand 11 states. [2019-10-02 12:43:13,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:43:13,569 INFO L93 Difference]: Finished difference Result 64437 states and 94457 transitions. [2019-10-02 12:43:13,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:43:13,569 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 233 [2019-10-02 12:43:13,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:43:13,720 INFO L225 Difference]: With dead ends: 64437 [2019-10-02 12:43:13,720 INFO L226 Difference]: Without dead ends: 38914 [2019-10-02 12:43:13,788 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:43:13,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38914 states. [2019-10-02 12:43:14,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38914 to 38714. [2019-10-02 12:43:14,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38714 states. [2019-10-02 12:43:15,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38714 states to 38714 states and 57459 transitions. [2019-10-02 12:43:15,082 INFO L78 Accepts]: Start accepts. Automaton has 38714 states and 57459 transitions. Word has length 233 [2019-10-02 12:43:15,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:43:15,083 INFO L475 AbstractCegarLoop]: Abstraction has 38714 states and 57459 transitions. [2019-10-02 12:43:15,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:43:15,083 INFO L276 IsEmpty]: Start isEmpty. Operand 38714 states and 57459 transitions. [2019-10-02 12:43:15,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-10-02 12:43:15,134 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:43:15,134 INFO L411 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] [2019-10-02 12:43:15,134 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:43:15,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:43:15,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1859118097, now seen corresponding path program 1 times [2019-10-02 12:43:15,135 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:43:15,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:43:15,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:43:15,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:43:15,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:43:15,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:43:16,768 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:43:16,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:43:16,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:43:16,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:43:16,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:43:16,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:43:16,769 INFO L87 Difference]: Start difference. First operand 38714 states and 57459 transitions. Second operand 6 states. [2019-10-02 12:43:18,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:43:18,706 INFO L93 Difference]: Finished difference Result 102624 states and 151165 transitions. [2019-10-02 12:43:18,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:43:18,706 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 234 [2019-10-02 12:43:18,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:43:18,983 INFO L225 Difference]: With dead ends: 102624 [2019-10-02 12:43:18,983 INFO L226 Difference]: Without dead ends: 71335 [2019-10-02 12:43:19,067 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:43:19,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71335 states. [2019-10-02 12:43:21,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71335 to 70714. [2019-10-02 12:43:21,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70714 states. [2019-10-02 12:43:21,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70714 states to 70714 states and 105791 transitions. [2019-10-02 12:43:21,941 INFO L78 Accepts]: Start accepts. Automaton has 70714 states and 105791 transitions. Word has length 234 [2019-10-02 12:43:21,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:43:21,942 INFO L475 AbstractCegarLoop]: Abstraction has 70714 states and 105791 transitions. [2019-10-02 12:43:21,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:43:21,942 INFO L276 IsEmpty]: Start isEmpty. Operand 70714 states and 105791 transitions. [2019-10-02 12:43:22,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-10-02 12:43:22,041 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:43:22,042 INFO L411 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] [2019-10-02 12:43:22,042 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:43:22,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:43:22,043 INFO L82 PathProgramCache]: Analyzing trace with hash 733426365, now seen corresponding path program 1 times [2019-10-02 12:43:22,043 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:43:22,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:43:22,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:43:22,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:43:22,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:43:22,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:43:22,597 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 12:43:22,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:43:22,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:43:22,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:43:22,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:43:22,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:43:22,599 INFO L87 Difference]: Start difference. First operand 70714 states and 105791 transitions. Second operand 3 states. [2019-10-02 12:43:24,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:43:24,929 INFO L93 Difference]: Finished difference Result 156561 states and 239135 transitions. [2019-10-02 12:43:24,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:43:24,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 234 [2019-10-02 12:43:24,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:43:25,245 INFO L225 Difference]: With dead ends: 156561 [2019-10-02 12:43:25,246 INFO L226 Difference]: Without dead ends: 85924 [2019-10-02 12:43:25,416 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:43:25,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85924 states. [2019-10-02 12:43:31,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85924 to 85882. [2019-10-02 12:43:31,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85882 states. [2019-10-02 12:43:31,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85882 states to 85882 states and 133007 transitions. [2019-10-02 12:43:31,605 INFO L78 Accepts]: Start accepts. Automaton has 85882 states and 133007 transitions. Word has length 234 [2019-10-02 12:43:31,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:43:31,606 INFO L475 AbstractCegarLoop]: Abstraction has 85882 states and 133007 transitions. [2019-10-02 12:43:31,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:43:31,606 INFO L276 IsEmpty]: Start isEmpty. Operand 85882 states and 133007 transitions. [2019-10-02 12:43:31,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-10-02 12:43:31,801 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:43:31,802 INFO L411 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] [2019-10-02 12:43:31,802 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:43:31,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:43:31,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1715847602, now seen corresponding path program 1 times [2019-10-02 12:43:31,802 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:43:31,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:43:31,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:43:31,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:43:31,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:43:31,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:43:31,923 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 12:43:31,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:43:31,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:43:31,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:43:31,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:43:31,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:43:31,925 INFO L87 Difference]: Start difference. First operand 85882 states and 133007 transitions. Second operand 3 states. [2019-10-02 12:43:37,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:43:37,484 INFO L93 Difference]: Finished difference Result 200913 states and 318479 transitions. [2019-10-02 12:43:37,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:43:37,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-10-02 12:43:37,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:43:37,954 INFO L225 Difference]: With dead ends: 200913 [2019-10-02 12:43:37,954 INFO L226 Difference]: Without dead ends: 115108 [2019-10-02 12:43:38,131 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:43:38,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115108 states. [2019-10-02 12:43:42,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115108 to 115066. [2019-10-02 12:43:42,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115066 states. [2019-10-02 12:43:42,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115066 states to 115066 states and 184751 transitions. [2019-10-02 12:43:42,589 INFO L78 Accepts]: Start accepts. Automaton has 115066 states and 184751 transitions. Word has length 235 [2019-10-02 12:43:42,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:43:42,590 INFO L475 AbstractCegarLoop]: Abstraction has 115066 states and 184751 transitions. [2019-10-02 12:43:42,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:43:42,590 INFO L276 IsEmpty]: Start isEmpty. Operand 115066 states and 184751 transitions. [2019-10-02 12:43:46,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-10-02 12:43:46,258 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:43:46,258 INFO L411 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] [2019-10-02 12:43:46,258 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:43:46,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:43:46,258 INFO L82 PathProgramCache]: Analyzing trace with hash -633873795, now seen corresponding path program 1 times [2019-10-02 12:43:46,259 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:43:46,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:43:46,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:43:46,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:43:46,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:43:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:43:46,445 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:43:46,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:43:46,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:43:46,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:43:46,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:43:46,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:43:46,447 INFO L87 Difference]: Start difference. First operand 115066 states and 184751 transitions. Second operand 7 states. [2019-10-02 12:43:53,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:43:53,959 INFO L93 Difference]: Finished difference Result 250543 states and 395531 transitions. [2019-10-02 12:43:53,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:43:53,959 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 236 [2019-10-02 12:43:53,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:43:54,643 INFO L225 Difference]: With dead ends: 250543 [2019-10-02 12:43:54,643 INFO L226 Difference]: Without dead ends: 205992 [2019-10-02 12:43:54,793 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:43:54,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205992 states. [2019-10-02 12:44:07,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205992 to 205930. [2019-10-02 12:44:07,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205930 states. [2019-10-02 12:44:08,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205930 states to 205930 states and 325425 transitions. [2019-10-02 12:44:08,269 INFO L78 Accepts]: Start accepts. Automaton has 205930 states and 325425 transitions. Word has length 236 [2019-10-02 12:44:08,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:44:08,269 INFO L475 AbstractCegarLoop]: Abstraction has 205930 states and 325425 transitions. [2019-10-02 12:44:08,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:44:08,270 INFO L276 IsEmpty]: Start isEmpty. Operand 205930 states and 325425 transitions. [2019-10-02 12:44:08,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-10-02 12:44:08,545 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:44:08,545 INFO L411 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] [2019-10-02 12:44:08,545 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:44:08,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:44:08,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1644563522, now seen corresponding path program 1 times [2019-10-02 12:44:08,546 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:44:08,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:44:08,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:44:08,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:44:08,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:44:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:44:08,980 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:44:08,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:44:08,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-10-02 12:44:08,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 12:44:08,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 12:44:08,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-10-02 12:44:08,982 INFO L87 Difference]: Start difference. First operand 205930 states and 325425 transitions. Second operand 26 states. [2019-10-02 12:44:23,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:44:23,645 INFO L93 Difference]: Finished difference Result 363808 states and 573383 transitions. [2019-10-02 12:44:23,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 12:44:23,646 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 237 [2019-10-02 12:44:23,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:44:24,524 INFO L225 Difference]: With dead ends: 363808 [2019-10-02 12:44:24,524 INFO L226 Difference]: Without dead ends: 228361 [2019-10-02 12:44:24,900 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=1239, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 12:44:25,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228361 states. [2019-10-02 12:44:35,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228361 to 228118. [2019-10-02 12:44:35,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228118 states. [2019-10-02 12:44:36,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228118 states to 228118 states and 361375 transitions. [2019-10-02 12:44:36,120 INFO L78 Accepts]: Start accepts. Automaton has 228118 states and 361375 transitions. Word has length 237 [2019-10-02 12:44:36,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:44:36,121 INFO L475 AbstractCegarLoop]: Abstraction has 228118 states and 361375 transitions. [2019-10-02 12:44:36,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 12:44:36,121 INFO L276 IsEmpty]: Start isEmpty. Operand 228118 states and 361375 transitions. [2019-10-02 12:44:36,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-10-02 12:44:36,386 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:44:36,387 INFO L411 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] [2019-10-02 12:44:36,387 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:44:36,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:44:36,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1358475630, now seen corresponding path program 1 times [2019-10-02 12:44:36,387 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:44:36,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:44:36,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:44:36,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:44:36,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:44:36,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:44:36,561 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:44:36,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:44:36,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 12:44:36,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:44:36,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:44:36,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:44:36,563 INFO L87 Difference]: Start difference. First operand 228118 states and 361375 transitions. Second operand 10 states. [2019-10-02 12:44:46,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:44:46,864 INFO L93 Difference]: Finished difference Result 229465 states and 363393 transitions. [2019-10-02 12:44:46,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:44:46,864 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 241 [2019-10-02 12:44:46,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:44:47,788 INFO L225 Difference]: With dead ends: 229465 [2019-10-02 12:44:47,788 INFO L226 Difference]: Without dead ends: 229462 [2019-10-02 12:44:47,887 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:44:48,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229462 states. [2019-10-02 12:45:02,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229462 to 229462. [2019-10-02 12:45:02,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229462 states. [2019-10-02 12:45:03,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229462 states to 229462 states and 362949 transitions. [2019-10-02 12:45:03,779 INFO L78 Accepts]: Start accepts. Automaton has 229462 states and 362949 transitions. Word has length 241 [2019-10-02 12:45:03,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:45:03,779 INFO L475 AbstractCegarLoop]: Abstraction has 229462 states and 362949 transitions. [2019-10-02 12:45:03,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:45:03,780 INFO L276 IsEmpty]: Start isEmpty. Operand 229462 states and 362949 transitions. [2019-10-02 12:45:04,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-10-02 12:45:04,061 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:45:04,061 INFO L411 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] [2019-10-02 12:45:04,061 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:45:04,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:45:04,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1134480511, now seen corresponding path program 1 times [2019-10-02 12:45:04,062 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:45:04,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:45:04,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:04,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:45:04,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:04,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:45:04,199 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:45:04,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:45:04,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:45:04,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:45:04,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:45:04,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:45:04,200 INFO L87 Difference]: Start difference. First operand 229462 states and 362949 transitions. Second operand 5 states. [2019-10-02 12:45:18,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:45:18,924 INFO L93 Difference]: Finished difference Result 387393 states and 607499 transitions. [2019-10-02 12:45:18,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:45:18,924 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-10-02 12:45:18,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:45:20,250 INFO L225 Difference]: With dead ends: 387393 [2019-10-02 12:45:20,250 INFO L226 Difference]: Without dead ends: 234040 [2019-10-02 12:45:20,633 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:45:20,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234040 states. [2019-10-02 12:45:31,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234040 to 231670. [2019-10-02 12:45:31,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231670 states. [2019-10-02 12:45:33,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231670 states to 231670 states and 365187 transitions. [2019-10-02 12:45:33,213 INFO L78 Accepts]: Start accepts. Automaton has 231670 states and 365187 transitions. Word has length 246 [2019-10-02 12:45:33,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:45:33,213 INFO L475 AbstractCegarLoop]: Abstraction has 231670 states and 365187 transitions. [2019-10-02 12:45:33,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:45:33,213 INFO L276 IsEmpty]: Start isEmpty. Operand 231670 states and 365187 transitions. [2019-10-02 12:45:33,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-10-02 12:45:33,512 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:45:33,512 INFO L411 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] [2019-10-02 12:45:33,512 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:45:33,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:45:33,513 INFO L82 PathProgramCache]: Analyzing trace with hash -268420938, now seen corresponding path program 1 times [2019-10-02 12:45:33,513 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:45:33,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:45:33,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:33,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:45:33,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:33,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:45:33,665 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:45:33,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:45:33,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:45:33,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:45:33,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:45:33,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:45:33,668 INFO L87 Difference]: Start difference. First operand 231670 states and 365187 transitions. Second operand 6 states. [2019-10-02 12:45:57,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:45:57,100 INFO L93 Difference]: Finished difference Result 627354 states and 999652 transitions. [2019-10-02 12:45:57,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:45:57,101 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 251 [2019-10-02 12:45:57,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:46:00,058 INFO L225 Difference]: With dead ends: 627354 [2019-10-02 12:46:00,058 INFO L226 Difference]: Without dead ends: 467583 [2019-10-02 12:46:00,574 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:46:00,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467583 states. [2019-10-02 12:46:32,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467583 to 462606. [2019-10-02 12:46:32,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462606 states. [2019-10-02 12:46:35,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462606 states to 462606 states and 739941 transitions. [2019-10-02 12:46:35,065 INFO L78 Accepts]: Start accepts. Automaton has 462606 states and 739941 transitions. Word has length 251 [2019-10-02 12:46:35,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:46:35,066 INFO L475 AbstractCegarLoop]: Abstraction has 462606 states and 739941 transitions. [2019-10-02 12:46:35,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:46:35,066 INFO L276 IsEmpty]: Start isEmpty. Operand 462606 states and 739941 transitions. [2019-10-02 12:46:45,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-10-02 12:46:45,997 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:46:45,998 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2019-10-02 12:46:45,998 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:46:45,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:46:45,998 INFO L82 PathProgramCache]: Analyzing trace with hash -155862640, now seen corresponding path program 1 times [2019-10-02 12:46:45,998 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:46:45,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:46:46,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:46,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:46:46,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:46,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:46:46,174 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 12:46:46,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:46:46,174 INFO L224 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:46:46,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:46:46,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:46:46,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 3091 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 12:46:46,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:46:46,890 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:46:46,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:46:46,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2019-10-02 12:46:46,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:46:46,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:46:46,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:46:46,902 INFO L87 Difference]: Start difference. First operand 462606 states and 739941 transitions. Second operand 11 states. [2019-10-02 12:47:14,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:47:14,794 INFO L93 Difference]: Finished difference Result 1015118 states and 1629223 transitions. [2019-10-02 12:47:14,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 12:47:14,794 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 266 [2019-10-02 12:47:14,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:47:17,721 INFO L225 Difference]: With dead ends: 1015118 [2019-10-02 12:47:17,721 INFO L226 Difference]: Without dead ends: 546559 [2019-10-02 12:47:19,841 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2019-10-02 12:47:20,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546559 states. [2019-10-02 12:48:12,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546559 to 541200. [2019-10-02 12:48:12,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541200 states. [2019-10-02 12:48:16,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541200 states to 541200 states and 850164 transitions. [2019-10-02 12:48:16,900 INFO L78 Accepts]: Start accepts. Automaton has 541200 states and 850164 transitions. Word has length 266 [2019-10-02 12:48:16,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:48:16,901 INFO L475 AbstractCegarLoop]: Abstraction has 541200 states and 850164 transitions. [2019-10-02 12:48:16,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:48:16,901 INFO L276 IsEmpty]: Start isEmpty. Operand 541200 states and 850164 transitions. [2019-10-02 12:48:17,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-10-02 12:48:17,598 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:48:17,599 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:48:17,599 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:48:17,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:48:17,599 INFO L82 PathProgramCache]: Analyzing trace with hash 745813598, now seen corresponding path program 1 times [2019-10-02 12:48:17,599 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:48:17,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:48:17,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:48:17,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:48:17,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:48:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:48:19,174 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 12:48:19,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:48:19,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:48:19,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:48:19,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:48:19,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:48:19,175 INFO L87 Difference]: Start difference. First operand 541200 states and 850164 transitions. Second operand 8 states. [2019-10-02 12:49:38,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:49:38,212 INFO L93 Difference]: Finished difference Result 1635350 states and 2699880 transitions. [2019-10-02 12:49:38,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 12:49:38,212 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 299 [2019-10-02 12:49:38,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:49:45,437 INFO L225 Difference]: With dead ends: 1635350 [2019-10-02 12:49:45,437 INFO L226 Difference]: Without dead ends: 1094227 [2019-10-02 12:49:46,860 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:49:47,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094227 states.