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_spec27_product34.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 13:13:02,520 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 13:13:02,522 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 13:13:02,534 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 13:13:02,535 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 13:13:02,536 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 13:13:02,537 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 13:13:02,539 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 13:13:02,540 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 13:13:02,541 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 13:13:02,542 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 13:13:02,543 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 13:13:02,544 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 13:13:02,545 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 13:13:02,546 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 13:13:02,547 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 13:13:02,547 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 13:13:02,548 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 13:13:02,550 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 13:13:02,552 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 13:13:02,554 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 13:13:02,555 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 13:13:02,556 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 13:13:02,557 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 13:13:02,561 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 13:13:02,562 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 13:13:02,562 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 13:13:02,563 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 13:13:02,563 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 13:13:02,566 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 13:13:02,566 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 13:13:02,567 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 13:13:02,569 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 13:13:02,569 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 13:13:02,570 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 13:13:02,571 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 13:13:02,573 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 13:13:02,573 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 13:13:02,573 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 13:13:02,575 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 13:13:02,579 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 13:13:02,580 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 13:13:02,604 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 13:13:02,604 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 13:13:02,606 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 13:13:02,606 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 13:13:02,606 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 13:13:02,606 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 13:13:02,607 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 13:13:02,607 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 13:13:02,607 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 13:13:02,607 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 13:13:02,607 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 13:13:02,608 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 13:13:02,608 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 13:13:02,608 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 13:13:02,608 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 13:13:02,608 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 13:13:02,609 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 13:13:02,609 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 13:13:02,609 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 13:13:02,609 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 13:13:02,609 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 13:13:02,610 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 13:13:02,610 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 13:13:02,610 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 13:13:02,610 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 13:13:02,611 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 13:13:02,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 13:13:02,611 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 13:13:02,611 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 13:13:02,650 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 13:13:02,661 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 13:13:02,665 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 13:13:02,666 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 13:13:02,667 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 13:13:02,667 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec27_product34.cil.c [2019-10-02 13:13:02,749 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b7a7db7b/77635b91408b468d8c00f8320444e684/FLAG899add563 [2019-10-02 13:13:03,459 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 13:13:03,459 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec27_product34.cil.c [2019-10-02 13:13:03,482 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b7a7db7b/77635b91408b468d8c00f8320444e684/FLAG899add563 [2019-10-02 13:13:03,591 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b7a7db7b/77635b91408b468d8c00f8320444e684 [2019-10-02 13:13:03,600 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 13:13:03,602 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 13:13:03,602 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 13:13:03,603 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 13:13:03,606 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 13:13:03,607 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:13:03" (1/1) ... [2019-10-02 13:13:03,610 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26497d1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:13:03, skipping insertion in model container [2019-10-02 13:13:03,611 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:13:03" (1/1) ... [2019-10-02 13:13:03,617 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 13:13:03,710 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 13:13:04,573 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:13:04,589 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 13:13:04,717 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:13:04,838 INFO L192 MainTranslator]: Completed translation [2019-10-02 13:13:04,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:13:04 WrapperNode [2019-10-02 13:13:04,840 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 13:13:04,841 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 13:13:04,841 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 13:13:04,841 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 13:13:04,860 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:13:04" (1/1) ... [2019-10-02 13:13:04,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:13:04" (1/1) ... [2019-10-02 13:13:04,935 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:13:04" (1/1) ... [2019-10-02 13:13:04,936 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:13:04" (1/1) ... [2019-10-02 13:13:05,023 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:13:04" (1/1) ... [2019-10-02 13:13:05,062 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:13:04" (1/1) ... [2019-10-02 13:13:05,083 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:13:04" (1/1) ... [2019-10-02 13:13:05,102 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 13:13:05,102 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 13:13:05,103 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 13:13:05,103 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 13:13:05,104 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:13:04" (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 13:13:05,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 13:13:05,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 13:13:05,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 13:13:05,161 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 13:13:05,162 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 13:13:05,162 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 13:13:05,162 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 13:13:05,162 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 13:13:05,162 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 13:13:05,163 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 13:13:05,163 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 13:13:05,163 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 13:13:05,163 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 13:13:05,163 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 13:13:05,164 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 13:13:05,164 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 13:13:05,164 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 13:13:05,164 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 13:13:05,164 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 13:13:05,165 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 13:13:05,165 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 13:13:05,165 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 13:13:05,165 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 13:13:05,165 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 13:13:05,166 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 13:13:05,166 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 13:13:05,166 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 13:13:05,166 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 13:13:05,166 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 13:13:05,166 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 13:13:05,167 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 13:13:05,167 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 13:13:05,167 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 13:13:05,167 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AddressBook [2019-10-02 13:13:05,167 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Forward [2019-10-02 13:13:05,167 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 13:13:05,168 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 13:13:05,168 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 13:13:05,168 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 13:13:05,168 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 13:13:05,168 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 13:13:05,168 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 13:13:05,168 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 13:13:05,169 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 13:13:05,169 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 13:13:05,169 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 13:13:05,169 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 13:13:05,169 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 13:13:05,169 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 13:13:05,170 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 13:13:05,170 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 13:13:05,170 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 13:13:05,170 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 13:13:05,170 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 13:13:05,170 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 13:13:05,170 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 13:13:05,171 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 13:13:05,171 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 13:13:05,171 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 13:13:05,171 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 13:13:05,171 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 13:13:05,171 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 13:13:05,172 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 13:13:05,172 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 13:13:05,172 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 13:13:05,172 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 13:13:05,172 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 13:13:05,172 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 13:13:05,173 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 13:13:05,173 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2019-10-02 13:13:05,173 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AddressBook [2019-10-02 13:13:05,173 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 13:13:05,173 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 13:13:05,173 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-10-02 13:13:05,173 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-10-02 13:13:05,174 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-10-02 13:13:05,174 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 13:13:05,174 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 13:13:05,174 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 13:13:05,174 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 13:13:05,174 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 13:13:05,175 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 13:13:05,175 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 13:13:05,175 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 13:13:05,175 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 13:13:05,175 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-02 13:13:05,175 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-02 13:13:05,176 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-02 13:13:05,176 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-02 13:13:05,176 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__VerifyForward_spec__1 [2019-10-02 13:13:05,176 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 13:13:05,176 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 13:13:05,176 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 13:13:05,176 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 13:13:05,177 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 13:13:05,177 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 13:13:05,177 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 13:13:05,177 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 13:13:05,177 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 13:13:05,177 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 13:13:05,178 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 13:13:05,178 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 13:13:05,178 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 13:13:05,178 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 13:13:05,178 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 13:13:05,178 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 13:13:05,178 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 13:13:05,179 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 13:13:05,179 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 13:13:05,179 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 13:13:05,179 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 13:13:05,179 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 13:13:05,179 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 13:13:05,179 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 13:13:05,180 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 13:13:05,180 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 13:13:05,180 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-02 13:13:05,180 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-02 13:13:05,180 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 13:13:05,180 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 13:13:05,181 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 13:13:05,181 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 13:13:05,181 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 13:13:05,181 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 13:13:05,181 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 13:13:05,181 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 13:13:05,182 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 13:13:05,182 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 13:13:05,182 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 13:13:05,182 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 13:13:05,182 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 13:13:05,182 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 13:13:05,183 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 13:13:05,183 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 13:13:05,183 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 13:13:05,183 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 13:13:05,183 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 13:13:05,183 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 13:13:05,183 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 13:13:05,184 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 13:13:05,184 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 13:13:05,184 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 13:13:05,184 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 13:13:05,184 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 13:13:05,184 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 13:13:05,185 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 13:13:05,185 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 13:13:05,185 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 13:13:05,185 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 13:13:05,185 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 13:13:05,185 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 13:13:05,186 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 13:13:05,186 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 13:13:05,186 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 13:13:05,186 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 13:13:05,186 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 13:13:05,186 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 13:13:05,186 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 13:13:05,187 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 13:13:05,187 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 13:13:05,187 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 13:13:05,187 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 13:13:05,187 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 13:13:05,188 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 13:13:05,188 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 13:13:05,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 13:13:05,188 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AddressBook [2019-10-02 13:13:05,188 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Forward [2019-10-02 13:13:05,188 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 13:13:05,189 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 13:13:05,189 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 13:13:05,189 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 13:13:05,189 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 13:13:05,189 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-02 13:13:05,189 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 13:13:05,190 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-02 13:13:05,190 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 13:13:05,190 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 13:13:05,190 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 13:13:05,190 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 13:13:05,190 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 13:13:05,191 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 13:13:05,191 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 13:13:05,191 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 13:13:05,191 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 13:13:05,191 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 13:13:05,191 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 13:13:05,192 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 13:13:05,192 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 13:13:05,192 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 13:13:05,192 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 13:13:05,192 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 13:13:05,192 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 13:13:05,193 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 13:13:05,193 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 13:13:05,193 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 13:13:05,193 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 13:13:05,193 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 13:13:05,193 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 13:13:05,194 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 13:13:05,194 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 13:13:05,194 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 13:13:05,194 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 13:13:05,194 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 13:13:05,194 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 13:13:05,195 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 13:13:05,195 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 13:13:05,195 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 13:13:05,195 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 13:13:05,195 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-02 13:13:05,196 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-02 13:13:05,196 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-02 13:13:05,196 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-02 13:13:05,196 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 13:13:05,196 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2019-10-02 13:13:05,196 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AddressBook [2019-10-02 13:13:05,197 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__VerifyForward_spec__1 [2019-10-02 13:13:05,197 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-10-02 13:13:05,197 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-10-02 13:13:05,197 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-10-02 13:13:05,197 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 13:13:05,197 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 13:13:05,198 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 13:13:05,198 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 13:13:05,198 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 13:13:05,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 13:13:05,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 13:13:05,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 13:13:05,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 13:13:05,199 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 13:13:05,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 13:13:05,199 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 13:13:05,199 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 13:13:05,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 13:13:05,200 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 13:13:05,200 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 13:13:05,200 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 13:13:05,200 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 13:13:05,200 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 13:13:05,201 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 13:13:05,201 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 13:13:05,201 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 13:13:05,201 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 13:13:05,201 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 13:13:05,201 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 13:13:05,202 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 13:13:05,202 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 13:13:05,202 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 13:13:05,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 13:13:05,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 13:13:05,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 13:13:07,489 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 13:13:07,489 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 13:13:07,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:13:07 BoogieIcfgContainer [2019-10-02 13:13:07,491 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 13:13:07,493 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 13:13:07,493 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 13:13:07,496 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 13:13:07,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:13:03" (1/3) ... [2019-10-02 13:13:07,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18cf7773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:13:07, skipping insertion in model container [2019-10-02 13:13:07,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:13:04" (2/3) ... [2019-10-02 13:13:07,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18cf7773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:13:07, skipping insertion in model container [2019-10-02 13:13:07,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:13:07" (3/3) ... [2019-10-02 13:13:07,500 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec27_product34.cil.c [2019-10-02 13:13:07,512 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 13:13:07,523 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 13:13:07,541 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 13:13:07,584 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 13:13:07,588 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 13:13:07,589 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 13:13:07,589 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 13:13:07,590 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 13:13:07,597 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 13:13:07,597 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 13:13:07,597 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 13:13:07,597 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 13:13:07,643 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states. [2019-10-02 13:13:07,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-10-02 13:13:07,682 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:07,685 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:13:07,688 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:07,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:07,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1025683934, now seen corresponding path program 1 times [2019-10-02 13:13:07,697 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:07,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:07,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:07,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:07,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:08,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:08,417 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:13:08,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:08,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 13:13:08,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 13:13:08,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 13:13:08,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 13:13:08,439 INFO L87 Difference]: Start difference. First operand 653 states. Second operand 2 states. [2019-10-02 13:13:08,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:08,565 INFO L93 Difference]: Finished difference Result 992 states and 1342 transitions. [2019-10-02 13:13:08,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 13:13:08,569 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 220 [2019-10-02 13:13:08,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:08,611 INFO L225 Difference]: With dead ends: 992 [2019-10-02 13:13:08,611 INFO L226 Difference]: Without dead ends: 624 [2019-10-02 13:13:08,625 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 13:13:08,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2019-10-02 13:13:08,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 624. [2019-10-02 13:13:08,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2019-10-02 13:13:08,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 847 transitions. [2019-10-02 13:13:08,757 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 847 transitions. Word has length 220 [2019-10-02 13:13:08,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:08,759 INFO L475 AbstractCegarLoop]: Abstraction has 624 states and 847 transitions. [2019-10-02 13:13:08,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 13:13:08,760 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 847 transitions. [2019-10-02 13:13:08,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-10-02 13:13:08,767 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:08,767 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:13:08,767 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:08,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:08,768 INFO L82 PathProgramCache]: Analyzing trace with hash 336824807, now seen corresponding path program 1 times [2019-10-02 13:13:08,768 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:08,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:08,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:08,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:08,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:08,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:09,085 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:13:09,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:09,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:13:09,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:13:09,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:13:09,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:13:09,095 INFO L87 Difference]: Start difference. First operand 624 states and 847 transitions. Second operand 3 states. [2019-10-02 13:13:09,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:09,187 INFO L93 Difference]: Finished difference Result 975 states and 1302 transitions. [2019-10-02 13:13:09,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:13:09,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 221 [2019-10-02 13:13:09,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:09,194 INFO L225 Difference]: With dead ends: 975 [2019-10-02 13:13:09,194 INFO L226 Difference]: Without dead ends: 627 [2019-10-02 13:13:09,196 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 13:13:09,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-10-02 13:13:09,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 626. [2019-10-02 13:13:09,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 13:13:09,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 849 transitions. [2019-10-02 13:13:09,251 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 849 transitions. Word has length 221 [2019-10-02 13:13:09,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:09,252 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 849 transitions. [2019-10-02 13:13:09,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:13:09,252 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 849 transitions. [2019-10-02 13:13:09,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-10-02 13:13:09,258 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:09,258 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 13:13:09,258 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:09,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:09,259 INFO L82 PathProgramCache]: Analyzing trace with hash 982299259, now seen corresponding path program 1 times [2019-10-02 13:13:09,259 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:09,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:09,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:09,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:09,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:09,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:09,532 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:13:09,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:09,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:13:09,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:13:09,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:13:09,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:13:09,538 INFO L87 Difference]: Start difference. First operand 626 states and 849 transitions. Second operand 3 states. [2019-10-02 13:13:09,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:09,606 INFO L93 Difference]: Finished difference Result 1230 states and 1699 transitions. [2019-10-02 13:13:09,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:13:09,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2019-10-02 13:13:09,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:09,616 INFO L225 Difference]: With dead ends: 1230 [2019-10-02 13:13:09,617 INFO L226 Difference]: Without dead ends: 669 [2019-10-02 13:13:09,620 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 13:13:09,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2019-10-02 13:13:09,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 668. [2019-10-02 13:13:09,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2019-10-02 13:13:09,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 921 transitions. [2019-10-02 13:13:09,679 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 921 transitions. Word has length 227 [2019-10-02 13:13:09,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:09,682 INFO L475 AbstractCegarLoop]: Abstraction has 668 states and 921 transitions. [2019-10-02 13:13:09,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:13:09,682 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 921 transitions. [2019-10-02 13:13:09,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-02 13:13:09,690 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:09,690 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 13:13:09,691 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:09,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:09,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1381931188, now seen corresponding path program 1 times [2019-10-02 13:13:09,692 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:09,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:09,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:09,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:09,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:09,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:10,395 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:13:10,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:13:10,398 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 13:13:10,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:11,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:11,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 3179 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:13:11,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:13:11,554 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 13:13:11,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:13:11,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [19] total 26 [2019-10-02 13:13:11,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 13:13:11,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 13:13:11,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2019-10-02 13:13:11,570 INFO L87 Difference]: Start difference. First operand 668 states and 921 transitions. Second operand 26 states. [2019-10-02 13:13:21,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:21,681 INFO L93 Difference]: Finished difference Result 2685 states and 3771 transitions. [2019-10-02 13:13:21,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-02 13:13:21,681 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 228 [2019-10-02 13:13:21,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:21,696 INFO L225 Difference]: With dead ends: 2685 [2019-10-02 13:13:21,696 INFO L226 Difference]: Without dead ends: 2053 [2019-10-02 13:13:21,701 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1348 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=528, Invalid=5172, Unknown=0, NotChecked=0, Total=5700 [2019-10-02 13:13:21,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2053 states. [2019-10-02 13:13:21,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 2016. [2019-10-02 13:13:21,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2016 states. [2019-10-02 13:13:21,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2016 states to 2016 states and 2806 transitions. [2019-10-02 13:13:21,822 INFO L78 Accepts]: Start accepts. Automaton has 2016 states and 2806 transitions. Word has length 228 [2019-10-02 13:13:21,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:21,823 INFO L475 AbstractCegarLoop]: Abstraction has 2016 states and 2806 transitions. [2019-10-02 13:13:21,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 13:13:21,823 INFO L276 IsEmpty]: Start isEmpty. Operand 2016 states and 2806 transitions. [2019-10-02 13:13:21,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-02 13:13:21,831 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:21,832 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] [2019-10-02 13:13:21,832 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:21,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:21,832 INFO L82 PathProgramCache]: Analyzing trace with hash 557127087, now seen corresponding path program 1 times [2019-10-02 13:13:21,833 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:21,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:21,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:21,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:21,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:22,202 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 13:13:22,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:22,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-02 13:13:22,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 13:13:22,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 13:13:22,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:13:22,204 INFO L87 Difference]: Start difference. First operand 2016 states and 2806 transitions. Second operand 18 states. [2019-10-02 13:13:22,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:22,782 INFO L93 Difference]: Finished difference Result 3605 states and 5022 transitions. [2019-10-02 13:13:22,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 13:13:22,783 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 230 [2019-10-02 13:13:22,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:22,803 INFO L225 Difference]: With dead ends: 3605 [2019-10-02 13:13:22,803 INFO L226 Difference]: Without dead ends: 2198 [2019-10-02 13:13:22,811 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2019-10-02 13:13:22,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2198 states. [2019-10-02 13:13:22,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2198 to 2198. [2019-10-02 13:13:22,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2198 states. [2019-10-02 13:13:22,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2198 states to 2198 states and 3075 transitions. [2019-10-02 13:13:22,949 INFO L78 Accepts]: Start accepts. Automaton has 2198 states and 3075 transitions. Word has length 230 [2019-10-02 13:13:22,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:22,950 INFO L475 AbstractCegarLoop]: Abstraction has 2198 states and 3075 transitions. [2019-10-02 13:13:22,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 13:13:22,951 INFO L276 IsEmpty]: Start isEmpty. Operand 2198 states and 3075 transitions. [2019-10-02 13:13:22,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-02 13:13:22,958 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:22,958 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] [2019-10-02 13:13:22,959 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:22,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:22,959 INFO L82 PathProgramCache]: Analyzing trace with hash -482918734, now seen corresponding path program 1 times [2019-10-02 13:13:22,959 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:22,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:22,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:22,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:22,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:23,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:23,324 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:13:23,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:13:23,325 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 13:13:23,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:23,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 3181 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:13:23,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:13:24,189 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 13:13:24,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:13:24,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 20 [2019-10-02 13:13:24,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 13:13:24,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 13:13:24,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2019-10-02 13:13:24,204 INFO L87 Difference]: Start difference. First operand 2198 states and 3075 transitions. Second operand 20 states. [2019-10-02 13:13:32,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:32,520 INFO L93 Difference]: Finished difference Result 4449 states and 6338 transitions. [2019-10-02 13:13:32,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-02 13:13:32,521 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 230 [2019-10-02 13:13:32,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:32,537 INFO L225 Difference]: With dead ends: 4449 [2019-10-02 13:13:32,538 INFO L226 Difference]: Without dead ends: 2302 [2019-10-02 13:13:32,547 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1087 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=453, Invalid=3969, Unknown=0, NotChecked=0, Total=4422 [2019-10-02 13:13:32,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2302 states. [2019-10-02 13:13:32,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2302 to 2272. [2019-10-02 13:13:32,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2272 states. [2019-10-02 13:13:32,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 2272 states and 3197 transitions. [2019-10-02 13:13:32,676 INFO L78 Accepts]: Start accepts. Automaton has 2272 states and 3197 transitions. Word has length 230 [2019-10-02 13:13:32,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:32,676 INFO L475 AbstractCegarLoop]: Abstraction has 2272 states and 3197 transitions. [2019-10-02 13:13:32,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 13:13:32,676 INFO L276 IsEmpty]: Start isEmpty. Operand 2272 states and 3197 transitions. [2019-10-02 13:13:32,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-02 13:13:32,695 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:32,696 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:13:32,696 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:32,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:32,696 INFO L82 PathProgramCache]: Analyzing trace with hash -970890100, now seen corresponding path program 1 times [2019-10-02 13:13:32,697 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:32,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:32,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:32,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:32,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:32,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:32,977 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:13:32,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:13:32,978 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:13:33,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:33,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:33,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 3182 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:13:33,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:13:33,758 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 13:13:33,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:13:33,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2019-10-02 13:13:33,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 13:13:33,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 13:13:33,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-02 13:13:33,769 INFO L87 Difference]: Start difference. First operand 2272 states and 3197 transitions. Second operand 12 states. [2019-10-02 13:13:38,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:38,609 INFO L93 Difference]: Finished difference Result 7202 states and 10333 transitions. [2019-10-02 13:13:38,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 13:13:38,610 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 231 [2019-10-02 13:13:38,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:38,643 INFO L225 Difference]: With dead ends: 7202 [2019-10-02 13:13:38,643 INFO L226 Difference]: Without dead ends: 4991 [2019-10-02 13:13:38,655 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2019-10-02 13:13:38,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4991 states. [2019-10-02 13:13:38,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4991 to 4973. [2019-10-02 13:13:38,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4973 states. [2019-10-02 13:13:38,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4973 states to 4973 states and 7093 transitions. [2019-10-02 13:13:38,966 INFO L78 Accepts]: Start accepts. Automaton has 4973 states and 7093 transitions. Word has length 231 [2019-10-02 13:13:38,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:38,967 INFO L475 AbstractCegarLoop]: Abstraction has 4973 states and 7093 transitions. [2019-10-02 13:13:38,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 13:13:38,968 INFO L276 IsEmpty]: Start isEmpty. Operand 4973 states and 7093 transitions. [2019-10-02 13:13:38,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-10-02 13:13:38,989 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:38,990 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:13:38,991 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:38,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:38,991 INFO L82 PathProgramCache]: Analyzing trace with hash 858920462, now seen corresponding path program 1 times [2019-10-02 13:13:38,991 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:38,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:38,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:38,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:39,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:39,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:39,470 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 13:13:39,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:39,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 13:13:39,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 13:13:39,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 13:13:39,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:13:39,472 INFO L87 Difference]: Start difference. First operand 4973 states and 7093 transitions. Second operand 7 states. [2019-10-02 13:13:41,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:41,846 INFO L93 Difference]: Finished difference Result 17022 states and 26801 transitions. [2019-10-02 13:13:41,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 13:13:41,853 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 232 [2019-10-02 13:13:41,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:41,955 INFO L225 Difference]: With dead ends: 17022 [2019-10-02 13:13:41,955 INFO L226 Difference]: Without dead ends: 13059 [2019-10-02 13:13:41,989 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 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 13:13:42,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13059 states. [2019-10-02 13:13:43,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13059 to 13053. [2019-10-02 13:13:43,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13053 states. [2019-10-02 13:13:43,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13053 states to 13053 states and 20201 transitions. [2019-10-02 13:13:43,291 INFO L78 Accepts]: Start accepts. Automaton has 13053 states and 20201 transitions. Word has length 232 [2019-10-02 13:13:43,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:43,292 INFO L475 AbstractCegarLoop]: Abstraction has 13053 states and 20201 transitions. [2019-10-02 13:13:43,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 13:13:43,292 INFO L276 IsEmpty]: Start isEmpty. Operand 13053 states and 20201 transitions. [2019-10-02 13:13:43,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-02 13:13:43,307 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:43,308 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:13:43,308 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:43,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:43,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1825549894, now seen corresponding path program 1 times [2019-10-02 13:13:43,309 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:43,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:43,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:43,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:43,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:43,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:43,817 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 13:13:43,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:43,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-10-02 13:13:43,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 13:13:43,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 13:13:43,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-10-02 13:13:43,819 INFO L87 Difference]: Start difference. First operand 13053 states and 20201 transitions. Second operand 26 states. [2019-10-02 13:13:44,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:44,999 INFO L93 Difference]: Finished difference Result 25316 states and 40029 transitions. [2019-10-02 13:13:44,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 13:13:44,999 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 233 [2019-10-02 13:13:45,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:45,099 INFO L225 Difference]: With dead ends: 25316 [2019-10-02 13:13:45,099 INFO L226 Difference]: Without dead ends: 13273 [2019-10-02 13:13:45,317 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 13:13:45,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13273 states. [2019-10-02 13:13:45,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13273 to 13253. [2019-10-02 13:13:45,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13253 states. [2019-10-02 13:13:45,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13253 states to 13253 states and 20437 transitions. [2019-10-02 13:13:45,941 INFO L78 Accepts]: Start accepts. Automaton has 13253 states and 20437 transitions. Word has length 233 [2019-10-02 13:13:45,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:45,942 INFO L475 AbstractCegarLoop]: Abstraction has 13253 states and 20437 transitions. [2019-10-02 13:13:45,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 13:13:45,943 INFO L276 IsEmpty]: Start isEmpty. Operand 13253 states and 20437 transitions. [2019-10-02 13:13:45,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-10-02 13:13:45,957 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:45,958 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:13:45,958 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:45,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:45,958 INFO L82 PathProgramCache]: Analyzing trace with hash 132402086, now seen corresponding path program 1 times [2019-10-02 13:13:45,959 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:45,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:45,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:45,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:45,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:46,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:46,194 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 13:13:46,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:46,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 13:13:46,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 13:13:46,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 13:13:46,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 13:13:46,197 INFO L87 Difference]: Start difference. First operand 13253 states and 20437 transitions. Second operand 10 states. [2019-10-02 13:13:46,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:46,590 INFO L93 Difference]: Finished difference Result 25706 states and 41178 transitions. [2019-10-02 13:13:46,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 13:13:46,591 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 237 [2019-10-02 13:13:46,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:46,671 INFO L225 Difference]: With dead ends: 25706 [2019-10-02 13:13:46,672 INFO L226 Difference]: Without dead ends: 13853 [2019-10-02 13:13:46,710 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 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 13:13:46,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13853 states. [2019-10-02 13:13:48,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13853 to 13373. [2019-10-02 13:13:48,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13373 states. [2019-10-02 13:13:48,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13373 states to 13373 states and 20577 transitions. [2019-10-02 13:13:48,164 INFO L78 Accepts]: Start accepts. Automaton has 13373 states and 20577 transitions. Word has length 237 [2019-10-02 13:13:48,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:48,166 INFO L475 AbstractCegarLoop]: Abstraction has 13373 states and 20577 transitions. [2019-10-02 13:13:48,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 13:13:48,166 INFO L276 IsEmpty]: Start isEmpty. Operand 13373 states and 20577 transitions. [2019-10-02 13:13:48,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-10-02 13:13:48,182 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:48,183 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:13:48,183 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:48,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:48,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1539036152, now seen corresponding path program 1 times [2019-10-02 13:13:48,184 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:48,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:48,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:48,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:48,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:48,348 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:13:48,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:13:48,349 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:13:48,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:48,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:48,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 3225 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:13:48,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:13:49,093 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 13:13:49,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:13:49,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2019-10-02 13:13:49,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 13:13:49,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 13:13:49,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-02 13:13:49,113 INFO L87 Difference]: Start difference. First operand 13373 states and 20577 transitions. Second operand 12 states. [2019-10-02 13:13:51,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:51,711 INFO L93 Difference]: Finished difference Result 27068 states and 42691 transitions. [2019-10-02 13:13:51,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 13:13:51,713 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 242 [2019-10-02 13:13:51,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:51,789 INFO L225 Difference]: With dead ends: 27068 [2019-10-02 13:13:51,789 INFO L226 Difference]: Without dead ends: 13770 [2019-10-02 13:13:51,830 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:13:51,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13770 states. [2019-10-02 13:13:52,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13770 to 13573. [2019-10-02 13:13:52,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13573 states. [2019-10-02 13:13:52,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13573 states to 13573 states and 20885 transitions. [2019-10-02 13:13:52,525 INFO L78 Accepts]: Start accepts. Automaton has 13573 states and 20885 transitions. Word has length 242 [2019-10-02 13:13:52,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:52,526 INFO L475 AbstractCegarLoop]: Abstraction has 13573 states and 20885 transitions. [2019-10-02 13:13:52,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 13:13:52,526 INFO L276 IsEmpty]: Start isEmpty. Operand 13573 states and 20885 transitions. [2019-10-02 13:13:52,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-10-02 13:13:52,543 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:52,544 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 13:13:52,544 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:52,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:52,544 INFO L82 PathProgramCache]: Analyzing trace with hash 378753396, now seen corresponding path program 1 times [2019-10-02 13:13:52,545 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:52,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:52,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:52,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:52,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:52,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:52,799 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 13:13:52,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:13:52,799 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:13:52,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:53,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:53,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 3227 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:13:53,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:13:53,754 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 13:13:53,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:13:53,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 18 [2019-10-02 13:13:53,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 13:13:53,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 13:13:53,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:13:53,764 INFO L87 Difference]: Start difference. First operand 13573 states and 20885 transitions. Second operand 18 states. [2019-10-02 13:13:56,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:56,313 INFO L93 Difference]: Finished difference Result 27094 states and 42034 transitions. [2019-10-02 13:13:56,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 13:13:56,314 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 243 [2019-10-02 13:13:56,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:56,389 INFO L225 Difference]: With dead ends: 27094 [2019-10-02 13:13:56,389 INFO L226 Difference]: Without dead ends: 13601 [2019-10-02 13:13:56,431 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=917, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 13:13:56,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13601 states. [2019-10-02 13:13:56,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13601 to 13561. [2019-10-02 13:13:56,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13561 states. [2019-10-02 13:13:57,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13561 states to 13561 states and 20876 transitions. [2019-10-02 13:13:57,928 INFO L78 Accepts]: Start accepts. Automaton has 13561 states and 20876 transitions. Word has length 243 [2019-10-02 13:13:57,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:57,929 INFO L475 AbstractCegarLoop]: Abstraction has 13561 states and 20876 transitions. [2019-10-02 13:13:57,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 13:13:57,929 INFO L276 IsEmpty]: Start isEmpty. Operand 13561 states and 20876 transitions. [2019-10-02 13:13:57,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-10-02 13:13:57,943 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:57,943 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:13:57,944 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:57,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:57,944 INFO L82 PathProgramCache]: Analyzing trace with hash -906149942, now seen corresponding path program 1 times [2019-10-02 13:13:57,945 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:57,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:57,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:57,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:57,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:58,128 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-10-02 13:13:58,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:13:58,128 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:13:58,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:58,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:58,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 3229 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:13:58,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:13:58,832 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 13:13:58,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:13:58,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2019-10-02 13:13:58,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 13:13:58,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 13:13:58,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 13:13:58,847 INFO L87 Difference]: Start difference. First operand 13561 states and 20876 transitions. Second operand 11 states. [2019-10-02 13:14:01,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:14:01,978 INFO L93 Difference]: Finished difference Result 40757 states and 63922 transitions. [2019-10-02 13:14:01,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 13:14:01,978 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 245 [2019-10-02 13:14:01,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:14:02,101 INFO L225 Difference]: With dead ends: 40757 [2019-10-02 13:14:02,101 INFO L226 Difference]: Without dead ends: 27276 [2019-10-02 13:14:02,146 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2019-10-02 13:14:02,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27276 states. [2019-10-02 13:14:03,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27276 to 26850. [2019-10-02 13:14:03,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26850 states. [2019-10-02 13:14:03,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26850 states to 26850 states and 41286 transitions. [2019-10-02 13:14:03,142 INFO L78 Accepts]: Start accepts. Automaton has 26850 states and 41286 transitions. Word has length 245 [2019-10-02 13:14:03,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:14:03,142 INFO L475 AbstractCegarLoop]: Abstraction has 26850 states and 41286 transitions. [2019-10-02 13:14:03,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 13:14:03,143 INFO L276 IsEmpty]: Start isEmpty. Operand 26850 states and 41286 transitions. [2019-10-02 13:14:03,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-10-02 13:14:03,171 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:14:03,172 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:14:03,172 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:14:03,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:14:03,173 INFO L82 PathProgramCache]: Analyzing trace with hash 903015045, now seen corresponding path program 1 times [2019-10-02 13:14:03,173 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:14:03,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:14:03,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:14:03,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:14:03,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:14:03,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:14:03,364 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-02 13:14:03,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:14:03,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 13:14:03,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 13:14:03,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 13:14:03,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:14:03,366 INFO L87 Difference]: Start difference. First operand 26850 states and 41286 transitions. Second operand 7 states. [2019-10-02 13:14:08,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:14:08,773 INFO L93 Difference]: Finished difference Result 79364 states and 132768 transitions. [2019-10-02 13:14:08,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 13:14:08,774 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 247 [2019-10-02 13:14:08,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:14:08,970 INFO L225 Difference]: With dead ends: 79364 [2019-10-02 13:14:08,970 INFO L226 Difference]: Without dead ends: 54447 [2019-10-02 13:14:09,028 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:14:09,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54447 states. [2019-10-02 13:14:12,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54447 to 53940. [2019-10-02 13:14:12,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53940 states. [2019-10-02 13:14:12,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53940 states to 53940 states and 89472 transitions. [2019-10-02 13:14:12,857 INFO L78 Accepts]: Start accepts. Automaton has 53940 states and 89472 transitions. Word has length 247 [2019-10-02 13:14:12,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:14:12,858 INFO L475 AbstractCegarLoop]: Abstraction has 53940 states and 89472 transitions. [2019-10-02 13:14:12,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 13:14:12,858 INFO L276 IsEmpty]: Start isEmpty. Operand 53940 states and 89472 transitions. [2019-10-02 13:14:12,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-10-02 13:14:12,880 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:14:12,880 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:14:12,880 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:14:12,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:14:12,881 INFO L82 PathProgramCache]: Analyzing trace with hash 942603229, now seen corresponding path program 1 times [2019-10-02 13:14:12,881 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:14:12,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:14:12,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:14:12,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:14:12,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:14:12,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:14:13,427 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-02 13:14:13,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:14:13,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2019-10-02 13:14:13,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-02 13:14:13,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-02 13:14:13,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-10-02 13:14:13,429 INFO L87 Difference]: Start difference. First operand 53940 states and 89472 transitions. Second operand 30 states. [2019-10-02 13:14:16,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:14:16,216 INFO L93 Difference]: Finished difference Result 108340 states and 183887 transitions. [2019-10-02 13:14:16,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-02 13:14:16,217 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 248 [2019-10-02 13:14:16,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:14:16,474 INFO L225 Difference]: With dead ends: 108340 [2019-10-02 13:14:16,474 INFO L226 Difference]: Without dead ends: 56333 [2019-10-02 13:14:16,588 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=109, Invalid=1697, Unknown=0, NotChecked=0, Total=1806 [2019-10-02 13:14:16,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56333 states. [2019-10-02 13:14:20,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56333 to 56252. [2019-10-02 13:14:20,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56252 states. [2019-10-02 13:14:21,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56252 states to 56252 states and 92540 transitions. [2019-10-02 13:14:21,099 INFO L78 Accepts]: Start accepts. Automaton has 56252 states and 92540 transitions. Word has length 248 [2019-10-02 13:14:21,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:14:21,100 INFO L475 AbstractCegarLoop]: Abstraction has 56252 states and 92540 transitions. [2019-10-02 13:14:21,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-02 13:14:21,101 INFO L276 IsEmpty]: Start isEmpty. Operand 56252 states and 92540 transitions. [2019-10-02 13:14:21,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-10-02 13:14:21,123 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:14:21,123 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:14:21,123 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:14:21,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:14:21,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1467293855, now seen corresponding path program 1 times [2019-10-02 13:14:21,124 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:14:21,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:14:21,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:14:21,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:14:21,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:14:21,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:14:21,344 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-02 13:14:21,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:14:21,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:14:21,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:14:21,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:14:21,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:14:21,346 INFO L87 Difference]: Start difference. First operand 56252 states and 92540 transitions. Second operand 8 states. [2019-10-02 13:14:35,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:14:35,851 INFO L93 Difference]: Finished difference Result 225137 states and 420208 transitions. [2019-10-02 13:14:35,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 13:14:35,851 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 279 [2019-10-02 13:14:35,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:14:36,608 INFO L225 Difference]: With dead ends: 225137 [2019-10-02 13:14:36,608 INFO L226 Difference]: Without dead ends: 170818 [2019-10-02 13:14:36,795 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-10-02 13:14:36,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170818 states. [2019-10-02 13:14:42,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170818 to 170572. [2019-10-02 13:14:42,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170572 states. [2019-10-02 13:14:43,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170572 states to 170572 states and 306012 transitions. [2019-10-02 13:14:43,944 INFO L78 Accepts]: Start accepts. Automaton has 170572 states and 306012 transitions. Word has length 279 [2019-10-02 13:14:43,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:14:43,945 INFO L475 AbstractCegarLoop]: Abstraction has 170572 states and 306012 transitions. [2019-10-02 13:14:43,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:14:43,946 INFO L276 IsEmpty]: Start isEmpty. Operand 170572 states and 306012 transitions. [2019-10-02 13:14:44,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-10-02 13:14:44,003 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:14:44,003 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:14:44,003 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:14:44,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:14:44,004 INFO L82 PathProgramCache]: Analyzing trace with hash -482687476, now seen corresponding path program 1 times [2019-10-02 13:14:44,004 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:14:44,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:14:44,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:14:44,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:14:44,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:14:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:14:44,457 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-02 13:14:44,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:14:44,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-10-02 13:14:44,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 13:14:44,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 13:14:44,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-10-02 13:14:44,459 INFO L87 Difference]: Start difference. First operand 170572 states and 306012 transitions. Second operand 24 states. [2019-10-02 13:14:53,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:14:53,960 INFO L93 Difference]: Finished difference Result 323105 states and 577536 transitions. [2019-10-02 13:14:53,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 13:14:53,961 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 280 [2019-10-02 13:14:53,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:14:55,623 INFO L225 Difference]: With dead ends: 323105 [2019-10-02 13:14:55,623 INFO L226 Difference]: Without dead ends: 158416 [2019-10-02 13:14:55,950 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 13:14:56,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158416 states. [2019-10-02 13:15:07,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158416 to 156285. [2019-10-02 13:15:07,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156285 states. [2019-10-02 13:15:08,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156285 states to 156285 states and 269111 transitions. [2019-10-02 13:15:08,605 INFO L78 Accepts]: Start accepts. Automaton has 156285 states and 269111 transitions. Word has length 280 [2019-10-02 13:15:08,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:15:08,605 INFO L475 AbstractCegarLoop]: Abstraction has 156285 states and 269111 transitions. [2019-10-02 13:15:08,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 13:15:08,605 INFO L276 IsEmpty]: Start isEmpty. Operand 156285 states and 269111 transitions. [2019-10-02 13:15:08,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-10-02 13:15:08,662 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:15:08,662 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:15:08,662 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:15:08,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:15:08,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1625529213, now seen corresponding path program 1 times [2019-10-02 13:15:08,663 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:15:08,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:15:08,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:15:08,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:15:08,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:15:08,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:15:09,745 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-02 13:15:09,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:15:09,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:15:09,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:15:09,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:15:09,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:15:09,749 INFO L87 Difference]: Start difference. First operand 156285 states and 269111 transitions. Second operand 8 states. [2019-10-02 13:15:24,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:15:24,917 INFO L93 Difference]: Finished difference Result 471174 states and 853540 transitions. [2019-10-02 13:15:24,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 13:15:24,917 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 289 [2019-10-02 13:15:24,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:15:26,657 INFO L225 Difference]: With dead ends: 471174 [2019-10-02 13:15:26,657 INFO L226 Difference]: Without dead ends: 323669 [2019-10-02 13:15:27,092 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:15:27,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323669 states. [2019-10-02 13:15:49,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323669 to 323030. [2019-10-02 13:15:49,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323030 states. [2019-10-02 13:15:50,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323030 states to 323030 states and 580486 transitions. [2019-10-02 13:15:50,988 INFO L78 Accepts]: Start accepts. Automaton has 323030 states and 580486 transitions. Word has length 289 [2019-10-02 13:15:50,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:15:50,989 INFO L475 AbstractCegarLoop]: Abstraction has 323030 states and 580486 transitions. [2019-10-02 13:15:50,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:15:50,989 INFO L276 IsEmpty]: Start isEmpty. Operand 323030 states and 580486 transitions. [2019-10-02 13:15:51,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-10-02 13:15:51,081 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:15:51,081 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:15:51,081 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:15:51,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:15:51,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1417574061, now seen corresponding path program 1 times [2019-10-02 13:15:51,082 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:15:51,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:15:51,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:15:51,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:15:51,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:15:51,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:15:51,407 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-10-02 13:15:51,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:15:51,407 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:15:59,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:16:00,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:16:00,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 3401 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 13:16:00,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:16:00,250 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-02 13:16:00,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:16:00,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 4] total 17 [2019-10-02 13:16:00,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 13:16:00,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 13:16:00,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2019-10-02 13:16:00,259 INFO L87 Difference]: Start difference. First operand 323030 states and 580486 transitions. Second operand 17 states. [2019-10-02 13:16:24,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:16:24,437 INFO L93 Difference]: Finished difference Result 651127 states and 1247619 transitions. [2019-10-02 13:16:24,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-10-02 13:16:24,437 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 297 [2019-10-02 13:16:24,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:16:27,076 INFO L225 Difference]: With dead ends: 651127 [2019-10-02 13:16:27,076 INFO L226 Difference]: Without dead ends: 329730 [2019-10-02 13:16:27,916 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=254, Invalid=2398, Unknown=0, NotChecked=0, Total=2652 [2019-10-02 13:16:28,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329730 states. [2019-10-02 13:16:54,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329730 to 323122. [2019-10-02 13:16:54,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323122 states. [2019-10-02 13:16:56,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323122 states to 323122 states and 580634 transitions. [2019-10-02 13:16:56,169 INFO L78 Accepts]: Start accepts. Automaton has 323122 states and 580634 transitions. Word has length 297 [2019-10-02 13:16:56,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:16:56,169 INFO L475 AbstractCegarLoop]: Abstraction has 323122 states and 580634 transitions. [2019-10-02 13:16:56,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 13:16:56,169 INFO L276 IsEmpty]: Start isEmpty. Operand 323122 states and 580634 transitions. [2019-10-02 13:16:56,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-10-02 13:16:56,283 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:16:56,283 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:16:56,283 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:16:56,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:16:56,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1726306325, now seen corresponding path program 1 times [2019-10-02 13:16:56,284 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:16:56,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:16:56,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:16:56,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:16:56,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:16:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:16:58,161 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-02 13:16:58,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:16:58,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:16:58,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:16:58,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:16:58,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:16:58,163 INFO L87 Difference]: Start difference. First operand 323122 states and 580634 transitions. Second operand 3 states. [2019-10-02 13:17:26,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:17:26,090 INFO L93 Difference]: Finished difference Result 646649 states and 1162126 transitions. [2019-10-02 13:17:26,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:17:26,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 296 [2019-10-02 13:17:26,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:17:27,912 INFO L225 Difference]: With dead ends: 646649 [2019-10-02 13:17:27,913 INFO L226 Difference]: Without dead ends: 323640 [2019-10-02 13:17:29,205 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 13:17:29,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323640 states. [2019-10-02 13:17:47,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323640 to 323634. [2019-10-02 13:17:47,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323634 states. [2019-10-02 13:17:48,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323634 states to 323634 states and 581607 transitions. [2019-10-02 13:17:48,827 INFO L78 Accepts]: Start accepts. Automaton has 323634 states and 581607 transitions. Word has length 296 [2019-10-02 13:17:48,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:17:48,827 INFO L475 AbstractCegarLoop]: Abstraction has 323634 states and 581607 transitions. [2019-10-02 13:17:48,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:17:48,828 INFO L276 IsEmpty]: Start isEmpty. Operand 323634 states and 581607 transitions. [2019-10-02 13:17:48,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-10-02 13:17:48,930 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:17:48,931 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:17:48,931 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:17:48,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:17:48,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1333290001, now seen corresponding path program 1 times [2019-10-02 13:17:48,932 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:17:48,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:17:48,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:17:48,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:17:48,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:17:48,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:17:50,791 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-02 13:17:50,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:17:50,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 13:17:50,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 13:17:50,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 13:17:50,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 13:17:50,794 INFO L87 Difference]: Start difference. First operand 323634 states and 581607 transitions. Second operand 6 states. [2019-10-02 13:18:18,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:18:18,782 INFO L93 Difference]: Finished difference Result 647091 states and 1162970 transitions. [2019-10-02 13:18:18,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 13:18:18,783 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 297 [2019-10-02 13:18:18,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:18:20,616 INFO L225 Difference]: With dead ends: 647091 [2019-10-02 13:18:20,616 INFO L226 Difference]: Without dead ends: 323640 [2019-10-02 13:18:21,874 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 13:18:22,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323640 states. [2019-10-02 13:18:39,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323640 to 323634. [2019-10-02 13:18:39,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323634 states. [2019-10-02 13:18:41,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323634 states to 323634 states and 581595 transitions. [2019-10-02 13:18:41,561 INFO L78 Accepts]: Start accepts. Automaton has 323634 states and 581595 transitions. Word has length 297 [2019-10-02 13:18:41,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:18:41,561 INFO L475 AbstractCegarLoop]: Abstraction has 323634 states and 581595 transitions. [2019-10-02 13:18:41,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 13:18:41,561 INFO L276 IsEmpty]: Start isEmpty. Operand 323634 states and 581595 transitions. [2019-10-02 13:18:41,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-10-02 13:18:41,681 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:18:41,682 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:18:41,682 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:18:41,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:18:41,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1824820190, now seen corresponding path program 1 times [2019-10-02 13:18:41,682 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:18:41,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:18:41,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:18:41,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:18:41,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:18:43,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:18:43,615 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-02 13:18:43,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:18:43,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:18:43,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:18:43,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:18:43,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:18:43,617 INFO L87 Difference]: Start difference. First operand 323634 states and 581595 transitions. Second operand 3 states. [2019-10-02 13:19:04,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:19:04,626 INFO L93 Difference]: Finished difference Result 648117 states and 1164904 transitions. [2019-10-02 13:19:04,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:19:04,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 297 [2019-10-02 13:19:04,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:19:06,586 INFO L225 Difference]: With dead ends: 648117 [2019-10-02 13:19:06,586 INFO L226 Difference]: Without dead ends: 324602 [2019-10-02 13:19:17,532 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 13:19:17,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324602 states. [2019-10-02 13:19:33,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324602 to 324596. [2019-10-02 13:19:33,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324596 states. [2019-10-02 13:19:36,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324596 states to 324596 states and 583420 transitions. [2019-10-02 13:19:36,959 INFO L78 Accepts]: Start accepts. Automaton has 324596 states and 583420 transitions. Word has length 297 [2019-10-02 13:19:36,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:19:36,959 INFO L475 AbstractCegarLoop]: Abstraction has 324596 states and 583420 transitions. [2019-10-02 13:19:36,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:19:36,960 INFO L276 IsEmpty]: Start isEmpty. Operand 324596 states and 583420 transitions. [2019-10-02 13:19:37,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-10-02 13:19:37,059 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:19:37,060 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:19:37,060 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:19:37,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:19:37,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1868528337, now seen corresponding path program 1 times [2019-10-02 13:19:37,061 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:19:37,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:19:37,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:19:37,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:19:37,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:19:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:19:37,209 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-02 13:19:37,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:19:37,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:19:37,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:19:37,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:19:37,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:19:37,211 INFO L87 Difference]: Start difference. First operand 324596 states and 583420 transitions. Second operand 3 states. [2019-10-02 13:20:01,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:20:01,539 INFO L93 Difference]: Finished difference Result 650928 states and 1170154 transitions. [2019-10-02 13:20:01,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:20:01,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-10-02 13:20:01,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:20:03,337 INFO L225 Difference]: With dead ends: 650928 [2019-10-02 13:20:03,337 INFO L226 Difference]: Without dead ends: 326462 [2019-10-02 13:20:14,435 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 13:20:14,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326462 states. [2019-10-02 13:20:29,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326462 to 326456. [2019-10-02 13:20:29,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326456 states. [2019-10-02 13:20:32,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326456 states to 326456 states and 586839 transitions. [2019-10-02 13:20:32,941 INFO L78 Accepts]: Start accepts. Automaton has 326456 states and 586839 transitions. Word has length 305 [2019-10-02 13:20:32,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:20:32,941 INFO L475 AbstractCegarLoop]: Abstraction has 326456 states and 586839 transitions. [2019-10-02 13:20:32,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:20:32,941 INFO L276 IsEmpty]: Start isEmpty. Operand 326456 states and 586839 transitions. [2019-10-02 13:20:33,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-10-02 13:20:33,071 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:20:33,071 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:20:33,071 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:20:33,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:20:33,071 INFO L82 PathProgramCache]: Analyzing trace with hash 372872994, now seen corresponding path program 1 times [2019-10-02 13:20:33,072 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:20:33,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:20:33,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:20:33,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:20:33,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:20:33,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:20:33,218 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-02 13:20:33,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:20:33,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:20:33,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:20:33,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:20:33,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:20:33,220 INFO L87 Difference]: Start difference. First operand 326456 states and 586839 transitions. Second operand 3 states. [2019-10-02 13:20:55,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:20:55,225 INFO L93 Difference]: Finished difference Result 656331 states and 1180036 transitions. [2019-10-02 13:20:55,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:20:55,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306 [2019-10-02 13:20:55,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:20:57,734 INFO L225 Difference]: With dead ends: 656331 [2019-10-02 13:20:57,734 INFO L226 Difference]: Without dead ends: 330026 [2019-10-02 13:20:58,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 13:20:58,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330026 states. [2019-10-02 13:21:25,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330026 to 330020. [2019-10-02 13:21:25,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330020 states. [2019-10-02 13:21:26,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330020 states to 330020 states and 593282 transitions. [2019-10-02 13:21:26,890 INFO L78 Accepts]: Start accepts. Automaton has 330020 states and 593282 transitions. Word has length 306 [2019-10-02 13:21:26,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:21:26,890 INFO L475 AbstractCegarLoop]: Abstraction has 330020 states and 593282 transitions. [2019-10-02 13:21:26,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:21:26,891 INFO L276 IsEmpty]: Start isEmpty. Operand 330020 states and 593282 transitions. [2019-10-02 13:21:28,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-10-02 13:21:28,961 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:21:28,962 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:21:28,962 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:21:28,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:21:28,963 INFO L82 PathProgramCache]: Analyzing trace with hash 479089297, now seen corresponding path program 1 times [2019-10-02 13:21:28,963 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:21:28,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:21:28,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:28,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:28,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:29,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:29,105 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-02 13:21:29,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:21:29,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:21:29,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:21:29,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:21:29,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:21:29,106 INFO L87 Difference]: Start difference. First operand 330020 states and 593282 transitions. Second operand 3 states. [2019-10-02 13:21:53,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:21:53,374 INFO L93 Difference]: Finished difference Result 666697 states and 1199038 transitions. [2019-10-02 13:21:53,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:21:53,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 307 [2019-10-02 13:21:53,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:21:55,216 INFO L225 Difference]: With dead ends: 666697 [2019-10-02 13:21:55,217 INFO L226 Difference]: Without dead ends: 336844 [2019-10-02 13:21:55,972 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 13:21:56,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336844 states. [2019-10-02 13:22:13,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336844 to 336838. [2019-10-02 13:22:13,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336838 states. [2019-10-02 13:22:16,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336838 states to 336838 states and 605763 transitions. [2019-10-02 13:22:16,090 INFO L78 Accepts]: Start accepts. Automaton has 336838 states and 605763 transitions. Word has length 307 [2019-10-02 13:22:16,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:22:16,090 INFO L475 AbstractCegarLoop]: Abstraction has 336838 states and 605763 transitions. [2019-10-02 13:22:16,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:22:16,090 INFO L276 IsEmpty]: Start isEmpty. Operand 336838 states and 605763 transitions. [2019-10-02 13:22:16,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-10-02 13:22:16,228 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:16,228 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:22:16,228 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:16,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:16,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1044794462, now seen corresponding path program 1 times [2019-10-02 13:22:16,229 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:16,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:16,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:16,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:16,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:16,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:16,368 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-02 13:22:16,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:22:16,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:22:16,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:22:16,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:22:16,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:22:16,369 INFO L87 Difference]: Start difference. First operand 336838 states and 605763 transitions. Second operand 3 states. [2019-10-02 13:22:38,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:22:38,206 INFO L93 Difference]: Finished difference Result 686567 states and 1235512 transitions. [2019-10-02 13:22:38,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:22:38,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 301 [2019-10-02 13:22:38,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:22:40,816 INFO L225 Difference]: With dead ends: 686567 [2019-10-02 13:22:40,817 INFO L226 Difference]: Without dead ends: 349902 [2019-10-02 13:22:41,555 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 13:22:41,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349902 states.