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_spec3_product27.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 13:19:21,774 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 13:19:21,776 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 13:19:21,787 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 13:19:21,788 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 13:19:21,789 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 13:19:21,790 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 13:19:21,792 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 13:19:21,793 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 13:19:21,794 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 13:19:21,795 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 13:19:21,796 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 13:19:21,797 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 13:19:21,797 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 13:19:21,798 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 13:19:21,799 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 13:19:21,800 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 13:19:21,801 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 13:19:21,803 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 13:19:21,805 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 13:19:21,806 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 13:19:21,808 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 13:19:21,809 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 13:19:21,810 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 13:19:21,812 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 13:19:21,814 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 13:19:21,814 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 13:19:21,815 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 13:19:21,815 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 13:19:21,816 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 13:19:21,816 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 13:19:21,817 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 13:19:21,818 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 13:19:21,819 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 13:19:21,819 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 13:19:21,820 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 13:19:21,820 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 13:19:21,821 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 13:19:21,821 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 13:19:21,822 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 13:19:21,822 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 13:19:21,823 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:19:21,837 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 13:19:21,837 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 13:19:21,842 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 13:19:21,842 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 13:19:21,842 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 13:19:21,842 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 13:19:21,843 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 13:19:21,843 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 13:19:21,843 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 13:19:21,843 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 13:19:21,843 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 13:19:21,844 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 13:19:21,844 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 13:19:21,844 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 13:19:21,846 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 13:19:21,846 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 13:19:21,846 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 13:19:21,847 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 13:19:21,847 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 13:19:21,847 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 13:19:21,847 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 13:19:21,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 13:19:21,848 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 13:19:21,848 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 13:19:21,848 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 13:19:21,848 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 13:19:21,848 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 13:19:21,849 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 13:19:21,849 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 13:19:21,885 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 13:19:21,897 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 13:19:21,900 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 13:19:21,902 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 13:19:21,902 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 13:19:21,903 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec3_product27.cil.c [2019-10-02 13:19:21,981 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25c95ce4c/063f74234f1c425daaf1361ade5daa1e/FLAG427450781 [2019-10-02 13:19:22,565 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 13:19:22,566 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec3_product27.cil.c [2019-10-02 13:19:22,593 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25c95ce4c/063f74234f1c425daaf1361ade5daa1e/FLAG427450781 [2019-10-02 13:19:22,799 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25c95ce4c/063f74234f1c425daaf1361ade5daa1e [2019-10-02 13:19:22,808 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 13:19:22,809 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 13:19:22,810 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 13:19:22,810 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 13:19:22,813 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 13:19:22,814 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:19:22" (1/1) ... [2019-10-02 13:19:22,816 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11498c8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:19:22, skipping insertion in model container [2019-10-02 13:19:22,817 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:19:22" (1/1) ... [2019-10-02 13:19:22,824 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 13:19:22,890 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 13:19:23,744 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:19:23,779 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 13:19:23,890 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:19:23,985 INFO L192 MainTranslator]: Completed translation [2019-10-02 13:19:23,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:19:23 WrapperNode [2019-10-02 13:19:23,986 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 13:19:23,987 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 13:19:23,987 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 13:19:23,987 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 13:19:24,002 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:19:23" (1/1) ... [2019-10-02 13:19:24,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:19:23" (1/1) ... [2019-10-02 13:19:24,035 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:19:23" (1/1) ... [2019-10-02 13:19:24,035 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:19:23" (1/1) ... [2019-10-02 13:19:24,094 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:19:23" (1/1) ... [2019-10-02 13:19:24,117 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:19:23" (1/1) ... [2019-10-02 13:19:24,131 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:19:23" (1/1) ... [2019-10-02 13:19:24,150 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 13:19:24,151 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 13:19:24,151 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 13:19:24,151 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 13:19:24,152 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:19:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 13:19:24,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 13:19:24,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 13:19:24,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 13:19:24,235 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AddressBook [2019-10-02 13:19:24,236 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Forward [2019-10-02 13:19:24,237 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 13:19:24,237 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 13:19:24,237 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 13:19:24,238 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 13:19:24,238 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 13:19:24,238 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 13:19:24,239 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 13:19:24,239 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 13:19:24,239 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 13:19:24,240 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 13:19:24,240 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 13:19:24,242 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__SignVerify_spec__1 [2019-10-02 13:19:24,243 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__SignVerify_spec__2 [2019-10-02 13:19:24,243 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 13:19:24,243 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 13:19:24,243 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 13:19:24,243 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 13:19:24,243 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 13:19:24,244 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 13:19:24,244 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 13:19:24,244 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 13:19:24,244 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 13:19:24,244 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 13:19:24,248 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 13:19:24,248 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 13:19:24,248 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 13:19:24,248 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 13:19:24,249 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 13:19:24,249 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 13:19:24,249 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 13:19:24,249 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 13:19:24,250 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 13:19:24,250 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 13:19:24,250 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 13:19:24,250 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 13:19:24,250 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 13:19:24,251 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 13:19:24,251 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 13:19:24,251 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 13:19:24,251 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-10-02 13:19:24,252 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AddressBook [2019-10-02 13:19:24,252 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 13:19:24,252 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 13:19:24,252 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Keys [2019-10-02 13:19:24,252 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-10-02 13:19:24,252 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-10-02 13:19:24,253 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 13:19:24,253 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 13:19:24,253 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 13:19:24,253 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 13:19:24,253 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 13:19:24,253 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 13:19:24,253 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 13:19:24,254 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 13:19:24,254 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 13:19:24,254 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-02 13:19:24,254 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-02 13:19:24,254 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-02 13:19:24,254 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-02 13:19:24,255 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-02 13:19:24,255 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 13:19:24,255 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 13:19:24,255 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 13:19:24,256 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 13:19:24,256 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 13:19:24,256 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 13:19:24,256 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 13:19:24,256 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 13:19:24,257 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 13:19:24,257 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 13:19:24,258 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 13:19:24,258 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 13:19:24,258 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 13:19:24,258 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 13:19:24,258 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 13:19:24,258 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 13:19:24,258 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 13:19:24,259 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 13:19:24,259 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 13:19:24,259 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-02 13:19:24,259 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-02 13:19:24,260 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-02 13:19:24,260 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 13:19:24,261 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 13:19:24,261 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 13:19:24,261 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 13:19:24,262 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 13:19:24,262 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 13:19:24,262 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 13:19:24,262 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 13:19:24,262 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 13:19:24,262 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 13:19:24,262 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 13:19:24,263 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 13:19:24,263 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 13:19:24,263 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 13:19:24,263 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 13:19:24,263 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 13:19:24,263 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 13:19:24,263 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 13:19:24,264 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 13:19:24,264 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 13:19:24,264 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 13:19:24,264 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 13:19:24,264 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 13:19:24,264 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 13:19:24,265 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 13:19:24,265 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 13:19:24,265 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 13:19:24,265 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 13:19:24,266 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 13:19:24,266 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 13:19:24,266 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 13:19:24,266 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 13:19:24,266 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 13:19:24,267 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 13:19:24,267 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 13:19:24,267 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 13:19:24,267 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 13:19:24,269 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 13:19:24,269 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 13:19:24,269 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 13:19:24,269 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 13:19:24,269 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 13:19:24,269 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 13:19:24,270 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 13:19:24,270 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 13:19:24,270 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 13:19:24,270 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AddressBook [2019-10-02 13:19:24,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 13:19:24,271 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Forward [2019-10-02 13:19:24,271 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 13:19:24,271 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 13:19:24,271 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 13:19:24,272 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 13:19:24,275 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 13:19:24,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 13:19:24,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 13:19:24,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 13:19:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 13:19:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 13:19:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 13:19:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 13:19:24,283 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 13:19:24,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 13:19:24,283 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 13:19:24,283 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 13:19:24,283 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 13:19:24,283 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 13:19:24,283 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 13:19:24,284 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 13:19:24,284 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 13:19:24,284 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__SignVerify_spec__1 [2019-10-02 13:19:24,285 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__SignVerify_spec__2 [2019-10-02 13:19:24,285 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 13:19:24,285 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 13:19:24,285 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 13:19:24,286 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 13:19:24,286 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 13:19:24,286 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 13:19:24,286 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 13:19:24,286 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 13:19:24,286 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 13:19:24,286 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 13:19:24,287 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 13:19:24,287 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 13:19:24,287 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 13:19:24,287 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 13:19:24,287 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 13:19:24,287 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 13:19:24,288 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 13:19:24,288 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 13:19:24,288 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 13:19:24,288 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 13:19:24,288 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 13:19:24,288 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 13:19:24,289 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 13:19:24,289 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 13:19:24,289 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 13:19:24,289 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 13:19:24,289 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 13:19:24,289 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 13:19:24,290 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 13:19:24,290 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 13:19:24,290 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 13:19:24,290 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 13:19:24,290 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 13:19:24,290 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 13:19:24,291 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 13:19:24,291 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 13:19:24,291 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-02 13:19:24,291 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-02 13:19:24,291 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-02 13:19:24,291 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-02 13:19:24,291 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-02 13:19:24,292 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-10-02 13:19:24,292 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AddressBook [2019-10-02 13:19:24,292 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Keys [2019-10-02 13:19:24,292 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-10-02 13:19:24,292 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-10-02 13:19:24,292 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 13:19:24,293 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 13:19:24,293 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 13:19:24,293 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 13:19:24,293 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 13:19:24,293 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 13:19:24,293 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 13:19:24,294 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 13:19:24,294 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 13:19:24,294 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 13:19:24,294 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 13:19:24,294 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 13:19:24,294 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 13:19:24,295 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 13:19:24,295 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 13:19:24,295 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 13:19:24,295 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 13:19:24,295 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 13:19:24,295 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 13:19:24,295 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 13:19:24,296 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 13:19:24,296 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 13:19:24,296 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 13:19:24,296 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 13:19:24,296 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 13:19:24,296 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 13:19:24,297 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 13:19:24,297 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 13:19:24,297 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-02 13:19:24,297 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-02 13:19:24,297 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-02 13:19:24,297 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 13:19:24,298 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 13:19:24,298 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 13:19:24,298 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 13:19:24,298 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 13:19:24,298 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 13:19:24,298 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 13:19:24,298 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 13:19:24,299 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 13:19:24,299 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 13:19:24,299 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 13:19:24,299 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 13:19:24,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 13:19:24,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 13:19:24,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 13:19:26,571 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 13:19:26,572 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 13:19:26,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:19:26 BoogieIcfgContainer [2019-10-02 13:19:26,576 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 13:19:26,578 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 13:19:26,578 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 13:19:26,581 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 13:19:26,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:19:22" (1/3) ... [2019-10-02 13:19:26,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67320eda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:19:26, skipping insertion in model container [2019-10-02 13:19:26,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:19:23" (2/3) ... [2019-10-02 13:19:26,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67320eda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:19:26, skipping insertion in model container [2019-10-02 13:19:26,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:19:26" (3/3) ... [2019-10-02 13:19:26,585 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec3_product27.cil.c [2019-10-02 13:19:26,595 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 13:19:26,604 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 13:19:26,622 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 13:19:26,657 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 13:19:26,658 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 13:19:26,658 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 13:19:26,659 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 13:19:26,659 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 13:19:26,659 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 13:19:26,659 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 13:19:26,659 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 13:19:26,659 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 13:19:26,689 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states. [2019-10-02 13:19:26,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-02 13:19:26,711 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:19:26,712 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:19:26,715 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:19:26,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:19:26,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1666435030, now seen corresponding path program 1 times [2019-10-02 13:19:26,723 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:19:26,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:19:26,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:19:26,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:19:26,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:19:27,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:19:27,477 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:19:27,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:19:27,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 13:19:27,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 13:19:27,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 13:19:27,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 13:19:27,501 INFO L87 Difference]: Start difference. First operand 631 states. Second operand 2 states. [2019-10-02 13:19:27,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:19:27,610 INFO L93 Difference]: Finished difference Result 937 states and 1264 transitions. [2019-10-02 13:19:27,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 13:19:27,611 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 179 [2019-10-02 13:19:27,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:19:27,649 INFO L225 Difference]: With dead ends: 937 [2019-10-02 13:19:27,649 INFO L226 Difference]: Without dead ends: 602 [2019-10-02 13:19:27,659 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:19:27,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-10-02 13:19:27,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2019-10-02 13:19:27,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-10-02 13:19:27,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 816 transitions. [2019-10-02 13:19:27,775 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 816 transitions. Word has length 179 [2019-10-02 13:19:27,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:19:27,777 INFO L475 AbstractCegarLoop]: Abstraction has 602 states and 816 transitions. [2019-10-02 13:19:27,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 13:19:27,777 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 816 transitions. [2019-10-02 13:19:27,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-02 13:19:27,783 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:19:27,783 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:19:27,783 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:19:27,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:19:27,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1122498688, now seen corresponding path program 1 times [2019-10-02 13:19:27,787 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:19:27,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:19:27,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:19:27,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:19:27,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:19:27,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:19:28,109 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:19:28,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:19:28,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:19:28,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:19:28,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:19:28,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:19:28,115 INFO L87 Difference]: Start difference. First operand 602 states and 816 transitions. Second operand 3 states. [2019-10-02 13:19:28,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:19:28,194 INFO L93 Difference]: Finished difference Result 920 states and 1226 transitions. [2019-10-02 13:19:28,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:19:28,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-10-02 13:19:28,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:19:28,200 INFO L225 Difference]: With dead ends: 920 [2019-10-02 13:19:28,200 INFO L226 Difference]: Without dead ends: 605 [2019-10-02 13:19:28,202 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:19:28,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-10-02 13:19:28,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 604. [2019-10-02 13:19:28,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-10-02 13:19:28,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 818 transitions. [2019-10-02 13:19:28,241 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 818 transitions. Word has length 180 [2019-10-02 13:19:28,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:19:28,241 INFO L475 AbstractCegarLoop]: Abstraction has 604 states and 818 transitions. [2019-10-02 13:19:28,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:19:28,242 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 818 transitions. [2019-10-02 13:19:28,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-02 13:19:28,245 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:19:28,245 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:19:28,246 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:19:28,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:19:28,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1965541329, now seen corresponding path program 1 times [2019-10-02 13:19:28,246 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:19:28,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:19:28,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:19:28,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:19:28,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:19:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:19:28,511 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:19:28,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:19:28,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:19:28,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:19:28,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:19:28,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:19:28,517 INFO L87 Difference]: Start difference. First operand 604 states and 818 transitions. Second operand 3 states. [2019-10-02 13:19:28,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:19:28,603 INFO L93 Difference]: Finished difference Result 1188 states and 1640 transitions. [2019-10-02 13:19:28,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:19:28,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-10-02 13:19:28,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:19:28,617 INFO L225 Difference]: With dead ends: 1188 [2019-10-02 13:19:28,617 INFO L226 Difference]: Without dead ends: 649 [2019-10-02 13:19:28,620 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:19:28,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-10-02 13:19:28,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 648. [2019-10-02 13:19:28,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-10-02 13:19:28,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 893 transitions. [2019-10-02 13:19:28,700 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 893 transitions. Word has length 192 [2019-10-02 13:19:28,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:19:28,704 INFO L475 AbstractCegarLoop]: Abstraction has 648 states and 893 transitions. [2019-10-02 13:19:28,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:19:28,704 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 893 transitions. [2019-10-02 13:19:28,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-02 13:19:28,716 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:19:28,717 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:19:28,717 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:19:28,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:19:28,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1219929251, now seen corresponding path program 1 times [2019-10-02 13:19:28,720 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:19:28,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:19:28,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:19:28,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:19:28,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:19:28,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:19:28,994 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:19:28,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:19:28,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:19:28,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:19:28,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:19:28,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:19:28,998 INFO L87 Difference]: Start difference. First operand 648 states and 893 transitions. Second operand 3 states. [2019-10-02 13:19:29,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:19:29,038 INFO L93 Difference]: Finished difference Result 1317 states and 1860 transitions. [2019-10-02 13:19:29,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:19:29,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-10-02 13:19:29,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:19:29,044 INFO L225 Difference]: With dead ends: 1317 [2019-10-02 13:19:29,044 INFO L226 Difference]: Without dead ends: 734 [2019-10-02 13:19:29,046 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:19:29,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2019-10-02 13:19:29,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 733. [2019-10-02 13:19:29,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2019-10-02 13:19:29,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1037 transitions. [2019-10-02 13:19:29,080 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1037 transitions. Word has length 193 [2019-10-02 13:19:29,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:19:29,082 INFO L475 AbstractCegarLoop]: Abstraction has 733 states and 1037 transitions. [2019-10-02 13:19:29,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:19:29,082 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1037 transitions. [2019-10-02 13:19:29,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-02 13:19:29,087 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:19:29,087 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:19:29,087 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:19:29,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:19:29,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1851782167, now seen corresponding path program 1 times [2019-10-02 13:19:29,088 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:19:29,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:19:29,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:19:29,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:19:29,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:19:29,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:19:29,451 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:19:29,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:19:29,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 13:19:29,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 13:19:29,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 13:19:29,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-10-02 13:19:29,454 INFO L87 Difference]: Start difference. First operand 733 states and 1037 transitions. Second operand 12 states. [2019-10-02 13:19:42,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:19:42,674 INFO L93 Difference]: Finished difference Result 3396 states and 4677 transitions. [2019-10-02 13:19:42,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-02 13:19:42,675 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 196 [2019-10-02 13:19:42,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:19:42,694 INFO L225 Difference]: With dead ends: 3396 [2019-10-02 13:19:42,694 INFO L226 Difference]: Without dead ends: 3082 [2019-10-02 13:19:42,698 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=377, Invalid=1515, Unknown=0, NotChecked=0, Total=1892 [2019-10-02 13:19:42,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3082 states. [2019-10-02 13:19:42,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3082 to 3057. [2019-10-02 13:19:42,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3057 states. [2019-10-02 13:19:42,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3057 states to 3057 states and 4147 transitions. [2019-10-02 13:19:42,852 INFO L78 Accepts]: Start accepts. Automaton has 3057 states and 4147 transitions. Word has length 196 [2019-10-02 13:19:42,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:19:42,853 INFO L475 AbstractCegarLoop]: Abstraction has 3057 states and 4147 transitions. [2019-10-02 13:19:42,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 13:19:42,854 INFO L276 IsEmpty]: Start isEmpty. Operand 3057 states and 4147 transitions. [2019-10-02 13:19:42,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-10-02 13:19:42,858 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:19:42,859 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:19:42,859 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:19:42,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:19:42,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1899215644, now seen corresponding path program 1 times [2019-10-02 13:19:42,860 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:19:42,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:19:42,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:19:42,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:19:42,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:19:42,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:19:43,175 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:19:43,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:19:43,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-02 13:19:43,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 13:19:43,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 13:19:43,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:19:43,177 INFO L87 Difference]: Start difference. First operand 3057 states and 4147 transitions. Second operand 18 states. [2019-10-02 13:19:43,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:19:43,669 INFO L93 Difference]: Finished difference Result 5479 states and 7449 transitions. [2019-10-02 13:19:43,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 13:19:43,669 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 197 [2019-10-02 13:19:43,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:19:43,690 INFO L225 Difference]: With dead ends: 5479 [2019-10-02 13:19:43,690 INFO L226 Difference]: Without dead ends: 2823 [2019-10-02 13:19:43,700 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2019-10-02 13:19:43,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2823 states. [2019-10-02 13:19:43,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2823 to 2821. [2019-10-02 13:19:43,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2821 states. [2019-10-02 13:19:43,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2821 states to 2821 states and 3828 transitions. [2019-10-02 13:19:43,827 INFO L78 Accepts]: Start accepts. Automaton has 2821 states and 3828 transitions. Word has length 197 [2019-10-02 13:19:43,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:19:43,829 INFO L475 AbstractCegarLoop]: Abstraction has 2821 states and 3828 transitions. [2019-10-02 13:19:43,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 13:19:43,829 INFO L276 IsEmpty]: Start isEmpty. Operand 2821 states and 3828 transitions. [2019-10-02 13:19:43,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-10-02 13:19:43,834 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:19:43,834 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:19:43,835 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:19:43,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:19:43,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1034670512, now seen corresponding path program 1 times [2019-10-02 13:19:43,835 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:19:43,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:19:43,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:19:43,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:19:43,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:19:43,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:19:46,312 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-02 13:19:46,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:19:46,313 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:19:46,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:19:46,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:19:46,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 2974 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:19:46,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:19:47,422 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-10-02 13:19:47,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:19:47,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [55] total 61 [2019-10-02 13:19:47,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-10-02 13:19:47,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-10-02 13:19:47,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=3525, Unknown=0, NotChecked=0, Total=3660 [2019-10-02 13:19:47,444 INFO L87 Difference]: Start difference. First operand 2821 states and 3828 transitions. Second operand 61 states. [2019-10-02 13:19:54,417 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2019-10-02 13:20:21,182 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-10-02 13:20:33,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:20:33,028 INFO L93 Difference]: Finished difference Result 17595 states and 25040 transitions. [2019-10-02 13:20:33,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2019-10-02 13:20:33,028 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 206 [2019-10-02 13:20:33,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:20:33,119 INFO L225 Difference]: With dead ends: 17595 [2019-10-02 13:20:33,119 INFO L226 Difference]: Without dead ends: 14804 [2019-10-02 13:20:33,149 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 226 SyntacticMatches, 3 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8766 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=1533, Invalid=33249, Unknown=0, NotChecked=0, Total=34782 [2019-10-02 13:20:33,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14804 states. [2019-10-02 13:20:34,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14804 to 14077. [2019-10-02 13:20:34,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14077 states. [2019-10-02 13:20:34,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14077 states to 14077 states and 19846 transitions. [2019-10-02 13:20:34,073 INFO L78 Accepts]: Start accepts. Automaton has 14077 states and 19846 transitions. Word has length 206 [2019-10-02 13:20:34,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:20:34,074 INFO L475 AbstractCegarLoop]: Abstraction has 14077 states and 19846 transitions. [2019-10-02 13:20:34,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-10-02 13:20:34,074 INFO L276 IsEmpty]: Start isEmpty. Operand 14077 states and 19846 transitions. [2019-10-02 13:20:34,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-10-02 13:20:34,088 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:20:34,088 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:20:34,089 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:20:34,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:20:34,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1334305639, now seen corresponding path program 1 times [2019-10-02 13:20:34,089 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:20:34,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:20:34,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:20:34,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:20:34,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:20:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:20:34,239 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:20:34,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:20:34,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:20:34,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:20:34,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:20:34,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:20:34,242 INFO L87 Difference]: Start difference. First operand 14077 states and 19846 transitions. Second operand 3 states. [2019-10-02 13:20:34,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:20:34,877 INFO L93 Difference]: Finished difference Result 28517 states and 40409 transitions. [2019-10-02 13:20:34,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:20:34,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-10-02 13:20:34,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:20:34,976 INFO L225 Difference]: With dead ends: 28517 [2019-10-02 13:20:34,977 INFO L226 Difference]: Without dead ends: 14572 [2019-10-02 13:20:35,029 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:20:35,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14572 states. [2019-10-02 13:20:35,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14572 to 14569. [2019-10-02 13:20:35,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14569 states. [2019-10-02 13:20:35,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14569 states to 14569 states and 20710 transitions. [2019-10-02 13:20:35,702 INFO L78 Accepts]: Start accepts. Automaton has 14569 states and 20710 transitions. Word has length 205 [2019-10-02 13:20:35,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:20:35,705 INFO L475 AbstractCegarLoop]: Abstraction has 14569 states and 20710 transitions. [2019-10-02 13:20:35,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:20:35,705 INFO L276 IsEmpty]: Start isEmpty. Operand 14569 states and 20710 transitions. [2019-10-02 13:20:35,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-10-02 13:20:35,721 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:20:35,722 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-10-02 13:20:35,722 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:20:35,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:20:35,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1305299642, now seen corresponding path program 1 times [2019-10-02 13:20:35,723 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:20:35,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:20:35,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:20:35,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:20:35,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:20:35,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:20:37,812 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 13:20:37,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:20:37,813 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:20:37,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:20:38,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:20:38,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 2976 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:20:38,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:20:38,620 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-02 13:20:38,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:20:38,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [49] total 53 [2019-10-02 13:20:38,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-02 13:20:38,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-02 13:20:38,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=2643, Unknown=0, NotChecked=0, Total=2756 [2019-10-02 13:20:38,629 INFO L87 Difference]: Start difference. First operand 14569 states and 20710 transitions. Second operand 53 states. [2019-10-02 13:21:07,787 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-10-02 13:21:13,006 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-10-02 13:21:17,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:21:17,553 INFO L93 Difference]: Finished difference Result 29802 states and 42634 transitions. [2019-10-02 13:21:17,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2019-10-02 13:21:17,554 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 208 [2019-10-02 13:21:17,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:21:17,612 INFO L225 Difference]: With dead ends: 29802 [2019-10-02 13:21:17,612 INFO L226 Difference]: Without dead ends: 15306 [2019-10-02 13:21:17,657 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 230 SyntacticMatches, 3 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7857 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=1636, Invalid=29164, Unknown=0, NotChecked=0, Total=30800 [2019-10-02 13:21:17,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15306 states. [2019-10-02 13:21:18,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15306 to 14573. [2019-10-02 13:21:18,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14573 states. [2019-10-02 13:21:18,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14573 states to 14573 states and 20717 transitions. [2019-10-02 13:21:18,272 INFO L78 Accepts]: Start accepts. Automaton has 14573 states and 20717 transitions. Word has length 208 [2019-10-02 13:21:18,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:21:18,273 INFO L475 AbstractCegarLoop]: Abstraction has 14573 states and 20717 transitions. [2019-10-02 13:21:18,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-02 13:21:18,273 INFO L276 IsEmpty]: Start isEmpty. Operand 14573 states and 20717 transitions. [2019-10-02 13:21:18,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-02 13:21:18,289 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:21:18,290 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:21:18,290 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:21:18,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:21:18,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1889879928, now seen corresponding path program 1 times [2019-10-02 13:21:18,291 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:21:18,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:21:18,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:18,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:18,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:18,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:18,450 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 13:21:18,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:21:18,450 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:21:18,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:19,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:19,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 2978 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:21:19,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:21:19,433 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 13:21:19,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:21:19,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 16 [2019-10-02 13:21:19,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 13:21:19,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 13:21:19,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-10-02 13:21:19,441 INFO L87 Difference]: Start difference. First operand 14573 states and 20717 transitions. Second operand 16 states. [2019-10-02 13:21:21,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:21:21,658 INFO L93 Difference]: Finished difference Result 23265 states and 32889 transitions. [2019-10-02 13:21:21,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 13:21:21,659 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 210 [2019-10-02 13:21:21,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:21:21,691 INFO L225 Difference]: With dead ends: 23265 [2019-10-02 13:21:21,692 INFO L226 Difference]: Without dead ends: 8753 [2019-10-02 13:21:21,718 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2019-10-02 13:21:21,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8753 states. [2019-10-02 13:21:22,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8753 to 8743. [2019-10-02 13:21:22,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8743 states. [2019-10-02 13:21:22,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8743 states to 8743 states and 12233 transitions. [2019-10-02 13:21:22,114 INFO L78 Accepts]: Start accepts. Automaton has 8743 states and 12233 transitions. Word has length 210 [2019-10-02 13:21:22,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:21:22,114 INFO L475 AbstractCegarLoop]: Abstraction has 8743 states and 12233 transitions. [2019-10-02 13:21:22,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 13:21:22,114 INFO L276 IsEmpty]: Start isEmpty. Operand 8743 states and 12233 transitions. [2019-10-02 13:21:22,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-02 13:21:22,125 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:21:22,126 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:21:22,126 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:21:22,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:21:22,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1392098475, now seen corresponding path program 2 times [2019-10-02 13:21:22,127 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:21:22,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:21:22,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:22,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:22,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:22,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:23,577 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 13:21:23,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:21:23,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2019-10-02 13:21:23,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-02 13:21:23,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-02 13:21:23,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1806, Unknown=0, NotChecked=0, Total=1892 [2019-10-02 13:21:23,578 INFO L87 Difference]: Start difference. First operand 8743 states and 12233 transitions. Second operand 44 states. [2019-10-02 13:21:45,909 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-10-02 13:21:47,990 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-10-02 13:21:49,049 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-10-02 13:21:58,688 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-10-02 13:21:59,373 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-10-02 13:22:05,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:22:05,960 INFO L93 Difference]: Finished difference Result 25771 states and 36391 transitions. [2019-10-02 13:22:05,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2019-10-02 13:22:05,960 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 209 [2019-10-02 13:22:05,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:22:06,039 INFO L225 Difference]: With dead ends: 25771 [2019-10-02 13:22:06,040 INFO L226 Difference]: Without dead ends: 23794 [2019-10-02 13:22:06,060 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14165 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=2971, Invalid=43039, Unknown=0, NotChecked=0, Total=46010 [2019-10-02 13:22:06,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23794 states. [2019-10-02 13:22:06,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23794 to 20228. [2019-10-02 13:22:06,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20228 states. [2019-10-02 13:22:06,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20228 states to 20228 states and 28576 transitions. [2019-10-02 13:22:06,971 INFO L78 Accepts]: Start accepts. Automaton has 20228 states and 28576 transitions. Word has length 209 [2019-10-02 13:22:06,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:22:06,971 INFO L475 AbstractCegarLoop]: Abstraction has 20228 states and 28576 transitions. [2019-10-02 13:22:06,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-02 13:22:06,972 INFO L276 IsEmpty]: Start isEmpty. Operand 20228 states and 28576 transitions. [2019-10-02 13:22:06,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-02 13:22:06,991 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:06,991 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:22:06,992 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:06,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:06,992 INFO L82 PathProgramCache]: Analyzing trace with hash 2118247853, now seen corresponding path program 1 times [2019-10-02 13:22:06,992 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:06,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:06,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:06,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 13:22:06,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:07,261 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:22:07,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:22:07,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-10-02 13:22:07,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 13:22:07,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 13:22:07,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-10-02 13:22:07,263 INFO L87 Difference]: Start difference. First operand 20228 states and 28576 transitions. Second operand 16 states. [2019-10-02 13:22:08,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:22:08,179 INFO L93 Difference]: Finished difference Result 37959 states and 53340 transitions. [2019-10-02 13:22:08,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 13:22:08,179 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 210 [2019-10-02 13:22:08,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:22:08,259 INFO L225 Difference]: With dead ends: 37959 [2019-10-02 13:22:08,259 INFO L226 Difference]: Without dead ends: 20300 [2019-10-02 13:22:08,298 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-10-02 13:22:08,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20300 states. [2019-10-02 13:22:08,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20300 to 20258. [2019-10-02 13:22:08,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20258 states. [2019-10-02 13:22:09,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20258 states to 20258 states and 28582 transitions. [2019-10-02 13:22:09,043 INFO L78 Accepts]: Start accepts. Automaton has 20258 states and 28582 transitions. Word has length 210 [2019-10-02 13:22:09,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:22:09,043 INFO L475 AbstractCegarLoop]: Abstraction has 20258 states and 28582 transitions. [2019-10-02 13:22:09,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 13:22:09,044 INFO L276 IsEmpty]: Start isEmpty. Operand 20258 states and 28582 transitions. [2019-10-02 13:22:09,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-02 13:22:09,062 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:09,062 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:22:09,062 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:09,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:09,063 INFO L82 PathProgramCache]: Analyzing trace with hash -34444934, now seen corresponding path program 1 times [2019-10-02 13:22:09,063 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:09,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:09,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:09,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:09,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:09,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:09,212 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:22:09,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:22:09,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 13:22:09,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 13:22:09,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 13:22:09,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:22:09,215 INFO L87 Difference]: Start difference. First operand 20258 states and 28582 transitions. Second operand 5 states. [2019-10-02 13:22:12,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:22:12,701 INFO L93 Difference]: Finished difference Result 70071 states and 100348 transitions. [2019-10-02 13:22:12,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 13:22:12,701 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-10-02 13:22:12,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:22:12,911 INFO L225 Difference]: With dead ends: 70071 [2019-10-02 13:22:12,911 INFO L226 Difference]: Without dead ends: 54855 [2019-10-02 13:22:12,958 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:22:13,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54855 states. [2019-10-02 13:22:14,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54855 to 54573. [2019-10-02 13:22:14,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54573 states. [2019-10-02 13:22:14,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54573 states to 54573 states and 77663 transitions. [2019-10-02 13:22:14,965 INFO L78 Accepts]: Start accepts. Automaton has 54573 states and 77663 transitions. Word has length 210 [2019-10-02 13:22:14,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:22:14,966 INFO L475 AbstractCegarLoop]: Abstraction has 54573 states and 77663 transitions. [2019-10-02 13:22:14,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 13:22:14,966 INFO L276 IsEmpty]: Start isEmpty. Operand 54573 states and 77663 transitions. [2019-10-02 13:22:14,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-02 13:22:14,995 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:14,996 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:22:14,996 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:14,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:14,996 INFO L82 PathProgramCache]: Analyzing trace with hash 853058747, now seen corresponding path program 1 times [2019-10-02 13:22:14,997 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:14,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:15,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:15,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:15,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:15,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:15,548 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 13:22:15,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:22:15,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2019-10-02 13:22:15,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-02 13:22:15,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-02 13:22:15,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=754, Unknown=0, NotChecked=0, Total=812 [2019-10-02 13:22:15,550 INFO L87 Difference]: Start difference. First operand 54573 states and 77663 transitions. Second operand 29 states. [2019-10-02 13:22:26,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:22:26,187 INFO L93 Difference]: Finished difference Result 156599 states and 224642 transitions. [2019-10-02 13:22:26,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-10-02 13:22:26,187 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 210 [2019-10-02 13:22:26,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:22:26,537 INFO L225 Difference]: With dead ends: 156599 [2019-10-02 13:22:26,537 INFO L226 Difference]: Without dead ends: 114149 [2019-10-02 13:22:26,632 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1686 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=754, Invalid=6902, Unknown=0, NotChecked=0, Total=7656 [2019-10-02 13:22:26,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114149 states. [2019-10-02 13:22:30,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114149 to 112438. [2019-10-02 13:22:30,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112438 states. [2019-10-02 13:22:30,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112438 states to 112438 states and 160361 transitions. [2019-10-02 13:22:30,832 INFO L78 Accepts]: Start accepts. Automaton has 112438 states and 160361 transitions. Word has length 210 [2019-10-02 13:22:30,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:22:30,833 INFO L475 AbstractCegarLoop]: Abstraction has 112438 states and 160361 transitions. [2019-10-02 13:22:30,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-02 13:22:30,833 INFO L276 IsEmpty]: Start isEmpty. Operand 112438 states and 160361 transitions. [2019-10-02 13:22:30,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-02 13:22:30,868 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:30,868 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:22:30,869 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:30,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:30,869 INFO L82 PathProgramCache]: Analyzing trace with hash 446009731, now seen corresponding path program 1 times [2019-10-02 13:22:30,869 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:30,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:30,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:30,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:30,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:31,379 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 13:22:31,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:22:31,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-10-02 13:22:31,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 13:22:31,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 13:22:31,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2019-10-02 13:22:31,381 INFO L87 Difference]: Start difference. First operand 112438 states and 160361 transitions. Second operand 26 states. [2019-10-02 13:22:52,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:22:52,269 INFO L93 Difference]: Finished difference Result 322258 states and 469545 transitions. [2019-10-02 13:22:52,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-10-02 13:22:52,269 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 210 [2019-10-02 13:22:52,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:22:53,695 INFO L225 Difference]: With dead ends: 322258 [2019-10-02 13:22:53,696 INFO L226 Difference]: Without dead ends: 274684 [2019-10-02 13:22:53,839 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1714 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=736, Invalid=6404, Unknown=0, NotChecked=0, Total=7140 [2019-10-02 13:22:54,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274684 states. [2019-10-02 13:23:10,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274684 to 234775. [2019-10-02 13:23:10,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234775 states. [2019-10-02 13:23:11,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234775 states to 234775 states and 341819 transitions. [2019-10-02 13:23:11,461 INFO L78 Accepts]: Start accepts. Automaton has 234775 states and 341819 transitions. Word has length 210 [2019-10-02 13:23:11,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:11,462 INFO L475 AbstractCegarLoop]: Abstraction has 234775 states and 341819 transitions. [2019-10-02 13:23:11,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 13:23:11,462 INFO L276 IsEmpty]: Start isEmpty. Operand 234775 states and 341819 transitions. [2019-10-02 13:23:11,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-02 13:23:11,497 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:11,497 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:23:11,497 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:11,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:11,498 INFO L82 PathProgramCache]: Analyzing trace with hash 2041597932, now seen corresponding path program 1 times [2019-10-02 13:23:11,498 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:11,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:11,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:11,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:11,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:11,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:11,664 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 13:23:11,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:23:11,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 13:23:11,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 13:23:11,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 13:23:11,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 13:23:11,666 INFO L87 Difference]: Start difference. First operand 234775 states and 341819 transitions. Second operand 9 states. [2019-10-02 13:23:14,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:14,704 INFO L93 Difference]: Finished difference Result 234779 states and 341822 transitions. [2019-10-02 13:23:14,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 13:23:14,705 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 210 [2019-10-02 13:23:14,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:14,821 INFO L225 Difference]: With dead ends: 234779 [2019-10-02 13:23:14,821 INFO L226 Difference]: Without dead ends: 37156 [2019-10-02 13:23:15,099 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-10-02 13:23:15,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37156 states. [2019-10-02 13:23:21,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37156 to 37154. [2019-10-02 13:23:21,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37154 states. [2019-10-02 13:23:21,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37154 states to 37154 states and 53307 transitions. [2019-10-02 13:23:21,920 INFO L78 Accepts]: Start accepts. Automaton has 37154 states and 53307 transitions. Word has length 210 [2019-10-02 13:23:21,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:21,920 INFO L475 AbstractCegarLoop]: Abstraction has 37154 states and 53307 transitions. [2019-10-02 13:23:21,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 13:23:21,921 INFO L276 IsEmpty]: Start isEmpty. Operand 37154 states and 53307 transitions. [2019-10-02 13:23:21,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-02 13:23:21,936 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:21,936 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:23:21,937 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:21,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:21,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1420286644, now seen corresponding path program 3 times [2019-10-02 13:23:21,937 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:21,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:21,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:21,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:21,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:21,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:22,453 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-02 13:23:22,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:23:22,454 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:23:22,611 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 13:23:23,093 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-02 13:23:23,094 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 13:23:23,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 2872 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:23:23,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:23:23,324 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 13:23:23,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:23:23,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [28] total 33 [2019-10-02 13:23:23,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-02 13:23:23,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-02 13:23:23,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=984, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 13:23:23,337 INFO L87 Difference]: Start difference. First operand 37154 states and 53307 transitions. Second operand 33 states. [2019-10-02 13:23:51,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:51,397 INFO L93 Difference]: Finished difference Result 91800 states and 134499 transitions. [2019-10-02 13:23:51,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-02 13:23:51,398 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 210 [2019-10-02 13:23:51,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:51,567 INFO L225 Difference]: With dead ends: 91800 [2019-10-02 13:23:51,567 INFO L226 Difference]: Without dead ends: 54724 [2019-10-02 13:23:51,633 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1147 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=742, Invalid=5900, Unknown=0, NotChecked=0, Total=6642 [2019-10-02 13:23:51,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54724 states. [2019-10-02 13:23:53,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54724 to 53500. [2019-10-02 13:23:53,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53500 states. [2019-10-02 13:23:54,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53500 states to 53500 states and 78560 transitions. [2019-10-02 13:23:54,049 INFO L78 Accepts]: Start accepts. Automaton has 53500 states and 78560 transitions. Word has length 210 [2019-10-02 13:23:54,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:54,050 INFO L475 AbstractCegarLoop]: Abstraction has 53500 states and 78560 transitions. [2019-10-02 13:23:54,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-02 13:23:54,050 INFO L276 IsEmpty]: Start isEmpty. Operand 53500 states and 78560 transitions. [2019-10-02 13:23:54,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-02 13:23:54,067 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:54,067 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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:23:54,068 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:54,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:54,068 INFO L82 PathProgramCache]: Analyzing trace with hash 609031421, now seen corresponding path program 2 times [2019-10-02 13:23:54,068 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:54,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:54,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:54,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 13:23:54,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:54,664 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 13:23:54,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:23:54,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2019-10-02 13:23:54,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-02 13:23:54,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-02 13:23:54,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=754, Unknown=0, NotChecked=0, Total=812 [2019-10-02 13:23:54,668 INFO L87 Difference]: Start difference. First operand 53500 states and 78560 transitions. Second operand 29 states. [2019-10-02 13:24:05,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:24:05,319 INFO L93 Difference]: Finished difference Result 146629 states and 215470 transitions. [2019-10-02 13:24:05,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-10-02 13:24:05,319 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 212 [2019-10-02 13:24:05,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:24:05,697 INFO L225 Difference]: With dead ends: 146629 [2019-10-02 13:24:05,698 INFO L226 Difference]: Without dead ends: 130467 [2019-10-02 13:24:05,762 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=767, Invalid=7065, Unknown=0, NotChecked=0, Total=7832 [2019-10-02 13:24:05,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130467 states. [2019-10-02 13:24:11,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130467 to 127428. [2019-10-02 13:24:11,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127428 states. [2019-10-02 13:24:12,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127428 states to 127428 states and 187069 transitions. [2019-10-02 13:24:12,266 INFO L78 Accepts]: Start accepts. Automaton has 127428 states and 187069 transitions. Word has length 212 [2019-10-02 13:24:12,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:24:12,266 INFO L475 AbstractCegarLoop]: Abstraction has 127428 states and 187069 transitions. [2019-10-02 13:24:12,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-02 13:24:12,267 INFO L276 IsEmpty]: Start isEmpty. Operand 127428 states and 187069 transitions. [2019-10-02 13:24:12,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-02 13:24:12,286 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:24:12,286 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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:24:12,287 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:24:12,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:24:12,287 INFO L82 PathProgramCache]: Analyzing trace with hash 201982405, now seen corresponding path program 2 times [2019-10-02 13:24:12,287 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:24:12,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:24:12,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:12,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 13:24:12,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:24:13,962 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 13:24:13,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:24:13,963 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:24:14,128 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 13:24:14,632 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 13:24:14,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 13:24:14,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 2980 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:24:14,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:24:14,886 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 13:24:14,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:24:14,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [28] total 33 [2019-10-02 13:24:14,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-02 13:24:14,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-02 13:24:14,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=984, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 13:24:14,907 INFO L87 Difference]: Start difference. First operand 127428 states and 187069 transitions. Second operand 33 states. [2019-10-02 13:24:56,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:24:56,680 INFO L93 Difference]: Finished difference Result 411998 states and 612663 transitions. [2019-10-02 13:24:56,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-02 13:24:56,680 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 212 [2019-10-02 13:24:56,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:24:57,565 INFO L225 Difference]: With dead ends: 411998 [2019-10-02 13:24:57,565 INFO L226 Difference]: Without dead ends: 284653 [2019-10-02 13:24:57,793 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1147 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=742, Invalid=5900, Unknown=0, NotChecked=0, Total=6642 [2019-10-02 13:24:57,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284653 states. [2019-10-02 13:25:23,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284653 to 279215. [2019-10-02 13:25:23,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279215 states. [2019-10-02 13:25:24,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279215 states to 279215 states and 411460 transitions. [2019-10-02 13:25:24,818 INFO L78 Accepts]: Start accepts. Automaton has 279215 states and 411460 transitions. Word has length 212 [2019-10-02 13:25:24,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:25:24,818 INFO L475 AbstractCegarLoop]: Abstraction has 279215 states and 411460 transitions. [2019-10-02 13:25:24,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-02 13:25:24,818 INFO L276 IsEmpty]: Start isEmpty. Operand 279215 states and 411460 transitions. [2019-10-02 13:25:24,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-02 13:25:24,847 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:25:24,847 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:25:24,847 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:25:24,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:25:24,847 INFO L82 PathProgramCache]: Analyzing trace with hash 20837114, now seen corresponding path program 1 times [2019-10-02 13:25:24,847 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:25:24,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:25:24,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:25:24,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 13:25:24,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:25:24,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:25:25,048 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 13:25:25,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:25:25,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 13:25:25,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 13:25:25,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 13:25:25,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 13:25:25,050 INFO L87 Difference]: Start difference. First operand 279215 states and 411460 transitions. Second operand 12 states. [2019-10-02 13:25:35,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:25:35,288 INFO L93 Difference]: Finished difference Result 279237 states and 411486 transitions. [2019-10-02 13:25:35,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 13:25:35,288 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 213 [2019-10-02 13:25:35,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:25:35,643 INFO L225 Difference]: With dead ends: 279237 [2019-10-02 13:25:35,643 INFO L226 Difference]: Without dead ends: 114671 [2019-10-02 13:25:35,880 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2019-10-02 13:25:35,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114671 states. [2019-10-02 13:25:41,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114671 to 114655. [2019-10-02 13:25:41,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114655 states. [2019-10-02 13:25:41,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114655 states to 114655 states and 168289 transitions. [2019-10-02 13:25:41,883 INFO L78 Accepts]: Start accepts. Automaton has 114655 states and 168289 transitions. Word has length 213 [2019-10-02 13:25:41,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:25:41,884 INFO L475 AbstractCegarLoop]: Abstraction has 114655 states and 168289 transitions. [2019-10-02 13:25:41,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 13:25:41,884 INFO L276 IsEmpty]: Start isEmpty. Operand 114655 states and 168289 transitions. [2019-10-02 13:25:41,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-10-02 13:25:41,896 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:25:41,896 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:25:41,897 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:25:41,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:25:41,897 INFO L82 PathProgramCache]: Analyzing trace with hash -2073103079, now seen corresponding path program 1 times [2019-10-02 13:25:41,897 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:25:41,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:25:41,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:25:41,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:25:41,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:25:41,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:25:42,311 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 13:25:42,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:25:42,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-10-02 13:25:42,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-02 13:25:42,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-02 13:25:42,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2019-10-02 13:25:42,313 INFO L87 Difference]: Start difference. First operand 114655 states and 168289 transitions. Second operand 21 states. [2019-10-02 13:25:52,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:25:52,318 INFO L93 Difference]: Finished difference Result 203123 states and 299127 transitions. [2019-10-02 13:25:52,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-02 13:25:52,319 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 214 [2019-10-02 13:25:52,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:25:52,854 INFO L225 Difference]: With dead ends: 203123 [2019-10-02 13:25:52,855 INFO L226 Difference]: Without dead ends: 166583 [2019-10-02 13:25:52,956 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=230, Invalid=1840, Unknown=0, NotChecked=0, Total=2070 [2019-10-02 13:25:53,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166583 states. [2019-10-02 13:26:05,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166583 to 164641. [2019-10-02 13:26:05,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164641 states. [2019-10-02 13:26:06,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164641 states to 164641 states and 243259 transitions. [2019-10-02 13:26:06,112 INFO L78 Accepts]: Start accepts. Automaton has 164641 states and 243259 transitions. Word has length 214 [2019-10-02 13:26:06,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:26:06,112 INFO L475 AbstractCegarLoop]: Abstraction has 164641 states and 243259 transitions. [2019-10-02 13:26:06,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-02 13:26:06,112 INFO L276 IsEmpty]: Start isEmpty. Operand 164641 states and 243259 transitions. [2019-10-02 13:26:06,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-10-02 13:26:06,124 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:26:06,124 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:26:06,124 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:26:06,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:26:06,125 INFO L82 PathProgramCache]: Analyzing trace with hash -884563894, now seen corresponding path program 1 times [2019-10-02 13:26:06,125 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:26:06,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:26:06,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:06,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:26:06,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:06,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:26:06,330 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 13:26:06,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:26:06,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 13:26:06,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 13:26:06,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 13:26:06,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 13:26:06,332 INFO L87 Difference]: Start difference. First operand 164641 states and 243259 transitions. Second operand 9 states. [2019-10-02 13:26:18,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:26:18,278 INFO L93 Difference]: Finished difference Result 329211 states and 486439 transitions. [2019-10-02 13:26:18,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 13:26:18,283 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 214 [2019-10-02 13:26:18,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:26:18,896 INFO L225 Difference]: With dead ends: 329211 [2019-10-02 13:26:18,896 INFO L226 Difference]: Without dead ends: 164643 [2019-10-02 13:26:19,189 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-10-02 13:26:19,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164643 states. [2019-10-02 13:26:27,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164643 to 164641. [2019-10-02 13:26:27,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164641 states. [2019-10-02 13:26:27,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164641 states to 164641 states and 243258 transitions. [2019-10-02 13:26:27,578 INFO L78 Accepts]: Start accepts. Automaton has 164641 states and 243258 transitions. Word has length 214 [2019-10-02 13:26:27,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:26:27,578 INFO L475 AbstractCegarLoop]: Abstraction has 164641 states and 243258 transitions. [2019-10-02 13:26:27,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 13:26:27,578 INFO L276 IsEmpty]: Start isEmpty. Operand 164641 states and 243258 transitions. [2019-10-02 13:26:27,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-10-02 13:26:27,592 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:26:27,592 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:26:27,592 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:26:27,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:26:27,593 INFO L82 PathProgramCache]: Analyzing trace with hash 438615052, now seen corresponding path program 1 times [2019-10-02 13:26:27,593 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:26:27,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:26:27,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:27,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:26:27,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:27,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:26:27,722 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:26:27,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:26:27,722 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:26:27,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:26:28,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:26:28,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 2980 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 13:26:28,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:26:28,348 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:26:28,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:26:28,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-02 13:26:28,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 13:26:28,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 13:26:28,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:26:28,364 INFO L87 Difference]: Start difference. First operand 164641 states and 243258 transitions. Second operand 5 states. [2019-10-02 13:26:36,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:26:36,609 INFO L93 Difference]: Finished difference Result 272779 states and 402592 transitions. [2019-10-02 13:26:36,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 13:26:36,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 214 [2019-10-02 13:26:36,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:26:37,197 INFO L225 Difference]: With dead ends: 272779 [2019-10-02 13:26:37,198 INFO L226 Difference]: Without dead ends: 164732 [2019-10-02 13:26:37,415 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:26:37,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164732 states. [2019-10-02 13:26:50,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164732 to 164721. [2019-10-02 13:26:50,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164721 states. [2019-10-02 13:26:50,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164721 states to 164721 states and 243383 transitions. [2019-10-02 13:26:50,765 INFO L78 Accepts]: Start accepts. Automaton has 164721 states and 243383 transitions. Word has length 214 [2019-10-02 13:26:50,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:26:50,765 INFO L475 AbstractCegarLoop]: Abstraction has 164721 states and 243383 transitions. [2019-10-02 13:26:50,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 13:26:50,765 INFO L276 IsEmpty]: Start isEmpty. Operand 164721 states and 243383 transitions. [2019-10-02 13:26:51,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-02 13:26:51,492 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:26:51,492 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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:26:51,492 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:26:51,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:26:51,493 INFO L82 PathProgramCache]: Analyzing trace with hash 392630667, now seen corresponding path program 1 times [2019-10-02 13:26:51,493 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:26:51,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:26:51,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:51,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:26:51,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:51,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:26:51,612 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:26:51,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:26:51,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:26:51,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:26:51,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:26:51,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:26:51,614 INFO L87 Difference]: Start difference. First operand 164721 states and 243383 transitions. Second operand 3 states. [2019-10-02 13:27:03,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:27:03,695 INFO L93 Difference]: Finished difference Result 331230 states and 490102 transitions. [2019-10-02 13:27:03,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:27:03,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2019-10-02 13:27:03,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:27:04,276 INFO L225 Difference]: With dead ends: 331230 [2019-10-02 13:27:04,276 INFO L226 Difference]: Without dead ends: 166631 [2019-10-02 13:27:04,532 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:27:04,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166631 states. [2019-10-02 13:27:12,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166631 to 166625. [2019-10-02 13:27:12,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166625 states. [2019-10-02 13:27:13,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166625 states to 166625 states and 246810 transitions. [2019-10-02 13:27:13,381 INFO L78 Accepts]: Start accepts. Automaton has 166625 states and 246810 transitions. Word has length 212 [2019-10-02 13:27:13,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:27:13,382 INFO L475 AbstractCegarLoop]: Abstraction has 166625 states and 246810 transitions. [2019-10-02 13:27:13,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:27:13,382 INFO L276 IsEmpty]: Start isEmpty. Operand 166625 states and 246810 transitions. [2019-10-02 13:27:13,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-02 13:27:13,409 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:27:13,409 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:27:13,409 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:27:13,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:27:13,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1474101001, now seen corresponding path program 1 times [2019-10-02 13:27:13,410 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:27:13,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:27:13,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:27:13,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:27:13,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:27:13,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:27:13,528 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:27:13,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:27:13,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:27:13,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:27:13,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:27:13,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:27:13,532 INFO L87 Difference]: Start difference. First operand 166625 states and 246810 transitions. Second operand 3 states. [2019-10-02 13:27:24,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:27:24,963 INFO L93 Difference]: Finished difference Result 336775 states and 500044 transitions. [2019-10-02 13:27:24,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:27:24,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2019-10-02 13:27:24,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:27:25,552 INFO L225 Difference]: With dead ends: 336775 [2019-10-02 13:27:25,553 INFO L226 Difference]: Without dead ends: 170287 [2019-10-02 13:27:25,836 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:27:25,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170287 states. [2019-10-02 13:27:33,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170287 to 170281. [2019-10-02 13:27:33,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170281 states. [2019-10-02 13:27:35,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170281 states to 170281 states and 253297 transitions. [2019-10-02 13:27:35,117 INFO L78 Accepts]: Start accepts. Automaton has 170281 states and 253297 transitions. Word has length 213 [2019-10-02 13:27:35,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:27:35,117 INFO L475 AbstractCegarLoop]: Abstraction has 170281 states and 253297 transitions. [2019-10-02 13:27:35,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:27:35,117 INFO L276 IsEmpty]: Start isEmpty. Operand 170281 states and 253297 transitions. [2019-10-02 13:27:35,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-10-02 13:27:35,146 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:27:35,146 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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:27:35,146 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:27:35,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:27:35,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1003998571, now seen corresponding path program 1 times [2019-10-02 13:27:35,147 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:27:35,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:27:35,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:27:35,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:27:35,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:27:35,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:27:35,270 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:27:35,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:27:35,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:27:35,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:27:35,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:27:35,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:27:35,272 INFO L87 Difference]: Start difference. First operand 170281 states and 253297 transitions. Second operand 3 states. [2019-10-02 13:27:48,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:27:48,317 INFO L93 Difference]: Finished difference Result 347429 states and 519142 transitions. [2019-10-02 13:27:48,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:27:48,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 214 [2019-10-02 13:27:48,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:27:48,934 INFO L225 Difference]: With dead ends: 347429 [2019-10-02 13:27:48,934 INFO L226 Difference]: Without dead ends: 177297 [2019-10-02 13:27:49,213 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:27:49,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177297 states. [2019-10-02 13:27:57,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177297 to 177291. [2019-10-02 13:27:57,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177291 states. [2019-10-02 13:27:58,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177291 states to 177291 states and 265826 transitions. [2019-10-02 13:27:58,788 INFO L78 Accepts]: Start accepts. Automaton has 177291 states and 265826 transitions. Word has length 214 [2019-10-02 13:27:58,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:27:58,789 INFO L475 AbstractCegarLoop]: Abstraction has 177291 states and 265826 transitions. [2019-10-02 13:27:58,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:27:58,789 INFO L276 IsEmpty]: Start isEmpty. Operand 177291 states and 265826 transitions. [2019-10-02 13:27:58,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-10-02 13:27:58,841 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:27:58,842 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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:27:58,842 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:27:58,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:27:58,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1694075625, now seen corresponding path program 1 times [2019-10-02 13:27:58,842 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:27:58,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:27:58,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:27:58,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:27:58,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:27:58,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:27:58,950 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:27:58,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:27:58,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:27:58,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:27:58,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:27:58,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:27:58,952 INFO L87 Difference]: Start difference. First operand 177291 states and 265826 transitions. Second operand 3 states. [2019-10-02 13:28:10,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:28:10,987 INFO L93 Difference]: Finished difference Result 367875 states and 555760 transitions. [2019-10-02 13:28:10,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:28:10,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 215 [2019-10-02 13:28:10,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:28:11,721 INFO L225 Difference]: With dead ends: 367875 [2019-10-02 13:28:11,721 INFO L226 Difference]: Without dead ends: 190739 [2019-10-02 13:28:12,024 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:28:12,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190739 states. [2019-10-02 13:28:21,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190739 to 190733. [2019-10-02 13:28:21,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190733 states. [2019-10-02 13:28:22,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190733 states to 190733 states and 289731 transitions. [2019-10-02 13:28:22,430 INFO L78 Accepts]: Start accepts. Automaton has 190733 states and 289731 transitions. Word has length 215 [2019-10-02 13:28:22,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:28:22,430 INFO L475 AbstractCegarLoop]: Abstraction has 190733 states and 289731 transitions. [2019-10-02 13:28:22,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:28:22,430 INFO L276 IsEmpty]: Start isEmpty. Operand 190733 states and 289731 transitions. [2019-10-02 13:28:22,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-10-02 13:28:22,526 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:28:22,526 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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:28:22,527 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:28:22,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:28:22,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1740613963, now seen corresponding path program 1 times [2019-10-02 13:28:22,527 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:28:22,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:28:22,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:28:22,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:28:22,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:28:22,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:28:22,640 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:28:22,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:28:22,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:28:22,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:28:22,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:28:22,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:28:22,642 INFO L87 Difference]: Start difference. First operand 190733 states and 289731 transitions. Second operand 3 states. [2019-10-02 13:28:37,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:28:37,610 INFO L93 Difference]: Finished difference Result 407041 states and 625546 transitions. [2019-10-02 13:28:37,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:28:37,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-10-02 13:28:37,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:28:38,519 INFO L225 Difference]: With dead ends: 407041 [2019-10-02 13:28:38,519 INFO L226 Difference]: Without dead ends: 216469 [2019-10-02 13:28:38,821 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:28:38,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216469 states. [2019-10-02 13:28:49,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216469 to 216463. [2019-10-02 13:28:49,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216463 states. [2019-10-02 13:28:50,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216463 states to 216463 states and 335236 transitions. [2019-10-02 13:28:50,359 INFO L78 Accepts]: Start accepts. Automaton has 216463 states and 335236 transitions. Word has length 216 [2019-10-02 13:28:50,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:28:50,359 INFO L475 AbstractCegarLoop]: Abstraction has 216463 states and 335236 transitions. [2019-10-02 13:28:50,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:28:50,359 INFO L276 IsEmpty]: Start isEmpty. Operand 216463 states and 335236 transitions. [2019-10-02 13:28:50,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-10-02 13:28:50,514 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:28:50,514 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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:28:50,514 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:28:50,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:28:50,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1156827447, now seen corresponding path program 1 times [2019-10-02 13:28:50,515 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:28:50,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:28:50,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:28:50,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:28:50,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:28:50,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:28:50,616 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:28:50,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:28:50,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:28:50,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:28:50,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:28:50,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:28:50,618 INFO L87 Difference]: Start difference. First operand 216463 states and 335236 transitions. Second operand 3 states. [2019-10-02 13:29:09,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:29:09,189 INFO L93 Difference]: Finished difference Result 481922 states and 755908 transitions. [2019-10-02 13:29:09,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:29:09,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-10-02 13:29:09,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:29:10,247 INFO L225 Difference]: With dead ends: 481922 [2019-10-02 13:29:10,248 INFO L226 Difference]: Without dead ends: 265629 [2019-10-02 13:29:10,590 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:29:10,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265629 states. [2019-10-02 13:29:24,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265629 to 265623. [2019-10-02 13:29:24,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265623 states. [2019-10-02 13:29:25,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265623 states to 265623 states and 419339 transitions. [2019-10-02 13:29:25,747 INFO L78 Accepts]: Start accepts. Automaton has 265623 states and 419339 transitions. Word has length 217 [2019-10-02 13:29:25,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:29:25,748 INFO L475 AbstractCegarLoop]: Abstraction has 265623 states and 419339 transitions. [2019-10-02 13:29:25,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:29:25,748 INFO L276 IsEmpty]: Start isEmpty. Operand 265623 states and 419339 transitions. [2019-10-02 13:29:26,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-10-02 13:29:26,019 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:29:26,020 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:29:26,020 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:29:26,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:29:26,020 INFO L82 PathProgramCache]: Analyzing trace with hash 110929195, now seen corresponding path program 1 times [2019-10-02 13:29:26,020 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:29:26,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:29:26,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:29:26,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:29:26,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:29:26,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:29:26,135 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:29:26,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:29:26,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:29:26,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:29:26,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:29:26,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:29:26,137 INFO L87 Difference]: Start difference. First operand 265623 states and 419339 transitions. Second operand 3 states. [2019-10-02 13:29:48,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:29:48,419 INFO L93 Difference]: Finished difference Result 624768 states and 1002814 transitions. [2019-10-02 13:29:48,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:29:48,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2019-10-02 13:29:48,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:29:49,531 INFO L225 Difference]: With dead ends: 624768 [2019-10-02 13:29:49,531 INFO L226 Difference]: Without dead ends: 359327 [2019-10-02 13:29:49,941 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:29:50,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359327 states. [2019-10-02 13:30:19,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359327 to 359321. [2019-10-02 13:30:19,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359321 states. [2019-10-02 13:30:21,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359321 states to 359321 states and 580620 transitions. [2019-10-02 13:30:21,329 INFO L78 Accepts]: Start accepts. Automaton has 359321 states and 580620 transitions. Word has length 218 [2019-10-02 13:30:21,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:30:21,330 INFO L475 AbstractCegarLoop]: Abstraction has 359321 states and 580620 transitions. [2019-10-02 13:30:21,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:30:21,330 INFO L276 IsEmpty]: Start isEmpty. Operand 359321 states and 580620 transitions. [2019-10-02 13:30:21,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-10-02 13:30:21,723 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:30:21,724 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:30:21,724 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:30:21,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:30:21,724 INFO L82 PathProgramCache]: Analyzing trace with hash -311624361, now seen corresponding path program 1 times [2019-10-02 13:30:21,724 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:30:21,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:30:21,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:30:21,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:30:21,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:30:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:30:21,835 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:30:21,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:30:21,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:30:21,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:30:21,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:30:21,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:30:21,836 INFO L87 Difference]: Start difference. First operand 359321 states and 580620 transitions. Second operand 3 states.