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_spec9_product15.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 14:05:07,637 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 14:05:07,639 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 14:05:07,661 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 14:05:07,662 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 14:05:07,663 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 14:05:07,665 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 14:05:07,676 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 14:05:07,678 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 14:05:07,682 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 14:05:07,683 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 14:05:07,684 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 14:05:07,685 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 14:05:07,686 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 14:05:07,689 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 14:05:07,691 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 14:05:07,692 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 14:05:07,694 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 14:05:07,698 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 14:05:07,701 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 14:05:07,704 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 14:05:07,706 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 14:05:07,707 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 14:05:07,707 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 14:05:07,711 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 14:05:07,712 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 14:05:07,712 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 14:05:07,713 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 14:05:07,714 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 14:05:07,717 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 14:05:07,717 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 14:05:07,718 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 14:05:07,718 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 14:05:07,719 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 14:05:07,723 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 14:05:07,723 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 14:05:07,724 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 14:05:07,724 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 14:05:07,725 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 14:05:07,725 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 14:05:07,728 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 14:05:07,729 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 14:05:07,743 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 14:05:07,743 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 14:05:07,744 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 14:05:07,745 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 14:05:07,745 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 14:05:07,745 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 14:05:07,745 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 14:05:07,745 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 14:05:07,746 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 14:05:07,746 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 14:05:07,746 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 14:05:07,746 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 14:05:07,747 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 14:05:07,747 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 14:05:07,747 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 14:05:07,747 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 14:05:07,747 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 14:05:07,748 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 14:05:07,748 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 14:05:07,748 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 14:05:07,748 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 14:05:07,748 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 14:05:07,749 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 14:05:07,749 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 14:05:07,749 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 14:05:07,749 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 14:05:07,750 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 14:05:07,750 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 14:05:07,750 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 14:05:07,779 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 14:05:07,795 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 14:05:07,801 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 14:05:07,802 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 14:05:07,803 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 14:05:07,803 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec9_product15.cil.c [2019-10-02 14:05:07,876 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f598d2f1/ae33103cf55e42e59c0f18343e2be4d4/FLAGb411d7a56 [2019-10-02 14:05:08,506 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 14:05:08,507 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec9_product15.cil.c [2019-10-02 14:05:08,527 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f598d2f1/ae33103cf55e42e59c0f18343e2be4d4/FLAGb411d7a56 [2019-10-02 14:05:08,727 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f598d2f1/ae33103cf55e42e59c0f18343e2be4d4 [2019-10-02 14:05:08,740 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 14:05:08,741 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 14:05:08,742 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 14:05:08,742 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 14:05:08,745 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 14:05:08,746 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:05:08" (1/1) ... [2019-10-02 14:05:08,748 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11498c8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:05:08, skipping insertion in model container [2019-10-02 14:05:08,748 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:05:08" (1/1) ... [2019-10-02 14:05:08,756 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 14:05:08,828 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 14:05:09,578 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:05:09,607 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 14:05:09,769 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:05:09,873 INFO L192 MainTranslator]: Completed translation [2019-10-02 14:05:09,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:05:09 WrapperNode [2019-10-02 14:05:09,874 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 14:05:09,875 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 14:05:09,875 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 14:05:09,875 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 14:05:09,889 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:05:09" (1/1) ... [2019-10-02 14:05:09,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:05:09" (1/1) ... [2019-10-02 14:05:09,929 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:05:09" (1/1) ... [2019-10-02 14:05:09,929 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:05:09" (1/1) ... [2019-10-02 14:05:09,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:05:09" (1/1) ... [2019-10-02 14:05:10,016 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:05:09" (1/1) ... [2019-10-02 14:05:10,029 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:05:09" (1/1) ... [2019-10-02 14:05:10,051 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 14:05:10,051 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 14:05:10,051 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 14:05:10,052 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 14:05:10,053 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:05:09" (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 14:05:10,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 14:05:10,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 14:05:10,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 14:05:10,135 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 14:05:10,136 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 14:05:10,137 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 14:05:10,137 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 14:05:10,137 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 14:05:10,137 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 14:05:10,137 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 14:05:10,138 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 14:05:10,138 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 14:05:10,139 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 14:05:10,139 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 14:05:10,140 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 14:05:10,140 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 14:05:10,142 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 14:05:10,143 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 14:05:10,143 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 14:05:10,143 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 14:05:10,143 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 14:05:10,144 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 14:05:10,144 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 14:05:10,144 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 14:05:10,144 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 14:05:10,144 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 14:05:10,145 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 14:05:10,145 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 14:05:10,145 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 14:05:10,145 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 14:05:10,145 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 14:05:10,145 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 14:05:10,146 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 14:05:10,146 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 14:05:10,146 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 14:05:10,146 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 14:05:10,147 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 14:05:10,147 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 14:05:10,147 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 14:05:10,147 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 14:05:10,147 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 14:05:10,148 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 14:05:10,148 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 14:05:10,148 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 14:05:10,148 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 14:05:10,148 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 14:05:10,149 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 14:05:10,149 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 14:05:10,149 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 14:05:10,149 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 14:05:10,149 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 14:05:10,149 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 14:05:10,150 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 14:05:10,150 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 14:05:10,150 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 14:05:10,150 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 14:05:10,150 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 14:05:10,151 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 14:05:10,151 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 14:05:10,151 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 14:05:10,151 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 14:05:10,152 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 14:05:10,152 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 14:05:10,152 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 14:05:10,152 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 14:05:10,153 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 14:05:10,153 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 14:05:10,153 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 14:05:10,154 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 14:05:10,154 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 14:05:10,154 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-10-02 14:05:10,154 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AutoResponder [2019-10-02 14:05:10,154 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 14:05:10,154 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 14:05:10,155 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 14:05:10,155 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 14:05:10,156 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 14:05:10,156 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 14:05:10,156 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 14:05:10,156 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 14:05:10,156 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 14:05:10,156 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-02 14:05:10,157 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptForward_spec__1 [2019-10-02 14:05:10,157 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptForward_spec__2 [2019-10-02 14:05:10,158 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 14:05:10,158 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 14:05:10,158 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 14:05:10,159 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 14:05:10,159 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 14:05:10,159 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 14:05:10,160 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 14:05:10,160 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 14:05:10,160 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 14:05:10,161 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 14:05:10,161 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 14:05:10,161 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 14:05:10,161 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 14:05:10,161 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 14:05:10,161 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 14:05:10,162 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 14:05:10,162 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 14:05:10,162 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 14:05:10,162 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 14:05:10,162 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-02 14:05:10,162 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 14:05:10,162 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 14:05:10,163 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 14:05:10,163 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 14:05:10,163 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 14:05:10,163 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 14:05:10,163 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 14:05:10,163 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 14:05:10,163 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 14:05:10,164 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 14:05:10,164 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 14:05:10,164 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 14:05:10,164 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 14:05:10,165 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 14:05:10,165 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 14:05:10,165 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 14:05:10,165 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 14:05:10,166 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 14:05:10,166 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 14:05:10,166 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 14:05:10,167 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 14:05:10,167 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 14:05:10,167 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 14:05:10,168 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 14:05:10,168 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 14:05:10,168 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 14:05:10,168 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 14:05:10,169 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 14:05:10,169 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 14:05:10,169 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 14:05:10,169 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 14:05:10,169 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 14:05:10,169 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 14:05:10,169 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 14:05:10,170 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-02 14:05:10,170 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 14:05:10,174 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 14:05:10,175 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 14:05:10,175 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 14:05:10,176 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 14:05:10,183 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 14:05:10,183 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 14:05:10,183 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 14:05:10,183 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 14:05:10,184 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 14:05:10,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 14:05:10,184 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 14:05:10,184 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 14:05:10,184 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 14:05:10,184 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 14:05:10,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 14:05:10,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 14:05:10,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 14:05:10,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 14:05:10,185 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 14:05:10,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 14:05:10,186 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 14:05:10,186 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 14:05:10,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 14:05:10,186 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 14:05:10,186 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 14:05:10,187 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 14:05:10,187 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 14:05:10,187 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 14:05:10,187 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 14:05:10,187 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 14:05:10,187 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 14:05:10,187 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 14:05:10,188 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 14:05:10,188 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 14:05:10,188 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 14:05:10,188 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 14:05:10,188 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 14:05:10,188 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 14:05:10,188 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 14:05:10,188 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 14:05:10,189 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 14:05:10,189 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 14:05:10,189 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 14:05:10,189 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 14:05:10,189 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 14:05:10,189 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 14:05:10,189 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 14:05:10,189 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 14:05:10,190 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 14:05:10,190 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 14:05:10,190 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 14:05:10,190 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 14:05:10,190 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 14:05:10,190 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 14:05:10,190 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 14:05:10,190 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 14:05:10,191 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 14:05:10,191 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 14:05:10,191 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 14:05:10,191 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 14:05:10,191 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 14:05:10,191 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 14:05:10,191 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 14:05:10,191 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 14:05:10,192 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 14:05:10,192 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 14:05:10,192 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 14:05:10,192 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 14:05:10,192 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 14:05:10,192 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 14:05:10,192 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-02 14:05:10,193 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptForward_spec__2 [2019-10-02 14:05:10,193 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 14:05:10,193 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-10-02 14:05:10,193 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AutoResponder [2019-10-02 14:05:10,193 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptForward_spec__1 [2019-10-02 14:05:10,193 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 14:05:10,193 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 14:05:10,194 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 14:05:10,194 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 14:05:10,194 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 14:05:10,194 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 14:05:10,194 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 14:05:10,194 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 14:05:10,194 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 14:05:10,194 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 14:05:10,195 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 14:05:10,195 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 14:05:10,195 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 14:05:10,195 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 14:05:10,195 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 14:05:10,195 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 14:05:10,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 14:05:10,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 14:05:10,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 14:05:12,206 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 14:05:12,206 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 14:05:12,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:05:12 BoogieIcfgContainer [2019-10-02 14:05:12,209 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 14:05:12,210 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 14:05:12,210 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 14:05:12,214 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 14:05:12,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 02:05:08" (1/3) ... [2019-10-02 14:05:12,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@667c52cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:05:12, skipping insertion in model container [2019-10-02 14:05:12,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:05:09" (2/3) ... [2019-10-02 14:05:12,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@667c52cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:05:12, skipping insertion in model container [2019-10-02 14:05:12,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:05:12" (3/3) ... [2019-10-02 14:05:12,218 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec9_product15.cil.c [2019-10-02 14:05:12,229 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 14:05:12,242 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 14:05:12,261 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 14:05:12,310 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 14:05:12,311 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 14:05:12,311 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 14:05:12,311 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 14:05:12,311 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 14:05:12,312 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 14:05:12,312 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 14:05:12,312 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 14:05:12,312 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 14:05:12,349 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states. [2019-10-02 14:05:12,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-02 14:05:12,382 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:05:12,384 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-02 14:05:12,387 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:05:12,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:05:12,395 INFO L82 PathProgramCache]: Analyzing trace with hash -334786029, now seen corresponding path program 1 times [2019-10-02 14:05:12,401 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:05:12,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:05:12,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:05:12,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:05:12,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:05:12,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:05:13,006 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 14:05:13,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:05:13,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 14:05:13,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 14:05:13,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 14:05:13,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 14:05:13,032 INFO L87 Difference]: Start difference. First operand 470 states. Second operand 2 states. [2019-10-02 14:05:13,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:05:13,105 INFO L93 Difference]: Finished difference Result 634 states and 839 transitions. [2019-10-02 14:05:13,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 14:05:13,106 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 145 [2019-10-02 14:05:13,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:05:13,129 INFO L225 Difference]: With dead ends: 634 [2019-10-02 14:05:13,129 INFO L226 Difference]: Without dead ends: 423 [2019-10-02 14:05:13,135 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 14:05:13,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2019-10-02 14:05:13,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2019-10-02 14:05:13,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-10-02 14:05:13,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 564 transitions. [2019-10-02 14:05:13,237 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 564 transitions. Word has length 145 [2019-10-02 14:05:13,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:05:13,240 INFO L475 AbstractCegarLoop]: Abstraction has 423 states and 564 transitions. [2019-10-02 14:05:13,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 14:05:13,241 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 564 transitions. [2019-10-02 14:05:13,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-02 14:05:13,253 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:05:13,253 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-02 14:05:13,253 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:05:13,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:05:13,255 INFO L82 PathProgramCache]: Analyzing trace with hash 307688883, now seen corresponding path program 1 times [2019-10-02 14:05:13,255 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:05:13,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:05:13,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:05:13,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:05:13,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:05:13,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:05:13,543 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 14:05:13,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:05:13,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:05:13,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:05:13,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:05:13,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:05:13,546 INFO L87 Difference]: Start difference. First operand 423 states and 564 transitions. Second operand 3 states. [2019-10-02 14:05:13,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:05:13,593 INFO L93 Difference]: Finished difference Result 617 states and 808 transitions. [2019-10-02 14:05:13,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:05:13,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-10-02 14:05:13,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:05:13,599 INFO L225 Difference]: With dead ends: 617 [2019-10-02 14:05:13,599 INFO L226 Difference]: Without dead ends: 426 [2019-10-02 14:05:13,602 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 14:05:13,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-10-02 14:05:13,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 425. [2019-10-02 14:05:13,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-10-02 14:05:13,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 566 transitions. [2019-10-02 14:05:13,635 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 566 transitions. Word has length 146 [2019-10-02 14:05:13,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:05:13,636 INFO L475 AbstractCegarLoop]: Abstraction has 425 states and 566 transitions. [2019-10-02 14:05:13,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:05:13,636 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 566 transitions. [2019-10-02 14:05:13,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-02 14:05:13,639 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:05:13,639 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-02 14:05:13,640 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:05:13,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:05:13,640 INFO L82 PathProgramCache]: Analyzing trace with hash -179459229, now seen corresponding path program 1 times [2019-10-02 14:05:13,640 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:05:13,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:05:13,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:05:13,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:05:13,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:05:13,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:05:13,794 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 14:05:13,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:05:13,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:05:13,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:05:13,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:05:13,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:05:13,796 INFO L87 Difference]: Start difference. First operand 425 states and 566 transitions. Second operand 3 states. [2019-10-02 14:05:13,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:05:13,828 INFO L93 Difference]: Finished difference Result 826 states and 1130 transitions. [2019-10-02 14:05:13,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:05:13,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-10-02 14:05:13,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:05:13,833 INFO L225 Difference]: With dead ends: 826 [2019-10-02 14:05:13,834 INFO L226 Difference]: Without dead ends: 466 [2019-10-02 14:05:13,836 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 14:05:13,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-10-02 14:05:13,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 465. [2019-10-02 14:05:13,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-10-02 14:05:13,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 635 transitions. [2019-10-02 14:05:13,872 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 635 transitions. Word has length 156 [2019-10-02 14:05:13,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:05:13,874 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 635 transitions. [2019-10-02 14:05:13,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:05:13,875 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 635 transitions. [2019-10-02 14:05:13,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-02 14:05:13,882 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:05:13,883 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-02 14:05:13,883 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:05:13,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:05:13,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1835832225, now seen corresponding path program 1 times [2019-10-02 14:05:13,884 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:05:13,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:05:13,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:05:13,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:05:13,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:05:13,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:05:14,136 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 14:05:14,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:05:14,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:05:14,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:05:14,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:05:14,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:05:14,138 INFO L87 Difference]: Start difference. First operand 465 states and 635 transitions. Second operand 3 states. [2019-10-02 14:05:14,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:05:14,176 INFO L93 Difference]: Finished difference Result 943 states and 1332 transitions. [2019-10-02 14:05:14,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:05:14,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-10-02 14:05:14,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:05:14,183 INFO L225 Difference]: With dead ends: 943 [2019-10-02 14:05:14,183 INFO L226 Difference]: Without dead ends: 543 [2019-10-02 14:05:14,185 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 14:05:14,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-10-02 14:05:14,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 542. [2019-10-02 14:05:14,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-10-02 14:05:14,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 767 transitions. [2019-10-02 14:05:14,215 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 767 transitions. Word has length 157 [2019-10-02 14:05:14,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:05:14,215 INFO L475 AbstractCegarLoop]: Abstraction has 542 states and 767 transitions. [2019-10-02 14:05:14,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:05:14,216 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 767 transitions. [2019-10-02 14:05:14,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-02 14:05:14,222 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:05:14,222 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-02 14:05:14,223 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:05:14,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:05:14,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1507225213, now seen corresponding path program 1 times [2019-10-02 14:05:14,223 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:05:14,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:05:14,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:05:14,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:05:14,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:05:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:05:14,500 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 14:05:14,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:05:14,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:05:14,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:05:14,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:05:14,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:05:14,502 INFO L87 Difference]: Start difference. First operand 542 states and 767 transitions. Second operand 3 states. [2019-10-02 14:05:14,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:05:14,552 INFO L93 Difference]: Finished difference Result 1168 states and 1718 transitions. [2019-10-02 14:05:14,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:05:14,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-10-02 14:05:14,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:05:14,560 INFO L225 Difference]: With dead ends: 1168 [2019-10-02 14:05:14,560 INFO L226 Difference]: Without dead ends: 691 [2019-10-02 14:05:14,563 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 14:05:14,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2019-10-02 14:05:14,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 690. [2019-10-02 14:05:14,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2019-10-02 14:05:14,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1019 transitions. [2019-10-02 14:05:14,610 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1019 transitions. Word has length 158 [2019-10-02 14:05:14,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:05:14,611 INFO L475 AbstractCegarLoop]: Abstraction has 690 states and 1019 transitions. [2019-10-02 14:05:14,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:05:14,611 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1019 transitions. [2019-10-02 14:05:14,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-02 14:05:14,618 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:05:14,618 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-02 14:05:14,618 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:05:14,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:05:14,619 INFO L82 PathProgramCache]: Analyzing trace with hash 663233921, now seen corresponding path program 1 times [2019-10-02 14:05:14,619 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:05:14,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:05:14,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:05:14,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:05:14,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:05:14,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:05:14,869 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 14:05:14,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:05:14,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:05:14,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:05:14,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:05:14,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:05:14,871 INFO L87 Difference]: Start difference. First operand 690 states and 1019 transitions. Second operand 3 states. [2019-10-02 14:05:14,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:05:14,934 INFO L93 Difference]: Finished difference Result 1600 states and 2454 transitions. [2019-10-02 14:05:14,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:05:14,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-10-02 14:05:14,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:05:14,943 INFO L225 Difference]: With dead ends: 1600 [2019-10-02 14:05:14,943 INFO L226 Difference]: Without dead ends: 975 [2019-10-02 14:05:14,946 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 14:05:14,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2019-10-02 14:05:15,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 974. [2019-10-02 14:05:15,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2019-10-02 14:05:15,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1499 transitions. [2019-10-02 14:05:15,057 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1499 transitions. Word has length 159 [2019-10-02 14:05:15,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:05:15,060 INFO L475 AbstractCegarLoop]: Abstraction has 974 states and 1499 transitions. [2019-10-02 14:05:15,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:05:15,060 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1499 transitions. [2019-10-02 14:05:15,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-02 14:05:15,066 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:05:15,066 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-02 14:05:15,067 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:05:15,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:05:15,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1809778595, now seen corresponding path program 1 times [2019-10-02 14:05:15,067 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:05:15,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:05:15,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:05:15,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:05:15,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:05:15,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:05:15,222 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 14:05:15,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:05:15,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:05:15,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:05:15,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:05:15,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:05:15,225 INFO L87 Difference]: Start difference. First operand 974 states and 1499 transitions. Second operand 3 states. [2019-10-02 14:05:15,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:05:15,298 INFO L93 Difference]: Finished difference Result 2428 states and 3854 transitions. [2019-10-02 14:05:15,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:05:15,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-10-02 14:05:15,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:05:15,309 INFO L225 Difference]: With dead ends: 2428 [2019-10-02 14:05:15,310 INFO L226 Difference]: Without dead ends: 1519 [2019-10-02 14:05:15,317 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 14:05:15,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1519 states. [2019-10-02 14:05:15,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1519 to 1518. [2019-10-02 14:05:15,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1518 states. [2019-10-02 14:05:15,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 2411 transitions. [2019-10-02 14:05:15,448 INFO L78 Accepts]: Start accepts. Automaton has 1518 states and 2411 transitions. Word has length 160 [2019-10-02 14:05:15,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:05:15,449 INFO L475 AbstractCegarLoop]: Abstraction has 1518 states and 2411 transitions. [2019-10-02 14:05:15,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:05:15,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 2411 transitions. [2019-10-02 14:05:15,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-02 14:05:15,460 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:05:15,461 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-02 14:05:15,461 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:05:15,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:05:15,462 INFO L82 PathProgramCache]: Analyzing trace with hash 2049207905, now seen corresponding path program 1 times [2019-10-02 14:05:15,462 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:05:15,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:05:15,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:05:15,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:05:15,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:05:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:05:15,746 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 14:05:15,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:05:15,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:05:15,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:05:15,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:05:15,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:05:15,749 INFO L87 Difference]: Start difference. First operand 1518 states and 2411 transitions. Second operand 3 states. [2019-10-02 14:05:15,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:05:15,829 INFO L93 Difference]: Finished difference Result 1773 states and 2747 transitions. [2019-10-02 14:05:15,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:05:15,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2019-10-02 14:05:15,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:05:15,841 INFO L225 Difference]: With dead ends: 1773 [2019-10-02 14:05:15,842 INFO L226 Difference]: Without dead ends: 1584 [2019-10-02 14:05:15,844 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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 14:05:15,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2019-10-02 14:05:16,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1584. [2019-10-02 14:05:16,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2019-10-02 14:05:16,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2499 transitions. [2019-10-02 14:05:16,034 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2499 transitions. Word has length 162 [2019-10-02 14:05:16,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:05:16,037 INFO L475 AbstractCegarLoop]: Abstraction has 1584 states and 2499 transitions. [2019-10-02 14:05:16,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:05:16,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2499 transitions. [2019-10-02 14:05:16,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-10-02 14:05:16,051 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:05:16,051 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 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] [2019-10-02 14:05:16,051 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:05:16,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:05:16,052 INFO L82 PathProgramCache]: Analyzing trace with hash 613431326, now seen corresponding path program 1 times [2019-10-02 14:05:16,052 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:05:16,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:05:16,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:05:16,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:05:16,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:05:16,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:05:16,567 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-02 14:05:16,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:05:16,568 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 14:05:16,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:05:17,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:05:17,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 2974 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 14:05:17,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:05:17,781 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-02 14:05:17,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:05:17,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [22] total 29 [2019-10-02 14:05:17,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-02 14:05:17,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-02 14:05:17,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=746, Unknown=0, NotChecked=0, Total=812 [2019-10-02 14:05:17,798 INFO L87 Difference]: Start difference. First operand 1584 states and 2499 transitions. Second operand 29 states. [2019-10-02 14:05:40,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:05:40,284 INFO L93 Difference]: Finished difference Result 5773 states and 9021 transitions. [2019-10-02 14:05:40,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-10-02 14:05:40,285 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 269 [2019-10-02 14:05:40,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:05:40,335 INFO L225 Difference]: With dead ends: 5773 [2019-10-02 14:05:40,335 INFO L226 Difference]: Without dead ends: 4219 [2019-10-02 14:05:40,355 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5327 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1357, Invalid=15935, Unknown=0, NotChecked=0, Total=17292 [2019-10-02 14:05:40,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4219 states. [2019-10-02 14:05:40,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4219 to 3916. [2019-10-02 14:05:40,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3916 states. [2019-10-02 14:05:40,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3916 states to 3916 states and 6145 transitions. [2019-10-02 14:05:40,663 INFO L78 Accepts]: Start accepts. Automaton has 3916 states and 6145 transitions. Word has length 269 [2019-10-02 14:05:40,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:05:40,666 INFO L475 AbstractCegarLoop]: Abstraction has 3916 states and 6145 transitions. [2019-10-02 14:05:40,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-02 14:05:40,666 INFO L276 IsEmpty]: Start isEmpty. Operand 3916 states and 6145 transitions. [2019-10-02 14:05:40,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-10-02 14:05:40,703 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:05:40,704 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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, 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 14:05:40,705 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:05:40,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:05:40,705 INFO L82 PathProgramCache]: Analyzing trace with hash 605190756, now seen corresponding path program 1 times [2019-10-02 14:05:40,705 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:05:40,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:05:40,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:05:40,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:05:40,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:05:40,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:05:41,220 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-02 14:05:41,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:05:41,221 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 14:05:41,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:05:42,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:05:42,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 2976 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 14:05:42,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:05:42,368 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-02 14:05:42,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:05:42,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [18] total 23 [2019-10-02 14:05:42,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 14:05:42,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 14:05:42,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2019-10-02 14:05:42,380 INFO L87 Difference]: Start difference. First operand 3916 states and 6145 transitions. Second operand 23 states. [2019-10-02 14:06:00,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:06:00,965 INFO L93 Difference]: Finished difference Result 8407 states and 13120 transitions. [2019-10-02 14:06:00,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-10-02 14:06:00,966 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 271 [2019-10-02 14:06:00,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:06:01,003 INFO L225 Difference]: With dead ends: 8407 [2019-10-02 14:06:01,003 INFO L226 Difference]: Without dead ends: 4536 [2019-10-02 14:06:01,028 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4694 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1233, Invalid=13529, Unknown=0, NotChecked=0, Total=14762 [2019-10-02 14:06:01,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4536 states. [2019-10-02 14:06:01,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4536 to 3920. [2019-10-02 14:06:01,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3920 states. [2019-10-02 14:06:01,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 6150 transitions. [2019-10-02 14:06:01,270 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 6150 transitions. Word has length 271 [2019-10-02 14:06:01,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:06:01,271 INFO L475 AbstractCegarLoop]: Abstraction has 3920 states and 6150 transitions. [2019-10-02 14:06:01,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 14:06:01,271 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 6150 transitions. [2019-10-02 14:06:01,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-10-02 14:06:01,293 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:06:01,293 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, 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] [2019-10-02 14:06:01,294 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:06:01,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:06:01,294 INFO L82 PathProgramCache]: Analyzing trace with hash 2108517762, now seen corresponding path program 1 times [2019-10-02 14:06:01,294 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:06:01,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:06:01,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:06:01,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:06:01,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:06:01,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:06:01,545 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-10-02 14:06:01,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:06:01,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 14:06:01,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:06:01,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:06:01,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:06:01,547 INFO L87 Difference]: Start difference. First operand 3920 states and 6150 transitions. Second operand 5 states. [2019-10-02 14:06:01,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:06:01,706 INFO L93 Difference]: Finished difference Result 4976 states and 7521 transitions. [2019-10-02 14:06:01,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:06:01,707 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 273 [2019-10-02 14:06:01,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:06:01,735 INFO L225 Difference]: With dead ends: 4976 [2019-10-02 14:06:01,736 INFO L226 Difference]: Without dead ends: 3868 [2019-10-02 14:06:01,741 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:06:01,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3868 states. [2019-10-02 14:06:01,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3868 to 3858. [2019-10-02 14:06:01,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3858 states. [2019-10-02 14:06:01,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3858 states to 3858 states and 6052 transitions. [2019-10-02 14:06:01,986 INFO L78 Accepts]: Start accepts. Automaton has 3858 states and 6052 transitions. Word has length 273 [2019-10-02 14:06:01,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:06:01,987 INFO L475 AbstractCegarLoop]: Abstraction has 3858 states and 6052 transitions. [2019-10-02 14:06:01,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:06:01,987 INFO L276 IsEmpty]: Start isEmpty. Operand 3858 states and 6052 transitions. [2019-10-02 14:06:02,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-10-02 14:06:02,012 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:06:02,012 INFO L411 BasicCegarLoop]: trace histogram [3, 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, 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] [2019-10-02 14:06:02,013 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:06:02,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:06:02,013 INFO L82 PathProgramCache]: Analyzing trace with hash 538632830, now seen corresponding path program 1 times [2019-10-02 14:06:02,013 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:06:02,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:06:02,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:06:02,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:06:02,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:06:02,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:06:02,423 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-02 14:06:02,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:06:02,424 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 14:06:02,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:06:02,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:06:02,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 2978 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 14:06:02,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:06:03,191 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-10-02 14:06:03,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:06:03,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 25 [2019-10-02 14:06:03,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-02 14:06:03,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-02 14:06:03,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2019-10-02 14:06:03,201 INFO L87 Difference]: Start difference. First operand 3858 states and 6052 transitions. Second operand 25 states. [2019-10-02 14:06:21,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:06:21,537 INFO L93 Difference]: Finished difference Result 8114 states and 12658 transitions. [2019-10-02 14:06:21,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-10-02 14:06:21,538 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 273 [2019-10-02 14:06:21,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:06:21,564 INFO L225 Difference]: With dead ends: 8114 [2019-10-02 14:06:21,565 INFO L226 Difference]: Without dead ends: 4313 [2019-10-02 14:06:21,581 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4312 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1208, Invalid=13072, Unknown=0, NotChecked=0, Total=14280 [2019-10-02 14:06:21,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4313 states. [2019-10-02 14:06:21,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4313 to 3868. [2019-10-02 14:06:21,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3868 states. [2019-10-02 14:06:21,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3868 states to 3868 states and 6063 transitions. [2019-10-02 14:06:21,790 INFO L78 Accepts]: Start accepts. Automaton has 3868 states and 6063 transitions. Word has length 273 [2019-10-02 14:06:21,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:06:21,791 INFO L475 AbstractCegarLoop]: Abstraction has 3868 states and 6063 transitions. [2019-10-02 14:06:21,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-02 14:06:21,791 INFO L276 IsEmpty]: Start isEmpty. Operand 3868 states and 6063 transitions. [2019-10-02 14:06:21,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-10-02 14:06:21,813 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:06:21,813 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, 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] [2019-10-02 14:06:21,814 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:06:21,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:06:21,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1337484757, now seen corresponding path program 1 times [2019-10-02 14:06:21,814 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:06:21,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:06:21,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:06:21,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:06:21,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:06:21,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:06:22,096 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-10-02 14:06:22,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:06:22,097 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 14:06:22,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:06:22,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:06:22,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 2978 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 14:06:22,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:06:22,929 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:06:22,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:06:22,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [14] total 21 [2019-10-02 14:06:22,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-02 14:06:22,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-02 14:06:22,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2019-10-02 14:06:22,956 INFO L87 Difference]: Start difference. First operand 3868 states and 6063 transitions. Second operand 21 states. [2019-10-02 14:06:25,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:06:25,398 INFO L93 Difference]: Finished difference Result 7797 states and 12248 transitions. [2019-10-02 14:06:25,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 14:06:25,399 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 273 [2019-10-02 14:06:25,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:06:25,429 INFO L225 Difference]: With dead ends: 7797 [2019-10-02 14:06:25,430 INFO L226 Difference]: Without dead ends: 3895 [2019-10-02 14:06:25,445 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=133, Invalid=1349, Unknown=0, NotChecked=0, Total=1482 [2019-10-02 14:06:25,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3895 states. [2019-10-02 14:06:25,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3895 to 3825. [2019-10-02 14:06:25,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3825 states. [2019-10-02 14:06:25,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3825 states to 3825 states and 5979 transitions. [2019-10-02 14:06:25,730 INFO L78 Accepts]: Start accepts. Automaton has 3825 states and 5979 transitions. Word has length 273 [2019-10-02 14:06:25,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:06:25,730 INFO L475 AbstractCegarLoop]: Abstraction has 3825 states and 5979 transitions. [2019-10-02 14:06:25,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-02 14:06:25,731 INFO L276 IsEmpty]: Start isEmpty. Operand 3825 states and 5979 transitions. [2019-10-02 14:06:25,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-10-02 14:06:25,764 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:06:25,764 INFO L411 BasicCegarLoop]: trace histogram [3, 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, 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] [2019-10-02 14:06:25,765 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:06:25,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:06:25,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1097441733, now seen corresponding path program 1 times [2019-10-02 14:06:25,766 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:06:25,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:06:25,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:06:25,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:06:25,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:06:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:06:26,111 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-02 14:06:26,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:06:26,112 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 14:06:26,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:06:26,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:06:26,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 2980 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 14:06:26,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:06:27,224 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:06:27,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:06:27,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2019-10-02 14:06:27,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 14:06:27,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 14:06:27,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-02 14:06:27,251 INFO L87 Difference]: Start difference. First operand 3825 states and 5979 transitions. Second operand 14 states. [2019-10-02 14:06:29,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:06:29,048 INFO L93 Difference]: Finished difference Result 7635 states and 11957 transitions. [2019-10-02 14:06:29,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 14:06:29,049 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 276 [2019-10-02 14:06:29,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:06:29,103 INFO L225 Difference]: With dead ends: 7635 [2019-10-02 14:06:29,103 INFO L226 Difference]: Without dead ends: 3856 [2019-10-02 14:06:29,123 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2019-10-02 14:06:29,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3856 states. [2019-10-02 14:06:29,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3856 to 3819. [2019-10-02 14:06:29,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3819 states. [2019-10-02 14:06:29,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3819 states to 3819 states and 5958 transitions. [2019-10-02 14:06:29,407 INFO L78 Accepts]: Start accepts. Automaton has 3819 states and 5958 transitions. Word has length 276 [2019-10-02 14:06:29,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:06:29,412 INFO L475 AbstractCegarLoop]: Abstraction has 3819 states and 5958 transitions. [2019-10-02 14:06:29,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 14:06:29,412 INFO L276 IsEmpty]: Start isEmpty. Operand 3819 states and 5958 transitions. [2019-10-02 14:06:29,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-10-02 14:06:29,445 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:06:29,445 INFO L411 BasicCegarLoop]: trace histogram [3, 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, 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 14:06:29,446 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:06:29,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:06:29,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1903051318, now seen corresponding path program 1 times [2019-10-02 14:06:29,447 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:06:29,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:06:29,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:06:29,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:06:29,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:06:29,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:06:29,992 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-10-02 14:06:29,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:06:29,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 14:06:29,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 14:06:29,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 14:06:29,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-02 14:06:29,994 INFO L87 Difference]: Start difference. First operand 3819 states and 5958 transitions. Second operand 13 states. [2019-10-02 14:06:32,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:06:32,752 INFO L93 Difference]: Finished difference Result 8296 states and 12843 transitions. [2019-10-02 14:06:32,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 14:06:32,752 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 275 [2019-10-02 14:06:32,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:06:32,800 INFO L225 Difference]: With dead ends: 8296 [2019-10-02 14:06:32,800 INFO L226 Difference]: Without dead ends: 7609 [2019-10-02 14:06:32,809 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2019-10-02 14:06:32,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7609 states. [2019-10-02 14:06:33,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7609 to 7446. [2019-10-02 14:06:33,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7446 states. [2019-10-02 14:06:33,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7446 states to 7446 states and 11703 transitions. [2019-10-02 14:06:33,294 INFO L78 Accepts]: Start accepts. Automaton has 7446 states and 11703 transitions. Word has length 275 [2019-10-02 14:06:33,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:06:33,295 INFO L475 AbstractCegarLoop]: Abstraction has 7446 states and 11703 transitions. [2019-10-02 14:06:33,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 14:06:33,295 INFO L276 IsEmpty]: Start isEmpty. Operand 7446 states and 11703 transitions. [2019-10-02 14:06:33,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-10-02 14:06:33,358 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:06:33,359 INFO L411 BasicCegarLoop]: trace histogram [3, 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, 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] [2019-10-02 14:06:33,360 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:06:33,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:06:33,360 INFO L82 PathProgramCache]: Analyzing trace with hash 669374024, now seen corresponding path program 1 times [2019-10-02 14:06:33,360 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:06:33,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:06:33,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:06:33,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:06:33,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:06:33,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:06:33,636 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-10-02 14:06:33,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:06:33,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 14:06:33,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 14:06:33,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 14:06:33,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:06:33,639 INFO L87 Difference]: Start difference. First operand 7446 states and 11703 transitions. Second operand 11 states. [2019-10-02 14:06:36,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:06:36,577 INFO L93 Difference]: Finished difference Result 8539 states and 13072 transitions. [2019-10-02 14:06:36,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 14:06:36,577 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 274 [2019-10-02 14:06:36,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:06:36,610 INFO L225 Difference]: With dead ends: 8539 [2019-10-02 14:06:36,610 INFO L226 Difference]: Without dead ends: 7550 [2019-10-02 14:06:36,618 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2019-10-02 14:06:36,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7550 states. [2019-10-02 14:06:37,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7550 to 6808. [2019-10-02 14:06:37,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6808 states. [2019-10-02 14:06:37,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6808 states to 6808 states and 10847 transitions. [2019-10-02 14:06:37,079 INFO L78 Accepts]: Start accepts. Automaton has 6808 states and 10847 transitions. Word has length 274 [2019-10-02 14:06:37,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:06:37,080 INFO L475 AbstractCegarLoop]: Abstraction has 6808 states and 10847 transitions. [2019-10-02 14:06:37,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 14:06:37,080 INFO L276 IsEmpty]: Start isEmpty. Operand 6808 states and 10847 transitions. [2019-10-02 14:06:37,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-10-02 14:06:37,114 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:06:37,114 INFO L411 BasicCegarLoop]: trace histogram [3, 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, 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] [2019-10-02 14:06:37,114 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:06:37,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:06:37,115 INFO L82 PathProgramCache]: Analyzing trace with hash 514485168, now seen corresponding path program 1 times [2019-10-02 14:06:37,115 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:06:37,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:06:37,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:06:37,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:06:37,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:06:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:06:37,344 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-02 14:06:37,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:06:37,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 14:06:37,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:06:37,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:06:37,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:06:37,346 INFO L87 Difference]: Start difference. First operand 6808 states and 10847 transitions. Second operand 9 states. [2019-10-02 14:06:37,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:06:37,748 INFO L93 Difference]: Finished difference Result 7149 states and 11314 transitions. [2019-10-02 14:06:37,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 14:06:37,749 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 294 [2019-10-02 14:06:37,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:06:37,876 INFO L225 Difference]: With dead ends: 7149 [2019-10-02 14:06:37,876 INFO L226 Difference]: Without dead ends: 6893 [2019-10-02 14:06:37,880 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-02 14:06:37,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6893 states. [2019-10-02 14:06:38,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6893 to 6883. [2019-10-02 14:06:38,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6883 states. [2019-10-02 14:06:38,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6883 states to 6883 states and 10965 transitions. [2019-10-02 14:06:38,359 INFO L78 Accepts]: Start accepts. Automaton has 6883 states and 10965 transitions. Word has length 294 [2019-10-02 14:06:38,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:06:38,360 INFO L475 AbstractCegarLoop]: Abstraction has 6883 states and 10965 transitions. [2019-10-02 14:06:38,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:06:38,360 INFO L276 IsEmpty]: Start isEmpty. Operand 6883 states and 10965 transitions. [2019-10-02 14:06:38,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-10-02 14:06:38,392 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:06:38,392 INFO L411 BasicCegarLoop]: trace histogram [3, 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, 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] [2019-10-02 14:06:38,393 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:06:38,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:06:38,393 INFO L82 PathProgramCache]: Analyzing trace with hash -27174876, now seen corresponding path program 1 times [2019-10-02 14:06:38,393 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:06:38,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:06:38,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:06:38,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:06:38,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:06:38,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:06:38,619 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-02 14:06:38,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:06:38,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 14:06:38,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:06:38,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:06:38,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:06:38,621 INFO L87 Difference]: Start difference. First operand 6883 states and 10965 transitions. Second operand 9 states. [2019-10-02 14:06:38,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:06:38,971 INFO L93 Difference]: Finished difference Result 7334 states and 11585 transitions. [2019-10-02 14:06:38,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 14:06:38,971 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 296 [2019-10-02 14:06:38,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:06:39,002 INFO L225 Difference]: With dead ends: 7334 [2019-10-02 14:06:39,002 INFO L226 Difference]: Without dead ends: 7039 [2019-10-02 14:06:39,008 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-02 14:06:39,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7039 states. [2019-10-02 14:06:39,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7039 to 7019. [2019-10-02 14:06:39,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7019 states. [2019-10-02 14:06:39,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7019 states to 7019 states and 11179 transitions. [2019-10-02 14:06:39,472 INFO L78 Accepts]: Start accepts. Automaton has 7019 states and 11179 transitions. Word has length 296 [2019-10-02 14:06:39,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:06:39,473 INFO L475 AbstractCegarLoop]: Abstraction has 7019 states and 11179 transitions. [2019-10-02 14:06:39,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:06:39,473 INFO L276 IsEmpty]: Start isEmpty. Operand 7019 states and 11179 transitions. [2019-10-02 14:06:39,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-10-02 14:06:39,502 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:06:39,502 INFO L411 BasicCegarLoop]: trace histogram [3, 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, 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 14:06:39,502 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:06:39,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:06:39,503 INFO L82 PathProgramCache]: Analyzing trace with hash -511957626, now seen corresponding path program 1 times [2019-10-02 14:06:39,503 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:06:39,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:06:39,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:06:39,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:06:39,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:06:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:06:39,732 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-02 14:06:39,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:06:39,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 14:06:39,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 14:06:39,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 14:06:39,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:06:39,734 INFO L87 Difference]: Start difference. First operand 7019 states and 11179 transitions. Second operand 8 states. [2019-10-02 14:06:43,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:06:43,954 INFO L93 Difference]: Finished difference Result 15015 states and 23709 transitions. [2019-10-02 14:06:43,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 14:06:43,955 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 298 [2019-10-02 14:06:43,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:06:44,021 INFO L225 Difference]: With dead ends: 15015 [2019-10-02 14:06:44,021 INFO L226 Difference]: Without dead ends: 14490 [2019-10-02 14:06:44,032 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-02 14:06:44,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14490 states. [2019-10-02 14:06:44,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14490 to 14020. [2019-10-02 14:06:44,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14020 states. [2019-10-02 14:06:45,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14020 states to 14020 states and 22449 transitions. [2019-10-02 14:06:45,027 INFO L78 Accepts]: Start accepts. Automaton has 14020 states and 22449 transitions. Word has length 298 [2019-10-02 14:06:45,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:06:45,028 INFO L475 AbstractCegarLoop]: Abstraction has 14020 states and 22449 transitions. [2019-10-02 14:06:45,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 14:06:45,028 INFO L276 IsEmpty]: Start isEmpty. Operand 14020 states and 22449 transitions. [2019-10-02 14:06:45,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-10-02 14:06:45,078 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:06:45,078 INFO L411 BasicCegarLoop]: trace histogram [3, 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, 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] [2019-10-02 14:06:45,078 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:06:45,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:06:45,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1432131464, now seen corresponding path program 1 times [2019-10-02 14:06:45,079 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:06:45,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:06:45,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:06:45,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:06:45,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:06:45,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:06:45,296 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-02 14:06:45,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:06:45,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 14:06:45,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 14:06:45,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 14:06:45,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:06:45,298 INFO L87 Difference]: Start difference. First operand 14020 states and 22449 transitions. Second operand 8 states. [2019-10-02 14:06:50,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:06:50,341 INFO L93 Difference]: Finished difference Result 29109 states and 46381 transitions. [2019-10-02 14:06:50,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 14:06:50,342 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 296 [2019-10-02 14:06:50,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:06:50,464 INFO L225 Difference]: With dead ends: 29109 [2019-10-02 14:06:50,464 INFO L226 Difference]: Without dead ends: 28454 [2019-10-02 14:06:50,483 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-02 14:06:50,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28454 states. [2019-10-02 14:06:52,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28454 to 27586. [2019-10-02 14:06:52,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27586 states. [2019-10-02 14:06:52,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27586 states to 27586 states and 44465 transitions. [2019-10-02 14:06:52,202 INFO L78 Accepts]: Start accepts. Automaton has 27586 states and 44465 transitions. Word has length 296 [2019-10-02 14:06:52,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:06:52,202 INFO L475 AbstractCegarLoop]: Abstraction has 27586 states and 44465 transitions. [2019-10-02 14:06:52,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 14:06:52,202 INFO L276 IsEmpty]: Start isEmpty. Operand 27586 states and 44465 transitions. [2019-10-02 14:06:52,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-10-02 14:06:52,267 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:06:52,268 INFO L411 BasicCegarLoop]: trace histogram [3, 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, 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] [2019-10-02 14:06:52,268 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:06:52,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:06:52,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1373561289, now seen corresponding path program 1 times [2019-10-02 14:06:52,269 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:06:52,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:06:52,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:06:52,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:06:52,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:06:52,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:06:52,474 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-02 14:06:52,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:06:52,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 14:06:52,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:06:52,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:06:52,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:06:52,476 INFO L87 Difference]: Start difference. First operand 27586 states and 44465 transitions. Second operand 9 states. [2019-10-02 14:06:53,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:06:53,331 INFO L93 Difference]: Finished difference Result 28315 states and 45477 transitions. [2019-10-02 14:06:53,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 14:06:53,332 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 299 [2019-10-02 14:06:53,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:06:53,428 INFO L225 Difference]: With dead ends: 28315 [2019-10-02 14:06:53,429 INFO L226 Difference]: Without dead ends: 27850 [2019-10-02 14:06:53,447 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-02 14:06:53,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27850 states. [2019-10-02 14:06:55,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27850 to 27678. [2019-10-02 14:06:55,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27678 states. [2019-10-02 14:06:55,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27678 states to 27678 states and 44621 transitions. [2019-10-02 14:06:55,096 INFO L78 Accepts]: Start accepts. Automaton has 27678 states and 44621 transitions. Word has length 299 [2019-10-02 14:06:55,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:06:55,096 INFO L475 AbstractCegarLoop]: Abstraction has 27678 states and 44621 transitions. [2019-10-02 14:06:55,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:06:55,097 INFO L276 IsEmpty]: Start isEmpty. Operand 27678 states and 44621 transitions. [2019-10-02 14:06:55,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-10-02 14:06:55,163 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:06:55,163 INFO L411 BasicCegarLoop]: trace histogram [3, 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, 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] [2019-10-02 14:06:55,164 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:06:55,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:06:55,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1242096430, now seen corresponding path program 1 times [2019-10-02 14:06:55,164 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:06:55,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:06:55,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:06:55,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:06:55,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:06:55,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:06:55,492 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-10-02 14:06:55,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:06:55,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-02 14:06:55,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 14:06:55,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 14:06:55,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-10-02 14:06:55,493 INFO L87 Difference]: Start difference. First operand 27678 states and 44621 transitions. Second operand 18 states. [2019-10-02 14:06:58,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:06:58,515 INFO L93 Difference]: Finished difference Result 28015 states and 45014 transitions. [2019-10-02 14:06:58,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 14:06:58,517 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 297 [2019-10-02 14:06:58,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:06:58,606 INFO L225 Difference]: With dead ends: 28015 [2019-10-02 14:06:58,606 INFO L226 Difference]: Without dead ends: 27958 [2019-10-02 14:06:58,623 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=956, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 14:06:58,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27958 states. [2019-10-02 14:07:00,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27958 to 27736. [2019-10-02 14:07:00,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27736 states. [2019-10-02 14:07:00,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27736 states to 27736 states and 44689 transitions. [2019-10-02 14:07:00,137 INFO L78 Accepts]: Start accepts. Automaton has 27736 states and 44689 transitions. Word has length 297 [2019-10-02 14:07:00,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:07:00,137 INFO L475 AbstractCegarLoop]: Abstraction has 27736 states and 44689 transitions. [2019-10-02 14:07:00,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 14:07:00,137 INFO L276 IsEmpty]: Start isEmpty. Operand 27736 states and 44689 transitions. [2019-10-02 14:07:00,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-10-02 14:07:00,211 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:07:00,212 INFO L411 BasicCegarLoop]: trace histogram [3, 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, 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] [2019-10-02 14:07:00,212 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:07:00,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:07:00,212 INFO L82 PathProgramCache]: Analyzing trace with hash 983921734, now seen corresponding path program 1 times [2019-10-02 14:07:00,213 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:07:00,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:07:00,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:07:00,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:07:00,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:07:00,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:07:00,896 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 32 proven. 11 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 14:07:00,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:07:00,897 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 14:07:01,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:07:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:07:01,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 3081 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 14:07:01,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:07:01,719 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-02 14:07:01,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:07:01,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [36] total 41 [2019-10-02 14:07:01,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-02 14:07:01,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-02 14:07:01,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1552, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 14:07:01,728 INFO L87 Difference]: Start difference. First operand 27736 states and 44689 transitions. Second operand 41 states. [2019-10-02 14:07:19,788 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 17 [2019-10-02 14:07:59,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:07:59,967 INFO L93 Difference]: Finished difference Result 103740 states and 161382 transitions. [2019-10-02 14:07:59,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 248 states. [2019-10-02 14:07:59,968 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 294 [2019-10-02 14:07:59,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:08:00,231 INFO L225 Difference]: With dead ends: 103740 [2019-10-02 14:08:00,232 INFO L226 Difference]: Without dead ends: 76082 [2019-10-02 14:08:00,347 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 684 GetRequests, 400 SyntacticMatches, 0 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29772 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=4785, Invalid=76725, Unknown=0, NotChecked=0, Total=81510 [2019-10-02 14:08:00,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76082 states. [2019-10-02 14:08:05,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76082 to 63193. [2019-10-02 14:08:05,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63193 states. [2019-10-02 14:08:06,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63193 states to 63193 states and 99392 transitions. [2019-10-02 14:08:06,149 INFO L78 Accepts]: Start accepts. Automaton has 63193 states and 99392 transitions. Word has length 294 [2019-10-02 14:08:06,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:08:06,150 INFO L475 AbstractCegarLoop]: Abstraction has 63193 states and 99392 transitions. [2019-10-02 14:08:06,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-02 14:08:06,150 INFO L276 IsEmpty]: Start isEmpty. Operand 63193 states and 99392 transitions. [2019-10-02 14:08:06,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-10-02 14:08:06,347 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:08:06,348 INFO L411 BasicCegarLoop]: trace histogram [3, 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, 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] [2019-10-02 14:08:06,348 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:08:06,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:08:06,348 INFO L82 PathProgramCache]: Analyzing trace with hash 781201952, now seen corresponding path program 1 times [2019-10-02 14:08:06,349 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:08:06,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:08:06,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:08:06,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:08:06,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:08:06,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:08:06,701 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-10-02 14:08:06,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:08:06,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-02 14:08:06,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 14:08:06,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 14:08:06,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-10-02 14:08:06,703 INFO L87 Difference]: Start difference. First operand 63193 states and 99392 transitions. Second operand 18 states. [2019-10-02 14:08:09,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:08:09,938 INFO L93 Difference]: Finished difference Result 63291 states and 99513 transitions. [2019-10-02 14:08:09,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-02 14:08:09,938 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 296 [2019-10-02 14:08:09,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:08:10,119 INFO L225 Difference]: With dead ends: 63291 [2019-10-02 14:08:10,120 INFO L226 Difference]: Without dead ends: 63213 [2019-10-02 14:08:10,150 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=784, Unknown=0, NotChecked=0, Total=870 [2019-10-02 14:08:10,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63213 states. [2019-10-02 14:08:13,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63213 to 61994. [2019-10-02 14:08:13,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61994 states. [2019-10-02 14:08:13,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61994 states to 61994 states and 97785 transitions. [2019-10-02 14:08:13,406 INFO L78 Accepts]: Start accepts. Automaton has 61994 states and 97785 transitions. Word has length 296 [2019-10-02 14:08:13,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:08:13,407 INFO L475 AbstractCegarLoop]: Abstraction has 61994 states and 97785 transitions. [2019-10-02 14:08:13,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 14:08:13,407 INFO L276 IsEmpty]: Start isEmpty. Operand 61994 states and 97785 transitions. [2019-10-02 14:08:13,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-10-02 14:08:13,565 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:08:13,565 INFO L411 BasicCegarLoop]: trace histogram [3, 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, 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 14:08:13,565 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:08:13,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:08:13,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1854757246, now seen corresponding path program 1 times [2019-10-02 14:08:13,566 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:08:13,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:08:13,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:08:13,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:08:13,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:08:13,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:08:13,859 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-10-02 14:08:13,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:08:13,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-02 14:08:13,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 14:08:13,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 14:08:13,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-10-02 14:08:13,860 INFO L87 Difference]: Start difference. First operand 61994 states and 97785 transitions. Second operand 18 states. [2019-10-02 14:08:19,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:08:19,611 INFO L93 Difference]: Finished difference Result 62956 states and 99000 transitions. [2019-10-02 14:08:19,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 14:08:19,612 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 301 [2019-10-02 14:08:19,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:08:19,758 INFO L225 Difference]: With dead ends: 62956 [2019-10-02 14:08:19,758 INFO L226 Difference]: Without dead ends: 62906 [2019-10-02 14:08:19,777 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=956, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 14:08:19,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62906 states. [2019-10-02 14:08:22,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62906 to 62858. [2019-10-02 14:08:22,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62858 states. [2019-10-02 14:08:22,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62858 states to 62858 states and 98877 transitions. [2019-10-02 14:08:22,827 INFO L78 Accepts]: Start accepts. Automaton has 62858 states and 98877 transitions. Word has length 301 [2019-10-02 14:08:22,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:08:22,828 INFO L475 AbstractCegarLoop]: Abstraction has 62858 states and 98877 transitions. [2019-10-02 14:08:22,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 14:08:22,828 INFO L276 IsEmpty]: Start isEmpty. Operand 62858 states and 98877 transitions. [2019-10-02 14:08:22,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-10-02 14:08:22,990 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:08:22,990 INFO L411 BasicCegarLoop]: trace histogram [3, 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, 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] [2019-10-02 14:08:22,991 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:08:22,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:08:22,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1617079784, now seen corresponding path program 1 times [2019-10-02 14:08:22,991 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:08:22,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:08:22,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:08:22,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:08:22,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:08:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:08:23,199 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-10-02 14:08:23,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:08:23,199 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 14:08:23,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:08:23,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:08:23,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 3082 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 14:08:23,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:08:23,872 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-02 14:08:23,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:08:23,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2019-10-02 14:08:23,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 14:08:23,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 14:08:23,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:08:23,886 INFO L87 Difference]: Start difference. First operand 62858 states and 98877 transitions. Second operand 11 states. [2019-10-02 14:08:34,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:08:34,190 INFO L93 Difference]: Finished difference Result 138720 states and 199849 transitions. [2019-10-02 14:08:34,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 14:08:34,191 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 296 [2019-10-02 14:08:34,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:08:34,524 INFO L225 Difference]: With dead ends: 138720 [2019-10-02 14:08:34,524 INFO L226 Difference]: Without dead ends: 105194 [2019-10-02 14:08:34,609 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2019-10-02 14:08:34,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105194 states. [2019-10-02 14:08:42,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105194 to 99834. [2019-10-02 14:08:42,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99834 states. [2019-10-02 14:08:42,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99834 states to 99834 states and 149090 transitions. [2019-10-02 14:08:42,321 INFO L78 Accepts]: Start accepts. Automaton has 99834 states and 149090 transitions. Word has length 296 [2019-10-02 14:08:42,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:08:42,322 INFO L475 AbstractCegarLoop]: Abstraction has 99834 states and 149090 transitions. [2019-10-02 14:08:42,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 14:08:42,322 INFO L276 IsEmpty]: Start isEmpty. Operand 99834 states and 149090 transitions. [2019-10-02 14:08:42,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-10-02 14:08:42,565 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:08:42,565 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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, 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] [2019-10-02 14:08:42,565 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:08:42,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:08:42,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1926606139, now seen corresponding path program 1 times [2019-10-02 14:08:42,566 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:08:42,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:08:42,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:08:42,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:08:42,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:08:42,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:08:42,891 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-10-02 14:08:42,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:08:42,891 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:08:43,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:08:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:08:43,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 3137 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 14:08:43,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:08:43,955 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-10-02 14:08:43,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:08:43,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 5] total 21 [2019-10-02 14:08:43,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-02 14:08:43,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-02 14:08:43,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=378, Unknown=0, NotChecked=0, Total=420 [2019-10-02 14:08:43,965 INFO L87 Difference]: Start difference. First operand 99834 states and 149090 transitions. Second operand 21 states. [2019-10-02 14:08:48,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:08:48,350 INFO L93 Difference]: Finished difference Result 141554 states and 205525 transitions. [2019-10-02 14:08:48,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 14:08:48,351 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 314 [2019-10-02 14:08:48,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:08:48,632 INFO L225 Difference]: With dead ends: 141554 [2019-10-02 14:08:48,632 INFO L226 Difference]: Without dead ends: 73430 [2019-10-02 14:08:48,765 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=686, Unknown=0, NotChecked=0, Total=756 [2019-10-02 14:08:48,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73430 states. [2019-10-02 14:08:55,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73430 to 53002. [2019-10-02 14:08:55,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53002 states. [2019-10-02 14:08:55,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53002 states to 53002 states and 86511 transitions. [2019-10-02 14:08:55,430 INFO L78 Accepts]: Start accepts. Automaton has 53002 states and 86511 transitions. Word has length 314 [2019-10-02 14:08:55,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:08:55,430 INFO L475 AbstractCegarLoop]: Abstraction has 53002 states and 86511 transitions. [2019-10-02 14:08:55,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-02 14:08:55,430 INFO L276 IsEmpty]: Start isEmpty. Operand 53002 states and 86511 transitions. [2019-10-02 14:08:55,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-10-02 14:08:55,591 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:08:55,592 INFO L411 BasicCegarLoop]: trace histogram [3, 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, 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] [2019-10-02 14:08:55,592 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:08:55,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:08:55,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1282686342, now seen corresponding path program 1 times [2019-10-02 14:08:55,592 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:08:55,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:08:55,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:08:55,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:08:55,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:08:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:08:55,763 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-02 14:08:55,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:08:55,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:08:55,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:08:55,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:08:55,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:08:55,765 INFO L87 Difference]: Start difference. First operand 53002 states and 86511 transitions. Second operand 3 states. [2019-10-02 14:09:00,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:09:00,544 INFO L93 Difference]: Finished difference Result 140407 states and 234156 transitions. [2019-10-02 14:09:00,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:09:00,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-10-02 14:09:00,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:09:00,869 INFO L225 Difference]: With dead ends: 140407 [2019-10-02 14:09:00,869 INFO L226 Difference]: Without dead ends: 88514 [2019-10-02 14:09:00,981 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 14:09:01,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88514 states. [2019-10-02 14:09:09,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88514 to 88494. [2019-10-02 14:09:09,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88494 states. [2019-10-02 14:09:09,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88494 states to 88494 states and 148147 transitions. [2019-10-02 14:09:09,827 INFO L78 Accepts]: Start accepts. Automaton has 88494 states and 148147 transitions. Word has length 310 [2019-10-02 14:09:09,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:09:09,828 INFO L475 AbstractCegarLoop]: Abstraction has 88494 states and 148147 transitions. [2019-10-02 14:09:09,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:09:09,828 INFO L276 IsEmpty]: Start isEmpty. Operand 88494 states and 148147 transitions. [2019-10-02 14:09:10,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-10-02 14:09:10,146 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:09:10,146 INFO L411 BasicCegarLoop]: trace histogram [3, 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, 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] [2019-10-02 14:09:10,146 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:09:10,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:09:10,146 INFO L82 PathProgramCache]: Analyzing trace with hash 132356694, now seen corresponding path program 1 times [2019-10-02 14:09:10,146 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:09:10,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:09:10,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:09:10,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:09:10,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:09:10,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:09:10,645 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-02 14:09:10,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:09:10,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:09:10,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:09:10,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:09:10,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:09:10,647 INFO L87 Difference]: Start difference. First operand 88494 states and 148147 transitions. Second operand 3 states. [2019-10-02 14:09:20,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:09:20,837 INFO L93 Difference]: Finished difference Result 241355 states and 410328 transitions. [2019-10-02 14:09:20,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:09:20,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-10-02 14:09:20,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:09:21,276 INFO L225 Difference]: With dead ends: 241355 [2019-10-02 14:09:21,276 INFO L226 Difference]: Without dead ends: 154214 [2019-10-02 14:09:21,428 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:09:21,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154214 states. [2019-10-02 14:09:32,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154214 to 154194. [2019-10-02 14:09:32,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154194 states. [2019-10-02 14:09:32,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154194 states to 154194 states and 262001 transitions. [2019-10-02 14:09:32,848 INFO L78 Accepts]: Start accepts. Automaton has 154194 states and 262001 transitions. Word has length 312 [2019-10-02 14:09:32,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:09:32,849 INFO L475 AbstractCegarLoop]: Abstraction has 154194 states and 262001 transitions. [2019-10-02 14:09:32,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:09:32,850 INFO L276 IsEmpty]: Start isEmpty. Operand 154194 states and 262001 transitions. [2019-10-02 14:09:33,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-10-02 14:09:33,548 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:09:33,548 INFO L411 BasicCegarLoop]: trace histogram [3, 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, 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] [2019-10-02 14:09:33,549 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:09:33,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:09:33,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1956286243, now seen corresponding path program 1 times [2019-10-02 14:09:33,549 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:09:33,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:09:33,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:09:33,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:09:33,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:09:33,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:09:33,709 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-02 14:09:33,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:09:33,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:09:33,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:09:33,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:09:33,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:09:33,711 INFO L87 Difference]: Start difference. First operand 154194 states and 262001 transitions. Second operand 3 states. [2019-10-02 14:09:55,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:09:55,871 INFO L93 Difference]: Finished difference Result 440155 states and 753492 transitions. [2019-10-02 14:09:55,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:09:55,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-10-02 14:09:55,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:09:56,813 INFO L225 Difference]: With dead ends: 440155 [2019-10-02 14:09:56,813 INFO L226 Difference]: Without dead ends: 287506 [2019-10-02 14:09:57,089 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 14:09:57,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287506 states. [2019-10-02 14:10:24,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287506 to 287486. [2019-10-02 14:10:24,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287486 states. [2019-10-02 14:10:25,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287486 states to 287486 states and 489525 transitions. [2019-10-02 14:10:25,824 INFO L78 Accepts]: Start accepts. Automaton has 287486 states and 489525 transitions. Word has length 312 [2019-10-02 14:10:25,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:10:25,825 INFO L475 AbstractCegarLoop]: Abstraction has 287486 states and 489525 transitions. [2019-10-02 14:10:25,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:10:25,825 INFO L276 IsEmpty]: Start isEmpty. Operand 287486 states and 489525 transitions. [2019-10-02 14:10:27,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-10-02 14:10:27,303 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:10:27,304 INFO L411 BasicCegarLoop]: trace histogram [3, 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, 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] [2019-10-02 14:10:27,304 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:10:27,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:10:27,305 INFO L82 PathProgramCache]: Analyzing trace with hash 822660471, now seen corresponding path program 1 times [2019-10-02 14:10:27,305 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:10:27,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:10:27,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:10:27,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:10:27,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:10:27,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:10:27,454 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-02 14:10:27,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:10:27,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:10:27,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:10:27,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:10:27,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:10:27,456 INFO L87 Difference]: Start difference. First operand 287486 states and 489525 transitions. Second operand 3 states. [2019-10-02 14:11:11,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:11:11,256 INFO L93 Difference]: Finished difference Result 819195 states and 1398718 transitions. [2019-10-02 14:11:11,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:11:11,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-10-02 14:11:11,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:11:13,065 INFO L225 Difference]: With dead ends: 819195 [2019-10-02 14:11:13,065 INFO L226 Difference]: Without dead ends: 533558 [2019-10-02 14:11:14,304 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 14:11:14,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533558 states. [2019-10-02 14:12:12,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533558 to 533538. [2019-10-02 14:12:12,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533538 states. [2019-10-02 14:12:23,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533538 states to 533538 states and 903577 transitions. [2019-10-02 14:12:23,985 INFO L78 Accepts]: Start accepts. Automaton has 533538 states and 903577 transitions. Word has length 314 [2019-10-02 14:12:23,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:12:23,986 INFO L475 AbstractCegarLoop]: Abstraction has 533538 states and 903577 transitions. [2019-10-02 14:12:23,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:12:23,986 INFO L276 IsEmpty]: Start isEmpty. Operand 533538 states and 903577 transitions. [2019-10-02 14:12:26,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-10-02 14:12:26,720 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:12:26,720 INFO L411 BasicCegarLoop]: trace histogram [3, 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, 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] [2019-10-02 14:12:26,720 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:12:26,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:12:26,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1195526014, now seen corresponding path program 1 times [2019-10-02 14:12:26,721 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:12:26,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:12:26,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:12:26,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:12:26,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:12:26,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:12:26,873 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-02 14:12:26,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:12:26,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:12:26,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:12:26,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:12:26,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:12:26,877 INFO L87 Difference]: Start difference. First operand 533538 states and 903577 transitions. Second operand 3 states. [2019-10-02 14:13:53,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:13:53,586 INFO L93 Difference]: Finished difference Result 1531959 states and 2602920 transitions. [2019-10-02 14:13:53,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:13:53,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-10-02 14:13:53,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:13:57,252 INFO L225 Difference]: With dead ends: 1531959 [2019-10-02 14:13:57,253 INFO L226 Difference]: Without dead ends: 1000682 [2019-10-02 14:13:58,170 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 14:14:00,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000682 states.