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_spec8_product22.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 13:58:01,662 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 13:58:01,666 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 13:58:01,686 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 13:58:01,686 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 13:58:01,688 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 13:58:01,690 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 13:58:01,700 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 13:58:01,704 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 13:58:01,707 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 13:58:01,708 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 13:58:01,709 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 13:58:01,709 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 13:58:01,710 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 13:58:01,710 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 13:58:01,711 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 13:58:01,712 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 13:58:01,713 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 13:58:01,714 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 13:58:01,717 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 13:58:01,718 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 13:58:01,719 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 13:58:01,721 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 13:58:01,722 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 13:58:01,726 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 13:58:01,726 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 13:58:01,726 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 13:58:01,727 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 13:58:01,730 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 13:58:01,733 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 13:58:01,733 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 13:58:01,734 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 13:58:01,734 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 13:58:01,735 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 13:58:01,739 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 13:58:01,739 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 13:58:01,740 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 13:58:01,741 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 13:58:01,741 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 13:58:01,743 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 13:58:01,743 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 13:58:01,745 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 13:58:01,782 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 13:58:01,782 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 13:58:01,785 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 13:58:01,785 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 13:58:01,785 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 13:58:01,786 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 13:58:01,786 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 13:58:01,788 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 13:58:01,788 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 13:58:01,789 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 13:58:01,789 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 13:58:01,789 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 13:58:01,789 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 13:58:01,789 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 13:58:01,790 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 13:58:01,790 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 13:58:01,790 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 13:58:01,790 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 13:58:01,790 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 13:58:01,791 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 13:58:01,791 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 13:58:01,791 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 13:58:01,791 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 13:58:01,791 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 13:58:01,792 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 13:58:01,792 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 13:58:01,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 13:58:01,792 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 13:58:01,792 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 13:58:01,820 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 13:58:01,834 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 13:58:01,840 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 13:58:01,842 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 13:58:01,842 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 13:58:01,843 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec8_product22.cil.c [2019-10-02 13:58:01,904 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e0ac680f/fa7aa4daa0464b318229572f8bd833de/FLAG4d2e94648 [2019-10-02 13:58:02,482 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 13:58:02,483 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec8_product22.cil.c [2019-10-02 13:58:02,507 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e0ac680f/fa7aa4daa0464b318229572f8bd833de/FLAG4d2e94648 [2019-10-02 13:58:02,706 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e0ac680f/fa7aa4daa0464b318229572f8bd833de [2019-10-02 13:58:02,716 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 13:58:02,718 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 13:58:02,718 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 13:58:02,719 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 13:58:02,721 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 13:58:02,722 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:58:02" (1/1) ... [2019-10-02 13:58:02,724 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7156f2de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:58:02, skipping insertion in model container [2019-10-02 13:58:02,724 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:58:02" (1/1) ... [2019-10-02 13:58:02,730 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 13:58:02,818 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 13:58:03,584 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:58:03,609 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 13:58:03,713 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:58:03,815 INFO L192 MainTranslator]: Completed translation [2019-10-02 13:58:03,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:58:03 WrapperNode [2019-10-02 13:58:03,816 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 13:58:03,817 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 13:58:03,817 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 13:58:03,817 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 13:58:03,831 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:58:03" (1/1) ... [2019-10-02 13:58:03,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:58:03" (1/1) ... [2019-10-02 13:58:03,860 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:58:03" (1/1) ... [2019-10-02 13:58:03,860 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:58:03" (1/1) ... [2019-10-02 13:58:03,930 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:58:03" (1/1) ... [2019-10-02 13:58:03,967 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:58:03" (1/1) ... [2019-10-02 13:58:03,980 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:58:03" (1/1) ... [2019-10-02 13:58:03,996 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 13:58:03,996 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 13:58:03,997 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 13:58:03,997 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 13:58:03,998 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:58:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 13:58:04,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 13:58:04,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 13:58:04,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 13:58:04,099 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 13:58:04,100 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 13:58:04,100 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 13:58:04,101 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 13:58:04,101 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 13:58:04,102 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 13:58:04,103 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 13:58:04,103 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 13:58:04,103 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 13:58:04,104 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 13:58:04,104 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 13:58:04,106 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 13:58:04,106 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 13:58:04,109 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 13:58:04,109 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 13:58:04,110 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 13:58:04,110 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 13:58:04,110 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 13:58:04,111 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 13:58:04,111 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-02 13:58:04,111 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-02 13:58:04,112 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 13:58:04,112 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 13:58:04,112 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 13:58:04,113 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 13:58:04,113 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 13:58:04,113 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 13:58:04,113 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 13:58:04,114 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 13:58:04,114 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 13:58:04,114 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 13:58:04,115 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 13:58:04,115 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 13:58:04,115 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 13:58:04,115 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 13:58:04,116 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 13:58:04,116 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 13:58:04,116 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 13:58:04,117 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 13:58:04,117 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 13:58:04,117 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 13:58:04,117 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 13:58:04,118 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 13:58:04,118 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 13:58:04,119 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 13:58:04,119 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 13:58:04,119 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 13:58:04,119 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 13:58:04,120 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 13:58:04,120 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 13:58:04,120 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 13:58:04,121 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 13:58:04,121 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 13:58:04,121 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 13:58:04,121 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 13:58:04,122 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-10-02 13:58:04,122 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AutoResponder [2019-10-02 13:58:04,123 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-10-02 13:58:04,123 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 13:58:04,123 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 13:58:04,123 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 13:58:04,124 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 13:58:04,124 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 13:58:04,124 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 13:58:04,125 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 13:58:04,125 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 13:58:04,125 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 13:58:04,126 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-02 13:58:04,126 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-02 13:58:04,126 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 13:58:04,126 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 13:58:04,127 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 13:58:04,128 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 13:58:04,128 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 13:58:04,128 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 13:58:04,128 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 13:58:04,129 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 13:58:04,129 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 13:58:04,129 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 13:58:04,130 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 13:58:04,130 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 13:58:04,131 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 13:58:04,131 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 13:58:04,131 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 13:58:04,132 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 13:58:04,133 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 13:58:04,133 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 13:58:04,133 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 13:58:04,134 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 13:58:04,134 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 13:58:04,135 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 13:58:04,135 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 13:58:04,135 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 13:58:04,135 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 13:58:04,136 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 13:58:04,136 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 13:58:04,136 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 13:58:04,136 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 13:58:04,136 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 13:58:04,137 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 13:58:04,137 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 13:58:04,137 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 13:58:04,137 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 13:58:04,138 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 13:58:04,138 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 13:58:04,138 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 13:58:04,138 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 13:58:04,139 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 13:58:04,139 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptAutoResponder_spec__1 [2019-10-02 13:58:04,139 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptAutoResponder_spec__2 [2019-10-02 13:58:04,140 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 13:58:04,140 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 13:58:04,140 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 13:58:04,140 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 13:58:04,141 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 13:58:04,141 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 13:58:04,141 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 13:58:04,142 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 13:58:04,142 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 13:58:04,142 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 13:58:04,143 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 13:58:04,144 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 13:58:04,145 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 13:58:04,145 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 13:58:04,145 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 13:58:04,145 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 13:58:04,146 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 13:58:04,146 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 13:58:04,146 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 13:58:04,147 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 13:58:04,147 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 13:58:04,147 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 13:58:04,148 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 13:58:04,148 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 13:58:04,148 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 13:58:04,148 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 13:58:04,149 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 13:58:04,154 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 13:58:04,155 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 13:58:04,155 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 13:58:04,156 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 13:58:04,164 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 13:58:04,164 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 13:58:04,164 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 13:58:04,165 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 13:58:04,165 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 13:58:04,165 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 13:58:04,165 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 13:58:04,165 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 13:58:04,165 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-02 13:58:04,165 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-02 13:58:04,165 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 13:58:04,166 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 13:58:04,166 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 13:58:04,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 13:58:04,166 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 13:58:04,167 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 13:58:04,167 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 13:58:04,167 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 13:58:04,167 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 13:58:04,167 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 13:58:04,168 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 13:58:04,168 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 13:58:04,168 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 13:58:04,168 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 13:58:04,168 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 13:58:04,168 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 13:58:04,169 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 13:58:04,169 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 13:58:04,169 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 13:58:04,169 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 13:58:04,169 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 13:58:04,170 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 13:58:04,170 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 13:58:04,170 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 13:58:04,170 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 13:58:04,171 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 13:58:04,171 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 13:58:04,171 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 13:58:04,171 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 13:58:04,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 13:58:04,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 13:58:04,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 13:58:04,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 13:58:04,172 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 13:58:04,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 13:58:04,173 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 13:58:04,173 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 13:58:04,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 13:58:04,174 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 13:58:04,174 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 13:58:04,174 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 13:58:04,175 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 13:58:04,175 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 13:58:04,175 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 13:58:04,175 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 13:58:04,176 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 13:58:04,176 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 13:58:04,176 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 13:58:04,176 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 13:58:04,176 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 13:58:04,177 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 13:58:04,177 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 13:58:04,177 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 13:58:04,177 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 13:58:04,178 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 13:58:04,178 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 13:58:04,178 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 13:58:04,178 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-02 13:58:04,178 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-02 13:58:04,179 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptAutoResponder_spec__2 [2019-10-02 13:58:04,179 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 13:58:04,179 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-10-02 13:58:04,179 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AutoResponder [2019-10-02 13:58:04,180 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-10-02 13:58:04,180 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptAutoResponder_spec__1 [2019-10-02 13:58:04,180 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 13:58:04,180 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 13:58:04,180 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 13:58:04,181 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 13:58:04,181 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 13:58:04,181 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 13:58:04,181 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 13:58:04,181 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 13:58:04,181 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 13:58:04,182 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 13:58:04,182 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 13:58:04,182 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 13:58:04,182 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 13:58:04,183 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 13:58:04,183 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 13:58:04,183 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 13:58:04,184 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 13:58:04,184 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 13:58:04,184 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 13:58:04,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 13:58:04,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 13:58:04,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 13:58:06,490 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 13:58:06,490 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 13:58:06,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:58:06 BoogieIcfgContainer [2019-10-02 13:58:06,492 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 13:58:06,494 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 13:58:06,494 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 13:58:06,497 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 13:58:06,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:58:02" (1/3) ... [2019-10-02 13:58:06,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67044a1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:58:06, skipping insertion in model container [2019-10-02 13:58:06,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:58:03" (2/3) ... [2019-10-02 13:58:06,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67044a1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:58:06, skipping insertion in model container [2019-10-02 13:58:06,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:58:06" (3/3) ... [2019-10-02 13:58:06,501 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec8_product22.cil.c [2019-10-02 13:58:06,512 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 13:58:06,528 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 13:58:06,546 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 13:58:06,589 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 13:58:06,590 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 13:58:06,590 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 13:58:06,590 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 13:58:06,590 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 13:58:06,590 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 13:58:06,591 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 13:58:06,591 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 13:58:06,591 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 13:58:06,632 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states. [2019-10-02 13:58:06,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-02 13:58:06,668 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:58:06,670 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 13:58:06,674 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:58:06,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:58:06,683 INFO L82 PathProgramCache]: Analyzing trace with hash 145305660, now seen corresponding path program 1 times [2019-10-02 13:58:06,686 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:58:06,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:58:06,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:58:06,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:58:06,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:58:07,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:58:07,328 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 13:58:07,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:58:07,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 13:58:07,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 13:58:07,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 13:58:07,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 13:58:07,354 INFO L87 Difference]: Start difference. First operand 512 states. Second operand 2 states. [2019-10-02 13:58:07,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:58:07,481 INFO L93 Difference]: Finished difference Result 755 states and 991 transitions. [2019-10-02 13:58:07,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 13:58:07,483 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 145 [2019-10-02 13:58:07,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:58:07,527 INFO L225 Difference]: With dead ends: 755 [2019-10-02 13:58:07,527 INFO L226 Difference]: Without dead ends: 489 [2019-10-02 13:58:07,539 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 13:58:07,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2019-10-02 13:58:07,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 489. [2019-10-02 13:58:07,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2019-10-02 13:58:07,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 647 transitions. [2019-10-02 13:58:07,716 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 647 transitions. Word has length 145 [2019-10-02 13:58:07,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:58:07,719 INFO L475 AbstractCegarLoop]: Abstraction has 489 states and 647 transitions. [2019-10-02 13:58:07,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 13:58:07,719 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 647 transitions. [2019-10-02 13:58:07,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-02 13:58:07,731 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:58:07,732 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 13:58:07,732 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:58:07,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:58:07,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1475603101, now seen corresponding path program 1 times [2019-10-02 13:58:07,733 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:58:07,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:58:07,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:58:07,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:58:07,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:58:07,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:58:07,974 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 13:58:07,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:58:07,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:58:07,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:58:07,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:58:07,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:58:07,979 INFO L87 Difference]: Start difference. First operand 489 states and 647 transitions. Second operand 3 states. [2019-10-02 13:58:08,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:58:08,027 INFO L93 Difference]: Finished difference Result 738 states and 960 transitions. [2019-10-02 13:58:08,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:58:08,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-10-02 13:58:08,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:58:08,032 INFO L225 Difference]: With dead ends: 738 [2019-10-02 13:58:08,032 INFO L226 Difference]: Without dead ends: 492 [2019-10-02 13:58:08,034 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:58:08,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2019-10-02 13:58:08,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 491. [2019-10-02 13:58:08,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2019-10-02 13:58:08,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 649 transitions. [2019-10-02 13:58:08,074 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 649 transitions. Word has length 146 [2019-10-02 13:58:08,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:58:08,075 INFO L475 AbstractCegarLoop]: Abstraction has 491 states and 649 transitions. [2019-10-02 13:58:08,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:58:08,075 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 649 transitions. [2019-10-02 13:58:08,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-02 13:58:08,082 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:58:08,082 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 13:58:08,082 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:58:08,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:58:08,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1631744993, now seen corresponding path program 1 times [2019-10-02 13:58:08,083 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:58:08,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:58:08,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:58:08,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:58:08,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:58:08,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:58:08,284 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 13:58:08,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:58:08,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:58:08,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:58:08,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:58:08,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:58:08,286 INFO L87 Difference]: Start difference. First operand 491 states and 649 transitions. Second operand 3 states. [2019-10-02 13:58:08,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:58:08,322 INFO L93 Difference]: Finished difference Result 960 states and 1299 transitions. [2019-10-02 13:58:08,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:58:08,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-10-02 13:58:08,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:58:08,327 INFO L225 Difference]: With dead ends: 960 [2019-10-02 13:58:08,327 INFO L226 Difference]: Without dead ends: 534 [2019-10-02 13:58:08,329 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:58:08,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-10-02 13:58:08,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 533. [2019-10-02 13:58:08,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2019-10-02 13:58:08,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 721 transitions. [2019-10-02 13:58:08,383 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 721 transitions. Word has length 158 [2019-10-02 13:58:08,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:58:08,385 INFO L475 AbstractCegarLoop]: Abstraction has 533 states and 721 transitions. [2019-10-02 13:58:08,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:58:08,386 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 721 transitions. [2019-10-02 13:58:08,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-02 13:58:08,396 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:58:08,397 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 13:58:08,397 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:58:08,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:58:08,398 INFO L82 PathProgramCache]: Analyzing trace with hash 34916284, now seen corresponding path program 1 times [2019-10-02 13:58:08,398 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:58:08,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:58:08,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:58:08,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:58:08,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:58:08,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:58:08,784 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 13:58:08,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:58:08,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:58:08,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:58:08,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:58:08,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:58:08,789 INFO L87 Difference]: Start difference. First operand 533 states and 721 transitions. Second operand 3 states. [2019-10-02 13:58:08,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:58:08,845 INFO L93 Difference]: Finished difference Result 1083 states and 1510 transitions. [2019-10-02 13:58:08,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:58:08,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-10-02 13:58:08,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:58:08,853 INFO L225 Difference]: With dead ends: 1083 [2019-10-02 13:58:08,853 INFO L226 Difference]: Without dead ends: 615 [2019-10-02 13:58:08,856 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:58:08,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2019-10-02 13:58:08,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 614. [2019-10-02 13:58:08,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-10-02 13:58:08,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 859 transitions. [2019-10-02 13:58:08,902 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 859 transitions. Word has length 159 [2019-10-02 13:58:08,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:58:08,903 INFO L475 AbstractCegarLoop]: Abstraction has 614 states and 859 transitions. [2019-10-02 13:58:08,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:58:08,903 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 859 transitions. [2019-10-02 13:58:08,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-02 13:58:08,911 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:58:08,912 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 13:58:08,912 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:58:08,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:58:08,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1085880483, now seen corresponding path program 1 times [2019-10-02 13:58:08,913 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:58:08,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:58:08,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:58:08,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:58:08,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:58:08,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:58:09,122 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 13:58:09,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:58:09,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:58:09,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:58:09,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:58:09,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:58:09,124 INFO L87 Difference]: Start difference. First operand 614 states and 859 transitions. Second operand 3 states. [2019-10-02 13:58:09,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:58:09,165 INFO L93 Difference]: Finished difference Result 924 states and 1264 transitions. [2019-10-02 13:58:09,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:58:09,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2019-10-02 13:58:09,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:58:09,170 INFO L225 Difference]: With dead ends: 924 [2019-10-02 13:58:09,170 INFO L226 Difference]: Without dead ends: 680 [2019-10-02 13:58:09,171 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 13:58:09,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2019-10-02 13:58:09,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 680. [2019-10-02 13:58:09,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2019-10-02 13:58:09,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 947 transitions. [2019-10-02 13:58:09,209 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 947 transitions. Word has length 162 [2019-10-02 13:58:09,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:58:09,211 INFO L475 AbstractCegarLoop]: Abstraction has 680 states and 947 transitions. [2019-10-02 13:58:09,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:58:09,211 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 947 transitions. [2019-10-02 13:58:09,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-10-02 13:58:09,217 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:58:09,218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:58:09,218 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:58:09,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:58:09,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1436879733, now seen corresponding path program 1 times [2019-10-02 13:58:09,219 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:58:09,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:58:09,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:58:09,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:58:09,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:58:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:58:09,837 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 13:58:09,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:58:09,838 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:58:09,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:58:10,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:58:10,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 3065 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:58:10,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:58:10,908 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 13:58:10,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:58:10,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [22] total 29 [2019-10-02 13:58:10,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-02 13:58:10,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-02 13:58:10,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=746, Unknown=0, NotChecked=0, Total=812 [2019-10-02 13:58:10,931 INFO L87 Difference]: Start difference. First operand 680 states and 947 transitions. Second operand 29 states. [2019-10-02 13:58:36,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:58:36,246 INFO L93 Difference]: Finished difference Result 3185 states and 4443 transitions. [2019-10-02 13:58:36,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-10-02 13:58:36,247 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 280 [2019-10-02 13:58:36,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:58:36,261 INFO L225 Difference]: With dead ends: 3185 [2019-10-02 13:58:36,261 INFO L226 Difference]: Without dead ends: 2535 [2019-10-02 13:58:36,269 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5318 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1357, Invalid=15935, Unknown=0, NotChecked=0, Total=17292 [2019-10-02 13:58:36,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2535 states. [2019-10-02 13:58:36,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2535 to 2232. [2019-10-02 13:58:36,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2232 states. [2019-10-02 13:58:36,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2232 states to 2232 states and 3119 transitions. [2019-10-02 13:58:36,400 INFO L78 Accepts]: Start accepts. Automaton has 2232 states and 3119 transitions. Word has length 280 [2019-10-02 13:58:36,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:58:36,401 INFO L475 AbstractCegarLoop]: Abstraction has 2232 states and 3119 transitions. [2019-10-02 13:58:36,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-02 13:58:36,401 INFO L276 IsEmpty]: Start isEmpty. Operand 2232 states and 3119 transitions. [2019-10-02 13:58:36,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-10-02 13:58:36,412 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:58:36,412 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:58:36,413 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:58:36,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:58:36,413 INFO L82 PathProgramCache]: Analyzing trace with hash -167436706, now seen corresponding path program 1 times [2019-10-02 13:58:36,413 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:58:36,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:58:36,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:58:36,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:58:36,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:58:36,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:58:36,645 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-10-02 13:58:36,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:58:36,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 13:58:36,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 13:58:36,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 13:58:36,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:58:36,648 INFO L87 Difference]: Start difference. First operand 2232 states and 3119 transitions. Second operand 5 states. [2019-10-02 13:58:36,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:58:36,788 INFO L93 Difference]: Finished difference Result 3528 states and 4803 transitions. [2019-10-02 13:58:36,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 13:58:36,789 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 285 [2019-10-02 13:58:36,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:58:36,809 INFO L225 Difference]: With dead ends: 3528 [2019-10-02 13:58:36,814 INFO L226 Difference]: Without dead ends: 2180 [2019-10-02 13:58:36,822 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 13:58:36,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2180 states. [2019-10-02 13:58:36,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2180 to 2170. [2019-10-02 13:58:36,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states. [2019-10-02 13:58:36,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 3021 transitions. [2019-10-02 13:58:36,983 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 3021 transitions. Word has length 285 [2019-10-02 13:58:36,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:58:36,984 INFO L475 AbstractCegarLoop]: Abstraction has 2170 states and 3021 transitions. [2019-10-02 13:58:36,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 13:58:36,984 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 3021 transitions. [2019-10-02 13:58:37,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-10-02 13:58:37,008 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:58:37,009 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:58:37,009 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:58:37,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:58:37,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1479633480, now seen corresponding path program 1 times [2019-10-02 13:58:37,010 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:58:37,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:58:37,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:58:37,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:58:37,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:58:37,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:58:37,379 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-02 13:58:37,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:58:37,379 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:58:37,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:58:37,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:58:37,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 3067 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:58:38,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:58:38,182 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 13:58:38,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:58:38,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 19 [2019-10-02 13:58:38,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 13:58:38,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 13:58:38,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2019-10-02 13:58:38,194 INFO L87 Difference]: Start difference. First operand 2170 states and 3021 transitions. Second operand 19 states. [2019-10-02 13:58:39,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:58:39,955 INFO L93 Difference]: Finished difference Result 4429 states and 6209 transitions. [2019-10-02 13:58:39,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-02 13:58:39,956 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 282 [2019-10-02 13:58:39,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:58:39,970 INFO L225 Difference]: With dead ends: 4429 [2019-10-02 13:58:39,970 INFO L226 Difference]: Without dead ends: 2201 [2019-10-02 13:58:39,981 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=1138, Unknown=0, NotChecked=0, Total=1260 [2019-10-02 13:58:39,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2201 states. [2019-10-02 13:58:40,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2201 to 2131. [2019-10-02 13:58:40,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2131 states. [2019-10-02 13:58:40,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 2131 states and 2945 transitions. [2019-10-02 13:58:40,090 INFO L78 Accepts]: Start accepts. Automaton has 2131 states and 2945 transitions. Word has length 282 [2019-10-02 13:58:40,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:58:40,091 INFO L475 AbstractCegarLoop]: Abstraction has 2131 states and 2945 transitions. [2019-10-02 13:58:40,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 13:58:40,092 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 2945 transitions. [2019-10-02 13:58:40,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-10-02 13:58:40,115 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:58:40,116 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:58:40,117 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:58:40,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:58:40,117 INFO L82 PathProgramCache]: Analyzing trace with hash 992091073, now seen corresponding path program 1 times [2019-10-02 13:58:40,118 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:58:40,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:58:40,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:58:40,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:58:40,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:58:40,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:58:40,541 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-02 13:58:40,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:58:40,541 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:58:40,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:58:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:58:41,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 3067 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:58:41,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:58:41,279 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-10-02 13:58:41,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:58:41,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 16 [2019-10-02 13:58:41,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 13:58:41,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 13:58:41,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-10-02 13:58:41,304 INFO L87 Difference]: Start difference. First operand 2131 states and 2945 transitions. Second operand 16 states. [2019-10-02 13:58:43,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:58:43,621 INFO L93 Difference]: Finished difference Result 4276 states and 5922 transitions. [2019-10-02 13:58:43,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 13:58:43,621 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 284 [2019-10-02 13:58:43,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:58:43,634 INFO L225 Difference]: With dead ends: 4276 [2019-10-02 13:58:43,634 INFO L226 Difference]: Without dead ends: 2172 [2019-10-02 13:58:43,641 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=689, Unknown=0, NotChecked=0, Total=812 [2019-10-02 13:58:43,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2172 states. [2019-10-02 13:58:43,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2172 to 2135. [2019-10-02 13:58:43,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2135 states. [2019-10-02 13:58:43,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2135 states to 2135 states and 2936 transitions. [2019-10-02 13:58:43,809 INFO L78 Accepts]: Start accepts. Automaton has 2135 states and 2936 transitions. Word has length 284 [2019-10-02 13:58:43,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:58:43,809 INFO L475 AbstractCegarLoop]: Abstraction has 2135 states and 2936 transitions. [2019-10-02 13:58:43,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 13:58:43,810 INFO L276 IsEmpty]: Start isEmpty. Operand 2135 states and 2936 transitions. [2019-10-02 13:58:43,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-10-02 13:58:43,823 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:58:43,823 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] [2019-10-02 13:58:43,824 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:58:43,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:58:43,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1937613769, now seen corresponding path program 1 times [2019-10-02 13:58:43,825 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:58:43,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:58:43,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:58:43,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:58:43,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:58:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:58:44,182 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-02 13:58:44,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:58:44,183 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:58:44,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:58:44,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:58:44,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 3069 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:58:44,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:58:44,974 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 13:58:44,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:58:44,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 25 [2019-10-02 13:58:44,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-02 13:58:44,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-02 13:58:44,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2019-10-02 13:58:44,984 INFO L87 Difference]: Start difference. First operand 2135 states and 2936 transitions. Second operand 25 states. [2019-10-02 13:59:05,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:59:05,200 INFO L93 Difference]: Finished difference Result 4618 states and 6347 transitions. [2019-10-02 13:59:05,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-10-02 13:59:05,201 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 284 [2019-10-02 13:59:05,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:59:05,215 INFO L225 Difference]: With dead ends: 4618 [2019-10-02 13:59:05,215 INFO L226 Difference]: Without dead ends: 2537 [2019-10-02 13:59:05,226 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4316 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1208, Invalid=13072, Unknown=0, NotChecked=0, Total=14280 [2019-10-02 13:59:05,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2537 states. [2019-10-02 13:59:05,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2537 to 2135. [2019-10-02 13:59:05,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2135 states. [2019-10-02 13:59:05,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2135 states to 2135 states and 2934 transitions. [2019-10-02 13:59:05,323 INFO L78 Accepts]: Start accepts. Automaton has 2135 states and 2934 transitions. Word has length 284 [2019-10-02 13:59:05,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:59:05,323 INFO L475 AbstractCegarLoop]: Abstraction has 2135 states and 2934 transitions. [2019-10-02 13:59:05,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-02 13:59:05,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2135 states and 2934 transitions. [2019-10-02 13:59:05,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-10-02 13:59:05,334 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:59:05,334 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] [2019-10-02 13:59:05,335 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:59:05,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:59:05,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1158552731, now seen corresponding path program 1 times [2019-10-02 13:59:05,335 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:59:05,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:59:05,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:59:05,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:59:05,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:59:05,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:59:05,503 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-10-02 13:59:05,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:59:05,504 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:59:05,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:59:06,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:59:06,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 3070 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:59:06,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:59:06,238 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-10-02 13:59:06,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:59:06,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2019-10-02 13:59:06,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 13:59:06,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 13:59:06,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-10-02 13:59:06,247 INFO L87 Difference]: Start difference. First operand 2135 states and 2934 transitions. Second operand 10 states. [2019-10-02 13:59:09,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:59:09,482 INFO L93 Difference]: Finished difference Result 5923 states and 8138 transitions. [2019-10-02 13:59:09,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 13:59:09,483 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 285 [2019-10-02 13:59:09,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:59:09,505 INFO L225 Difference]: With dead ends: 5923 [2019-10-02 13:59:09,506 INFO L226 Difference]: Without dead ends: 3864 [2019-10-02 13:59:09,514 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2019-10-02 13:59:09,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3864 states. [2019-10-02 13:59:09,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3864 to 3639. [2019-10-02 13:59:09,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3639 states. [2019-10-02 13:59:09,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3639 states to 3639 states and 4987 transitions. [2019-10-02 13:59:09,698 INFO L78 Accepts]: Start accepts. Automaton has 3639 states and 4987 transitions. Word has length 285 [2019-10-02 13:59:09,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:59:09,699 INFO L475 AbstractCegarLoop]: Abstraction has 3639 states and 4987 transitions. [2019-10-02 13:59:09,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 13:59:09,699 INFO L276 IsEmpty]: Start isEmpty. Operand 3639 states and 4987 transitions. [2019-10-02 13:59:09,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-10-02 13:59:09,712 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:59:09,713 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:59:09,713 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:59:09,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:59:09,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1490372169, now seen corresponding path program 1 times [2019-10-02 13:59:09,714 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:59:09,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:59:09,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:59:09,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:59:09,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:59:09,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:59:09,970 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 13:59:09,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:59:09,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 13:59:09,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 13:59:09,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 13:59:09,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:59:09,977 INFO L87 Difference]: Start difference. First operand 3639 states and 4987 transitions. Second operand 13 states. [2019-10-02 13:59:12,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:59:12,577 INFO L93 Difference]: Finished difference Result 8989 states and 12288 transitions. [2019-10-02 13:59:12,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 13:59:12,578 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 286 [2019-10-02 13:59:12,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:59:12,649 INFO L225 Difference]: With dead ends: 8989 [2019-10-02 13:59:12,654 INFO L226 Difference]: Without dead ends: 7305 [2019-10-02 13:59:12,674 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 13:59:12,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7305 states. [2019-10-02 13:59:13,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7305 to 7120. [2019-10-02 13:59:13,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7120 states. [2019-10-02 13:59:13,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7120 states to 7120 states and 9769 transitions. [2019-10-02 13:59:13,229 INFO L78 Accepts]: Start accepts. Automaton has 7120 states and 9769 transitions. Word has length 286 [2019-10-02 13:59:13,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:59:13,232 INFO L475 AbstractCegarLoop]: Abstraction has 7120 states and 9769 transitions. [2019-10-02 13:59:13,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 13:59:13,233 INFO L276 IsEmpty]: Start isEmpty. Operand 7120 states and 9769 transitions. [2019-10-02 13:59:13,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-10-02 13:59:13,265 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:59:13,266 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:59:13,266 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:59:13,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:59:13,266 INFO L82 PathProgramCache]: Analyzing trace with hash 702346811, now seen corresponding path program 1 times [2019-10-02 13:59:13,267 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:59:13,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:59:13,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:59:13,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:59:13,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:59:13,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:59:13,534 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 13:59:13,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:59:13,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:59:13,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:59:13,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:59:13,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:59:13,537 INFO L87 Difference]: Start difference. First operand 7120 states and 9769 transitions. Second operand 3 states. [2019-10-02 13:59:13,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:59:13,895 INFO L93 Difference]: Finished difference Result 15093 states and 21165 transitions. [2019-10-02 13:59:13,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:59:13,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 284 [2019-10-02 13:59:13,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:59:13,947 INFO L225 Difference]: With dead ends: 15093 [2019-10-02 13:59:13,947 INFO L226 Difference]: Without dead ends: 8062 [2019-10-02 13:59:13,977 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:59:13,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8062 states. [2019-10-02 13:59:14,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8062 to 8056. [2019-10-02 13:59:14,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8056 states. [2019-10-02 13:59:14,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8056 states to 8056 states and 11467 transitions. [2019-10-02 13:59:14,694 INFO L78 Accepts]: Start accepts. Automaton has 8056 states and 11467 transitions. Word has length 284 [2019-10-02 13:59:14,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:59:14,695 INFO L475 AbstractCegarLoop]: Abstraction has 8056 states and 11467 transitions. [2019-10-02 13:59:14,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:59:14,695 INFO L276 IsEmpty]: Start isEmpty. Operand 8056 states and 11467 transitions. [2019-10-02 13:59:14,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-10-02 13:59:14,742 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:59:14,742 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:59:14,743 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:59:14,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:59:14,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1091793822, now seen corresponding path program 1 times [2019-10-02 13:59:14,744 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:59:14,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:59:14,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:59:14,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:59:14,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:59:14,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:59:15,103 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 13:59:15,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:59:15,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 13:59:15,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 13:59:15,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 13:59:15,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 13:59:15,107 INFO L87 Difference]: Start difference. First operand 8056 states and 11467 transitions. Second operand 11 states. [2019-10-02 13:59:15,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:59:15,682 INFO L93 Difference]: Finished difference Result 10301 states and 14488 transitions. [2019-10-02 13:59:15,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 13:59:15,683 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 289 [2019-10-02 13:59:15,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:59:15,748 INFO L225 Difference]: With dead ends: 10301 [2019-10-02 13:59:15,748 INFO L226 Difference]: Without dead ends: 8398 [2019-10-02 13:59:15,760 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-10-02 13:59:15,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8398 states. [2019-10-02 13:59:16,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8398 to 8346. [2019-10-02 13:59:16,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8346 states. [2019-10-02 13:59:16,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8346 states to 8346 states and 11944 transitions. [2019-10-02 13:59:16,415 INFO L78 Accepts]: Start accepts. Automaton has 8346 states and 11944 transitions. Word has length 289 [2019-10-02 13:59:16,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:59:16,417 INFO L475 AbstractCegarLoop]: Abstraction has 8346 states and 11944 transitions. [2019-10-02 13:59:16,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 13:59:16,417 INFO L276 IsEmpty]: Start isEmpty. Operand 8346 states and 11944 transitions. [2019-10-02 13:59:16,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-10-02 13:59:16,465 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:59:16,467 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:59:16,468 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:59:16,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:59:16,468 INFO L82 PathProgramCache]: Analyzing trace with hash 530823302, now seen corresponding path program 1 times [2019-10-02 13:59:16,468 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:59:16,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:59:16,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:59:16,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:59:16,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:59:16,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:59:16,861 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 13:59:16,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:59:16,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 13:59:16,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 13:59:16,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 13:59:16,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 13:59:16,864 INFO L87 Difference]: Start difference. First operand 8346 states and 11944 transitions. Second operand 11 states. [2019-10-02 13:59:20,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:59:20,714 INFO L93 Difference]: Finished difference Result 11619 states and 16059 transitions. [2019-10-02 13:59:20,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 13:59:20,714 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 287 [2019-10-02 13:59:20,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:59:20,749 INFO L225 Difference]: With dead ends: 11619 [2019-10-02 13:59:20,750 INFO L226 Difference]: Without dead ends: 9788 [2019-10-02 13:59:20,759 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 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 13:59:20,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9788 states. [2019-10-02 13:59:21,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9788 to 9724. [2019-10-02 13:59:21,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9724 states. [2019-10-02 13:59:21,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9724 states to 9724 states and 13632 transitions. [2019-10-02 13:59:21,290 INFO L78 Accepts]: Start accepts. Automaton has 9724 states and 13632 transitions. Word has length 287 [2019-10-02 13:59:21,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:59:21,291 INFO L475 AbstractCegarLoop]: Abstraction has 9724 states and 13632 transitions. [2019-10-02 13:59:21,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 13:59:21,292 INFO L276 IsEmpty]: Start isEmpty. Operand 9724 states and 13632 transitions. [2019-10-02 13:59:21,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-10-02 13:59:21,326 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:59:21,327 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:59:21,327 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:59:21,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:59:21,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1134057557, now seen corresponding path program 1 times [2019-10-02 13:59:21,328 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:59:21,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:59:21,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:59:21,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:59:21,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:59:21,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:59:21,719 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 13:59:21,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:59:21,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 13:59:21,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 13:59:21,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 13:59:21,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 13:59:21,722 INFO L87 Difference]: Start difference. First operand 9724 states and 13632 transitions. Second operand 11 states. [2019-10-02 13:59:22,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:59:22,155 INFO L93 Difference]: Finished difference Result 12025 states and 16744 transitions. [2019-10-02 13:59:22,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 13:59:22,156 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 308 [2019-10-02 13:59:22,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:59:22,193 INFO L225 Difference]: With dead ends: 12025 [2019-10-02 13:59:22,193 INFO L226 Difference]: Without dead ends: 10124 [2019-10-02 13:59:22,205 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-10-02 13:59:22,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10124 states. [2019-10-02 13:59:22,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10124 to 10056. [2019-10-02 13:59:22,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10056 states. [2019-10-02 13:59:22,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10056 states to 10056 states and 14144 transitions. [2019-10-02 13:59:22,765 INFO L78 Accepts]: Start accepts. Automaton has 10056 states and 14144 transitions. Word has length 308 [2019-10-02 13:59:22,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:59:22,766 INFO L475 AbstractCegarLoop]: Abstraction has 10056 states and 14144 transitions. [2019-10-02 13:59:22,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 13:59:22,766 INFO L276 IsEmpty]: Start isEmpty. Operand 10056 states and 14144 transitions. [2019-10-02 13:59:22,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-10-02 13:59:22,812 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:59:22,813 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:59:22,813 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:59:22,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:59:22,813 INFO L82 PathProgramCache]: Analyzing trace with hash 375209042, now seen corresponding path program 1 times [2019-10-02 13:59:22,814 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:59:22,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:59:22,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:59:22,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:59:22,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:59:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:59:23,664 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 13:59:23,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:59:23,664 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:59:23,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:59:24,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:59:24,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 3172 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:59:24,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:59:24,633 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 13:59:24,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:59:24,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [36] total 41 [2019-10-02 13:59:24,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-02 13:59:24,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-02 13:59:24,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1552, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 13:59:24,653 INFO L87 Difference]: Start difference. First operand 10056 states and 14144 transitions. Second operand 41 states. [2019-10-02 14:00:29,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:00:29,913 INFO L93 Difference]: Finished difference Result 56079 states and 76616 transitions. [2019-10-02 14:00:29,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 260 states. [2019-10-02 14:00:29,913 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 305 [2019-10-02 14:00:29,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:00:30,070 INFO L225 Difference]: With dead ends: 56079 [2019-10-02 14:00:30,070 INFO L226 Difference]: Without dead ends: 46101 [2019-10-02 14:00:30,139 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 715 GetRequests, 419 SyntacticMatches, 0 SemanticMatches, 296 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32685 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=5108, Invalid=83398, Unknown=0, NotChecked=0, Total=88506 [2019-10-02 14:00:30,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46101 states. [2019-10-02 14:00:33,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46101 to 42980. [2019-10-02 14:00:33,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42980 states. [2019-10-02 14:00:33,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42980 states to 42980 states and 58640 transitions. [2019-10-02 14:00:33,476 INFO L78 Accepts]: Start accepts. Automaton has 42980 states and 58640 transitions. Word has length 305 [2019-10-02 14:00:33,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:00:33,477 INFO L475 AbstractCegarLoop]: Abstraction has 42980 states and 58640 transitions. [2019-10-02 14:00:33,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-02 14:00:33,477 INFO L276 IsEmpty]: Start isEmpty. Operand 42980 states and 58640 transitions. [2019-10-02 14:00:33,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-10-02 14:00:33,598 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:00:33,599 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:00:33,599 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:00:33,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:00:33,600 INFO L82 PathProgramCache]: Analyzing trace with hash 959142382, now seen corresponding path program 1 times [2019-10-02 14:00:33,600 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:00:33,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:00:33,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:33,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:00:33,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:33,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:00:33,844 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-10-02 14:00:33,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:00:33,844 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:00:33,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:00:34,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:00:34,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 3174 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 14:00:34,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:00:34,824 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-10-02 14:00:34,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:00:34,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 4] total 14 [2019-10-02 14:00:34,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 14:00:34,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 14:00:34,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-10-02 14:00:34,843 INFO L87 Difference]: Start difference. First operand 42980 states and 58640 transitions. Second operand 14 states. [2019-10-02 14:00:35,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:00:35,976 INFO L93 Difference]: Finished difference Result 79732 states and 106819 transitions. [2019-10-02 14:00:35,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 14:00:35,977 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 307 [2019-10-02 14:00:35,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:00:36,135 INFO L225 Difference]: With dead ends: 79732 [2019-10-02 14:00:36,135 INFO L226 Difference]: Without dead ends: 42239 [2019-10-02 14:00:36,232 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2019-10-02 14:00:36,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42239 states. [2019-10-02 14:00:39,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42239 to 42016. [2019-10-02 14:00:39,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42016 states. [2019-10-02 14:00:39,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42016 states to 42016 states and 57120 transitions. [2019-10-02 14:00:39,629 INFO L78 Accepts]: Start accepts. Automaton has 42016 states and 57120 transitions. Word has length 307 [2019-10-02 14:00:39,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:00:39,629 INFO L475 AbstractCegarLoop]: Abstraction has 42016 states and 57120 transitions. [2019-10-02 14:00:39,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 14:00:39,629 INFO L276 IsEmpty]: Start isEmpty. Operand 42016 states and 57120 transitions. [2019-10-02 14:00:39,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-10-02 14:00:39,721 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:00:39,722 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:39,722 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:00:39,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:00:39,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1564535266, now seen corresponding path program 1 times [2019-10-02 14:00:39,722 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:00:39,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:00:39,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:39,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:00:39,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:00:39,867 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-02 14:00:39,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:00:39,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:00:39,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:00:39,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:00:39,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:00:39,869 INFO L87 Difference]: Start difference. First operand 42016 states and 57120 transitions. Second operand 3 states. [2019-10-02 14:00:41,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:00:41,240 INFO L93 Difference]: Finished difference Result 87439 states and 120502 transitions. [2019-10-02 14:00:41,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:00:41,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2019-10-02 14:00:41,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:00:41,407 INFO L225 Difference]: With dead ends: 87439 [2019-10-02 14:00:41,408 INFO L226 Difference]: Without dead ends: 45640 [2019-10-02 14:00:41,507 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:00:41,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45640 states. [2019-10-02 14:00:43,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45640 to 45628. [2019-10-02 14:00:43,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45628 states. [2019-10-02 14:00:43,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45628 states to 45628 states and 63538 transitions. [2019-10-02 14:00:43,597 INFO L78 Accepts]: Start accepts. Automaton has 45628 states and 63538 transitions. Word has length 308 [2019-10-02 14:00:43,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:00:43,598 INFO L475 AbstractCegarLoop]: Abstraction has 45628 states and 63538 transitions. [2019-10-02 14:00:43,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:00:43,598 INFO L276 IsEmpty]: Start isEmpty. Operand 45628 states and 63538 transitions. [2019-10-02 14:00:43,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-10-02 14:00:43,670 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:00:43,670 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:43,671 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:00:43,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:00:43,671 INFO L82 PathProgramCache]: Analyzing trace with hash 517929977, now seen corresponding path program 1 times [2019-10-02 14:00:43,671 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:00:43,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:00:43,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:43,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:00:43,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:43,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:00:43,818 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-02 14:00:43,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:00:43,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:00:43,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:00:43,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:00:43,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:00:43,819 INFO L87 Difference]: Start difference. First operand 45628 states and 63538 transitions. Second operand 3 states. [2019-10-02 14:00:45,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:00:45,562 INFO L93 Difference]: Finished difference Result 97951 states and 139138 transitions. [2019-10-02 14:00:45,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:00:45,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 309 [2019-10-02 14:00:45,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:00:45,680 INFO L225 Difference]: With dead ends: 97951 [2019-10-02 14:00:45,680 INFO L226 Difference]: Without dead ends: 52564 [2019-10-02 14:00:45,745 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:00:45,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52564 states. [2019-10-02 14:00:49,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52564 to 52552. [2019-10-02 14:00:49,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52552 states. [2019-10-02 14:00:49,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52552 states to 52552 states and 75692 transitions. [2019-10-02 14:00:49,754 INFO L78 Accepts]: Start accepts. Automaton has 52552 states and 75692 transitions. Word has length 309 [2019-10-02 14:00:49,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:00:49,755 INFO L475 AbstractCegarLoop]: Abstraction has 52552 states and 75692 transitions. [2019-10-02 14:00:49,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:00:49,755 INFO L276 IsEmpty]: Start isEmpty. Operand 52552 states and 75692 transitions. [2019-10-02 14:00:49,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-10-02 14:00:49,879 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:00:49,879 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:49,880 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:00:49,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:00:49,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1000599588, now seen corresponding path program 1 times [2019-10-02 14:00:49,880 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:00:49,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:00:49,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:49,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:00:49,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:00:50,032 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-02 14:00:50,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:00:50,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:00:50,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:00:50,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:00:50,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:00:50,033 INFO L87 Difference]: Start difference. First operand 52552 states and 75692 transitions. Second operand 3 states. [2019-10-02 14:00:51,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:00:51,978 INFO L93 Difference]: Finished difference Result 118107 states and 174790 transitions. [2019-10-02 14:00:51,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:00:51,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-10-02 14:00:51,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:00:52,125 INFO L225 Difference]: With dead ends: 118107 [2019-10-02 14:00:52,125 INFO L226 Difference]: Without dead ends: 65816 [2019-10-02 14:00:52,193 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:00:52,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65816 states. [2019-10-02 14:00:54,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65816 to 65804. [2019-10-02 14:00:54,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65804 states. [2019-10-02 14:00:54,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65804 states to 65804 states and 99022 transitions. [2019-10-02 14:00:54,907 INFO L78 Accepts]: Start accepts. Automaton has 65804 states and 99022 transitions. Word has length 312 [2019-10-02 14:00:54,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:00:54,907 INFO L475 AbstractCegarLoop]: Abstraction has 65804 states and 99022 transitions. [2019-10-02 14:00:54,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:00:54,907 INFO L276 IsEmpty]: Start isEmpty. Operand 65804 states and 99022 transitions. [2019-10-02 14:00:55,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-10-02 14:00:55,044 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:00:55,044 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:55,045 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:00:55,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:00:55,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1280306007, now seen corresponding path program 1 times [2019-10-02 14:00:55,045 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:00:55,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:00:55,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:55,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:00:55,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:00:55,189 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-02 14:00:55,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:00:55,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:00:55,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:00:55,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:00:55,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:00:55,191 INFO L87 Difference]: Start difference. First operand 65804 states and 99022 transitions. Second operand 3 states. [2019-10-02 14:00:58,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:00:58,813 INFO L93 Difference]: Finished difference Result 156695 states and 242842 transitions. [2019-10-02 14:00:58,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:00:58,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 311 [2019-10-02 14:00:58,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:00:59,027 INFO L225 Difference]: With dead ends: 156695 [2019-10-02 14:00:59,027 INFO L226 Difference]: Without dead ends: 91164 [2019-10-02 14:00:59,112 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:00:59,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91164 states. [2019-10-02 14:01:06,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91164 to 91152. [2019-10-02 14:01:06,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91152 states. [2019-10-02 14:01:06,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91152 states to 91152 states and 143376 transitions. [2019-10-02 14:01:06,639 INFO L78 Accepts]: Start accepts. Automaton has 91152 states and 143376 transitions. Word has length 311 [2019-10-02 14:01:06,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:01:06,640 INFO L475 AbstractCegarLoop]: Abstraction has 91152 states and 143376 transitions. [2019-10-02 14:01:06,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:01:06,640 INFO L276 IsEmpty]: Start isEmpty. Operand 91152 states and 143376 transitions. [2019-10-02 14:01:06,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-10-02 14:01:06,876 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:01:06,876 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:06,876 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:01:06,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:01:06,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1351189109, now seen corresponding path program 1 times [2019-10-02 14:01:06,876 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:01:06,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:01:06,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:01:06,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:01:06,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:01:06,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:01:07,023 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-02 14:01:07,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:01:07,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:01:07,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:01:07,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:01:07,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:01:07,025 INFO L87 Difference]: Start difference. First operand 91152 states and 143376 transitions. Second operand 3 states. [2019-10-02 14:01:13,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:01:13,746 INFO L93 Difference]: Finished difference Result 233495 states and 376660 transitions. [2019-10-02 14:01:13,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:01:13,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 313 [2019-10-02 14:01:13,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:01:14,122 INFO L225 Difference]: With dead ends: 233495 [2019-10-02 14:01:14,122 INFO L226 Difference]: Without dead ends: 142624 [2019-10-02 14:01:14,276 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:01:14,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142624 states. [2019-10-02 14:01:23,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142624 to 142612. [2019-10-02 14:01:23,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142612 states. [2019-10-02 14:01:23,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142612 states to 142612 states and 232082 transitions. [2019-10-02 14:01:23,661 INFO L78 Accepts]: Start accepts. Automaton has 142612 states and 232082 transitions. Word has length 313 [2019-10-02 14:01:23,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:01:23,662 INFO L475 AbstractCegarLoop]: Abstraction has 142612 states and 232082 transitions. [2019-10-02 14:01:23,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:01:23,662 INFO L276 IsEmpty]: Start isEmpty. Operand 142612 states and 232082 transitions. [2019-10-02 14:01:24,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-10-02 14:01:24,101 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:01:24,101 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:24,101 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:01:24,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:01:24,101 INFO L82 PathProgramCache]: Analyzing trace with hash -858721833, now seen corresponding path program 1 times [2019-10-02 14:01:24,102 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:01:24,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:01:24,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:01:24,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:01:24,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:01:24,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:01:24,261 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-02 14:01:24,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:01:24,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:01:24,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:01:24,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:01:24,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:01:24,263 INFO L87 Difference]: Start difference. First operand 142612 states and 232082 transitions. Second operand 3 states. [2019-10-02 14:01:38,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:01:38,222 INFO L93 Difference]: Finished difference Result 380183 states and 627400 transitions. [2019-10-02 14:01:38,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:01:38,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 313 [2019-10-02 14:01:38,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:01:38,841 INFO L225 Difference]: With dead ends: 380183 [2019-10-02 14:01:38,842 INFO L226 Difference]: Without dead ends: 237868 [2019-10-02 14:01:39,053 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:01:39,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237868 states. [2019-10-02 14:01:54,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237868 to 237856. [2019-10-02 14:01:54,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237856 states. [2019-10-02 14:01:55,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237856 states to 237856 states and 392604 transitions. [2019-10-02 14:01:55,487 INFO L78 Accepts]: Start accepts. Automaton has 237856 states and 392604 transitions. Word has length 313 [2019-10-02 14:01:55,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:01:55,488 INFO L475 AbstractCegarLoop]: Abstraction has 237856 states and 392604 transitions. [2019-10-02 14:01:55,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:01:55,488 INFO L276 IsEmpty]: Start isEmpty. Operand 237856 states and 392604 transitions. [2019-10-02 14:01:57,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-10-02 14:01:57,586 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:01:57,587 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:57,587 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:01:57,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:01:57,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1404853604, now seen corresponding path program 1 times [2019-10-02 14:01:57,587 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:01:57,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:01:57,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:01:57,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:01:57,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:01:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:01:57,732 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-02 14:01:57,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:01:57,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:01:57,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:01:57,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:01:57,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:01:57,734 INFO L87 Difference]: Start difference. First operand 237856 states and 392604 transitions. Second operand 3 states. [2019-10-02 14:02:26,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:02:26,001 INFO L93 Difference]: Finished difference Result 656659 states and 1096636 transitions. [2019-10-02 14:02:26,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:02:26,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-10-02 14:02:26,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:02:27,614 INFO L225 Difference]: With dead ends: 656659 [2019-10-02 14:02:27,614 INFO L226 Difference]: Without dead ends: 419120 [2019-10-02 14:02:27,961 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:02:28,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419120 states. [2019-10-02 14:02:57,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419120 to 419108. [2019-10-02 14:02:57,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419108 states. [2019-10-02 14:03:07,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419108 states to 419108 states and 698270 transitions. [2019-10-02 14:03:07,026 INFO L78 Accepts]: Start accepts. Automaton has 419108 states and 698270 transitions. Word has length 314 [2019-10-02 14:03:07,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:03:07,026 INFO L475 AbstractCegarLoop]: Abstraction has 419108 states and 698270 transitions. [2019-10-02 14:03:07,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:03:07,026 INFO L276 IsEmpty]: Start isEmpty. Operand 419108 states and 698270 transitions. [2019-10-02 14:03:09,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-10-02 14:03:09,017 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:03:09,017 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:09,018 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:03:09,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:03:09,018 INFO L82 PathProgramCache]: Analyzing trace with hash 681957909, now seen corresponding path program 1 times [2019-10-02 14:03:09,018 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:03:09,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:03:09,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:03:09,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:03:09,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:03:09,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:03:09,158 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-02 14:03:09,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:03:09,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:03:09,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:03:09,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:03:09,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:03:09,160 INFO L87 Difference]: Start difference. First operand 419108 states and 698270 transitions. Second operand 3 states. [2019-10-02 14:04:00,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:04:00,235 INFO L93 Difference]: Finished difference Result 799257 states and 1319890 transitions. [2019-10-02 14:04:00,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:04:00,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 317 [2019-10-02 14:04:00,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:04:02,370 INFO L225 Difference]: With dead ends: 799257 [2019-10-02 14:04:02,371 INFO L226 Difference]: Without dead ends: 763082 [2019-10-02 14:04:02,575 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:04:03,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763082 states. [2019-10-02 14:05:11,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763082 to 763070. [2019-10-02 14:05:11,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 763070 states. [2019-10-02 14:05:26,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763070 states to 763070 states and 1260300 transitions. [2019-10-02 14:05:26,604 INFO L78 Accepts]: Start accepts. Automaton has 763070 states and 1260300 transitions. Word has length 317 [2019-10-02 14:05:26,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:05:26,604 INFO L475 AbstractCegarLoop]: Abstraction has 763070 states and 1260300 transitions. [2019-10-02 14:05:26,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:05:26,604 INFO L276 IsEmpty]: Start isEmpty. Operand 763070 states and 1260300 transitions. [2019-10-02 14:05:45,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-10-02 14:05:45,309 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:05:45,309 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45,309 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:05:45,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:05:45,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1721243556, now seen corresponding path program 1 times [2019-10-02 14:05:45,310 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:05:45,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:05:45,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:05:45,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:05:45,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:05:45,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:05:45,496 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-02 14:05:45,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:05:45,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 14:05:45,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 14:05:45,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 14:05:45,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 14:05:45,498 INFO L87 Difference]: Start difference. First operand 763070 states and 1260300 transitions. Second operand 7 states. [2019-10-02 14:07:28,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:07:28,943 INFO L93 Difference]: Finished difference Result 1559785 states and 2575086 transitions. [2019-10-02 14:07:28,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 14:07:28,944 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 316 [2019-10-02 14:07:28,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:07:34,680 INFO L225 Difference]: With dead ends: 1559785 [2019-10-02 14:07:34,680 INFO L226 Difference]: Without dead ends: 1541738 [2019-10-02 14:07:35,095 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:07:36,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1541738 states.