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_spec4_product24.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 05:14:15,590 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 05:14:15,592 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 05:14:15,604 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 05:14:15,605 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 05:14:15,606 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 05:14:15,607 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 05:14:15,610 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 05:14:15,612 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 05:14:15,613 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 05:14:15,614 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 05:14:15,615 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 05:14:15,615 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 05:14:15,617 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 05:14:15,618 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 05:14:15,628 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 05:14:15,629 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 05:14:15,630 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 05:14:15,632 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 05:14:15,634 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 05:14:15,635 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 05:14:15,636 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 05:14:15,637 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 05:14:15,638 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 05:14:15,640 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 05:14:15,641 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 05:14:15,641 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 05:14:15,642 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 05:14:15,642 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 05:14:15,643 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 05:14:15,643 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 05:14:15,644 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 05:14:15,645 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 05:14:15,646 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 05:14:15,647 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 05:14:15,647 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 05:14:15,648 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 05:14:15,648 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 05:14:15,648 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 05:14:15,649 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 05:14:15,650 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 05:14:15,650 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-09-08 05:14:15,665 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 05:14:15,666 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 05:14:15,667 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 05:14:15,667 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 05:14:15,667 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 05:14:15,668 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 05:14:15,668 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 05:14:15,668 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 05:14:15,668 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 05:14:15,668 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 05:14:15,669 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 05:14:15,669 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 05:14:15,669 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 05:14:15,669 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 05:14:15,669 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 05:14:15,670 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 05:14:15,670 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 05:14:15,670 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 05:14:15,670 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 05:14:15,670 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 05:14:15,671 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 05:14:15,671 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 05:14:15,671 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 05:14:15,671 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 05:14:15,671 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 05:14:15,672 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 05:14:15,672 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 05:14:15,672 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 05:14:15,672 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 05:14:15,707 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 05:14:15,723 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 05:14:15,728 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 05:14:15,729 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 05:14:15,729 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 05:14:15,730 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec4_product24.cil.c [2019-09-08 05:14:15,792 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e059d441/094be5ef7b254ec1aa8ec86c0927c281/FLAG6afcb1e91 [2019-09-08 05:14:16,411 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 05:14:16,412 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec4_product24.cil.c [2019-09-08 05:14:16,436 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e059d441/094be5ef7b254ec1aa8ec86c0927c281/FLAG6afcb1e91 [2019-09-08 05:14:16,643 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e059d441/094be5ef7b254ec1aa8ec86c0927c281 [2019-09-08 05:14:16,653 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 05:14:16,655 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 05:14:16,657 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 05:14:16,657 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 05:14:16,661 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 05:14:16,662 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:14:16" (1/1) ... [2019-09-08 05:14:16,665 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@554e0094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:14:16, skipping insertion in model container [2019-09-08 05:14:16,665 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:14:16" (1/1) ... [2019-09-08 05:14:16,674 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 05:14:16,783 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 05:14:17,608 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:14:17,639 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 05:14:17,757 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:14:17,846 INFO L192 MainTranslator]: Completed translation [2019-09-08 05:14:17,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:14:17 WrapperNode [2019-09-08 05:14:17,847 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 05:14:17,848 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 05:14:17,848 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 05:14:17,848 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 05:14:17,860 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:14:17" (1/1) ... [2019-09-08 05:14:17,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:14:17" (1/1) ... [2019-09-08 05:14:17,891 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:14:17" (1/1) ... [2019-09-08 05:14:17,891 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:14:17" (1/1) ... [2019-09-08 05:14:17,962 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:14:17" (1/1) ... [2019-09-08 05:14:17,995 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:14:17" (1/1) ... [2019-09-08 05:14:18,016 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:14:17" (1/1) ... [2019-09-08 05:14:18,046 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 05:14:18,046 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 05:14:18,047 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 05:14:18,047 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 05:14:18,049 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:14:17" (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-09-08 05:14:18,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 05:14:18,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 05:14:18,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 05:14:18,120 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 05:14:18,121 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-08 05:14:18,121 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-08 05:14:18,121 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-08 05:14:18,121 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-08 05:14:18,122 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-08 05:14:18,123 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-08 05:14:18,123 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-08 05:14:18,123 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-08 05:14:18,124 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-08 05:14:18,124 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-08 05:14:18,125 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-08 05:14:18,125 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-08 05:14:18,128 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-08 05:14:18,128 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-08 05:14:18,128 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-08 05:14:18,129 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-08 05:14:18,129 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-08 05:14:18,129 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-08 05:14:18,129 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-08 05:14:18,130 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-08 05:14:18,130 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-08 05:14:18,130 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-08 05:14:18,130 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-08 05:14:18,130 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-08 05:14:18,130 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-08 05:14:18,131 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-08 05:14:18,131 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-08 05:14:18,131 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-08 05:14:18,132 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-08 05:14:18,132 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-08 05:14:18,132 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 05:14:18,132 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 05:14:18,132 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 05:14:18,132 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 05:14:18,133 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 05:14:18,133 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 05:14:18,133 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 05:14:18,133 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 05:14:18,133 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 05:14:18,134 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 05:14:18,134 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 05:14:18,134 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-08 05:14:18,135 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-08 05:14:18,135 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-08 05:14:18,135 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-08 05:14:18,135 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-08 05:14:18,135 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-08 05:14:18,136 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-08 05:14:18,136 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-08 05:14:18,136 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-08 05:14:18,136 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-08 05:14:18,136 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-08 05:14:18,136 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-08 05:14:18,136 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-08 05:14:18,137 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-08 05:14:18,137 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-08 05:14:18,137 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-08 05:14:18,137 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-08 05:14:18,137 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-08 05:14:18,137 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-08 05:14:18,137 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-08 05:14:18,138 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-08 05:14:18,138 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-08 05:14:18,138 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-08 05:14:18,138 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-08 05:14:18,139 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-08 05:14:18,139 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-08 05:14:18,139 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-08 05:14:18,139 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-08 05:14:18,139 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-08 05:14:18,140 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 05:14:18,141 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 05:14:18,141 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-08 05:14:18,141 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-08 05:14:18,141 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-08 05:14:18,141 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-08 05:14:18,142 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-08 05:14:18,142 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-08 05:14:18,142 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-08 05:14:18,143 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-08 05:14:18,143 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-08 05:14:18,143 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-09-08 05:14:18,143 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-09-08 05:14:18,144 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__SignForward_spec__1 [2019-09-08 05:14:18,145 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AutoResponder [2019-09-08 05:14:18,145 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Forward [2019-09-08 05:14:18,145 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-08 05:14:18,146 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-08 05:14:18,146 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-08 05:14:18,147 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-08 05:14:18,147 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-08 05:14:18,147 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-09-08 05:14:18,147 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-08 05:14:18,147 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-08 05:14:18,147 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Keys [2019-09-08 05:14:18,148 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-09-08 05:14:18,148 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-09-08 05:14:18,148 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-08 05:14:18,148 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-08 05:14:18,148 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-08 05:14:18,148 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-08 05:14:18,148 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-08 05:14:18,149 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-08 05:14:18,149 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-08 05:14:18,149 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-08 05:14:18,149 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-08 05:14:18,149 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-09-08 05:14:18,149 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-09-08 05:14:18,150 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-09-08 05:14:18,150 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-09-08 05:14:18,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 05:14:18,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 05:14:18,150 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-08 05:14:18,151 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-09-08 05:14:18,151 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-08 05:14:18,151 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-08 05:14:18,152 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-08 05:14:18,152 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-09-08 05:14:18,152 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-08 05:14:18,152 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-08 05:14:18,153 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-08 05:14:18,154 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-08 05:14:18,154 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 05:14:18,154 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-08 05:14:18,154 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-08 05:14:18,154 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-08 05:14:18,154 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-08 05:14:18,155 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-08 05:14:18,155 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-08 05:14:18,155 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-08 05:14:18,155 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-08 05:14:18,155 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-08 05:14:18,156 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-08 05:14:18,156 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-08 05:14:18,156 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-08 05:14:18,157 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-08 05:14:18,161 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-08 05:14:18,162 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-08 05:14:18,162 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-08 05:14:18,162 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-08 05:14:18,170 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-08 05:14:18,170 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-08 05:14:18,171 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-08 05:14:18,171 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-08 05:14:18,171 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-08 05:14:18,171 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-08 05:14:18,171 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-08 05:14:18,171 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-08 05:14:18,171 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-08 05:14:18,171 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-08 05:14:18,172 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-08 05:14:18,172 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-08 05:14:18,172 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 05:14:18,173 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-08 05:14:18,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 05:14:18,173 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 05:14:18,173 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 05:14:18,174 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 05:14:18,174 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 05:14:18,174 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 05:14:18,174 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 05:14:18,174 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 05:14:18,174 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 05:14:18,174 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 05:14:18,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 05:14:18,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 05:14:18,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 05:14:18,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 05:14:18,175 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 05:14:18,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 05:14:18,175 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 05:14:18,175 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 05:14:18,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 05:14:18,176 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 05:14:18,176 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 05:14:18,176 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 05:14:18,176 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-08 05:14:18,176 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-08 05:14:18,176 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-08 05:14:18,177 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-08 05:14:18,177 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-08 05:14:18,177 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-08 05:14:18,177 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-08 05:14:18,177 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-08 05:14:18,177 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-08 05:14:18,177 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-08 05:14:18,178 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-08 05:14:18,178 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-08 05:14:18,178 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-08 05:14:18,178 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-08 05:14:18,178 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-08 05:14:18,178 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-08 05:14:18,179 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-08 05:14:18,179 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-08 05:14:18,179 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-08 05:14:18,179 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-08 05:14:18,179 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-08 05:14:18,179 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-08 05:14:18,179 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-08 05:14:18,180 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-08 05:14:18,180 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-08 05:14:18,180 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-08 05:14:18,180 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-08 05:14:18,180 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-08 05:14:18,180 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-08 05:14:18,181 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-08 05:14:18,181 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-08 05:14:18,181 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-08 05:14:18,181 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 05:14:18,181 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 05:14:18,182 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-08 05:14:18,182 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-08 05:14:18,183 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-08 05:14:18,183 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-08 05:14:18,183 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-08 05:14:18,183 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__SignForward_spec__1 [2019-09-08 05:14:18,183 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-08 05:14:18,183 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-08 05:14:18,184 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-08 05:14:18,184 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-08 05:14:18,184 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AutoResponder [2019-09-08 05:14:18,184 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Forward [2019-09-08 05:14:18,184 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-08 05:14:18,184 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-08 05:14:18,184 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-08 05:14:18,185 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-08 05:14:18,185 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-08 05:14:18,185 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-08 05:14:18,185 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-09-08 05:14:18,185 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-09-08 05:14:18,185 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-09-08 05:14:18,186 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-09-08 05:14:18,186 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-09-08 05:14:18,186 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Keys [2019-09-08 05:14:18,186 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-09-08 05:14:18,186 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-09-08 05:14:18,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 05:14:18,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 05:14:18,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 05:14:20,403 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 05:14:20,404 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 05:14:20,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:14:20 BoogieIcfgContainer [2019-09-08 05:14:20,406 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 05:14:20,407 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 05:14:20,407 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 05:14:20,410 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 05:14:20,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 05:14:16" (1/3) ... [2019-09-08 05:14:20,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e6ee9e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:14:20, skipping insertion in model container [2019-09-08 05:14:20,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:14:17" (2/3) ... [2019-09-08 05:14:20,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e6ee9e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:14:20, skipping insertion in model container [2019-09-08 05:14:20,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:14:20" (3/3) ... [2019-09-08 05:14:20,414 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec4_product24.cil.c [2019-09-08 05:14:20,424 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 05:14:20,435 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 05:14:20,452 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 05:14:20,497 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 05:14:20,498 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 05:14:20,498 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 05:14:20,498 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 05:14:20,499 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 05:14:20,499 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 05:14:20,499 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 05:14:20,500 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 05:14:20,504 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 05:14:20,541 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states. [2019-09-08 05:14:20,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-08 05:14:20,574 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:14:20,576 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 05:14:20,582 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:14:20,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:14:20,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1143948929, now seen corresponding path program 1 times [2019-09-08 05:14:20,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:14:20,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:14:20,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:20,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:14:20,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:14:21,135 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:14:21,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:14:21,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 05:14:21,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 05:14:21,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 05:14:21,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 05:14:21,159 INFO L87 Difference]: Start difference. First operand 526 states. Second operand 2 states. [2019-09-08 05:14:21,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:14:21,256 INFO L93 Difference]: Finished difference Result 783 states and 1023 transitions. [2019-09-08 05:14:21,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 05:14:21,258 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 148 [2019-09-08 05:14:21,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:14:21,292 INFO L225 Difference]: With dead ends: 783 [2019-09-08 05:14:21,292 INFO L226 Difference]: Without dead ends: 503 [2019-09-08 05:14:21,302 INFO L628 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-09-08 05:14:21,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2019-09-08 05:14:21,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 503. [2019-09-08 05:14:21,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2019-09-08 05:14:21,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 663 transitions. [2019-09-08 05:14:21,452 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 663 transitions. Word has length 148 [2019-09-08 05:14:21,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:14:21,455 INFO L475 AbstractCegarLoop]: Abstraction has 503 states and 663 transitions. [2019-09-08 05:14:21,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 05:14:21,455 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 663 transitions. [2019-09-08 05:14:21,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-08 05:14:21,467 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:14:21,467 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 05:14:21,468 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:14:21,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:14:21,469 INFO L82 PathProgramCache]: Analyzing trace with hash 400393156, now seen corresponding path program 1 times [2019-09-08 05:14:21,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:14:21,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:14:21,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:21,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:14:21,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:14:21,765 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:14:21,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:14:21,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:14:21,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:14:21,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:14:21,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:14:21,770 INFO L87 Difference]: Start difference. First operand 503 states and 663 transitions. Second operand 3 states. [2019-09-08 05:14:21,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:14:21,828 INFO L93 Difference]: Finished difference Result 766 states and 992 transitions. [2019-09-08 05:14:21,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:14:21,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-09-08 05:14:21,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:14:21,833 INFO L225 Difference]: With dead ends: 766 [2019-09-08 05:14:21,834 INFO L226 Difference]: Without dead ends: 506 [2019-09-08 05:14:21,836 INFO L628 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-09-08 05:14:21,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-09-08 05:14:21,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 505. [2019-09-08 05:14:21,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-09-08 05:14:21,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 665 transitions. [2019-09-08 05:14:21,859 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 665 transitions. Word has length 149 [2019-09-08 05:14:21,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:14:21,860 INFO L475 AbstractCegarLoop]: Abstraction has 505 states and 665 transitions. [2019-09-08 05:14:21,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:14:21,860 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 665 transitions. [2019-09-08 05:14:21,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 05:14:21,863 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:14:21,864 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 05:14:21,864 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:14:21,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:14:21,864 INFO L82 PathProgramCache]: Analyzing trace with hash 801384450, now seen corresponding path program 1 times [2019-09-08 05:14:21,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:14:21,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:14:21,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:21,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:14:21,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:21,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:14:22,022 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:14:22,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:14:22,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:14:22,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:14:22,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:14:22,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:14:22,024 INFO L87 Difference]: Start difference. First operand 505 states and 665 transitions. Second operand 3 states. [2019-09-08 05:14:22,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:14:22,078 INFO L93 Difference]: Finished difference Result 988 states and 1331 transitions. [2019-09-08 05:14:22,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:14:22,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-09-08 05:14:22,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:14:22,090 INFO L225 Difference]: With dead ends: 988 [2019-09-08 05:14:22,091 INFO L226 Difference]: Without dead ends: 548 [2019-09-08 05:14:22,095 INFO L628 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-09-08 05:14:22,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2019-09-08 05:14:22,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 547. [2019-09-08 05:14:22,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 05:14:22,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 737 transitions. [2019-09-08 05:14:22,134 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 737 transitions. Word has length 161 [2019-09-08 05:14:22,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:14:22,137 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 737 transitions. [2019-09-08 05:14:22,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:14:22,138 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 737 transitions. [2019-09-08 05:14:22,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-08 05:14:22,145 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:14:22,146 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 05:14:22,146 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:14:22,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:14:22,146 INFO L82 PathProgramCache]: Analyzing trace with hash 710621825, now seen corresponding path program 1 times [2019-09-08 05:14:22,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:14:22,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:14:22,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:22,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:14:22,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:22,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:14:22,399 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:14:22,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:14:22,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:14:22,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:14:22,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:14:22,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:14:22,401 INFO L87 Difference]: Start difference. First operand 547 states and 737 transitions. Second operand 3 states. [2019-09-08 05:14:22,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:14:22,449 INFO L93 Difference]: Finished difference Result 1111 states and 1542 transitions. [2019-09-08 05:14:22,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:14:22,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2019-09-08 05:14:22,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:14:22,455 INFO L225 Difference]: With dead ends: 1111 [2019-09-08 05:14:22,455 INFO L226 Difference]: Without dead ends: 629 [2019-09-08 05:14:22,457 INFO L628 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-09-08 05:14:22,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-09-08 05:14:22,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 628. [2019-09-08 05:14:22,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2019-09-08 05:14:22,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 875 transitions. [2019-09-08 05:14:22,481 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 875 transitions. Word has length 162 [2019-09-08 05:14:22,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:14:22,481 INFO L475 AbstractCegarLoop]: Abstraction has 628 states and 875 transitions. [2019-09-08 05:14:22,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:14:22,482 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 875 transitions. [2019-09-08 05:14:22,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 05:14:22,485 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:14:22,486 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 05:14:22,486 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:14:22,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:14:22,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1652131102, now seen corresponding path program 1 times [2019-09-08 05:14:22,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:14:22,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:14:22,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:22,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:14:22,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:22,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:14:22,675 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:14:22,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:14:22,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 05:14:22,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:14:22,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:14:22,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:14:22,677 INFO L87 Difference]: Start difference. First operand 628 states and 875 transitions. Second operand 7 states. [2019-09-08 05:14:25,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:14:25,669 INFO L93 Difference]: Finished difference Result 1140 states and 1524 transitions. [2019-09-08 05:14:25,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 05:14:25,669 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 165 [2019-09-08 05:14:25,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:14:25,675 INFO L225 Difference]: With dead ends: 1140 [2019-09-08 05:14:25,675 INFO L226 Difference]: Without dead ends: 891 [2019-09-08 05:14:25,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:14:25,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2019-09-08 05:14:25,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 882. [2019-09-08 05:14:25,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 882 states. [2019-09-08 05:14:25,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1198 transitions. [2019-09-08 05:14:25,726 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1198 transitions. Word has length 165 [2019-09-08 05:14:25,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:14:25,728 INFO L475 AbstractCegarLoop]: Abstraction has 882 states and 1198 transitions. [2019-09-08 05:14:25,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 05:14:25,728 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1198 transitions. [2019-09-08 05:14:25,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 05:14:25,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:14:25,732 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 05:14:25,732 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:14:25,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:14:25,733 INFO L82 PathProgramCache]: Analyzing trace with hash -179891340, now seen corresponding path program 1 times [2019-09-08 05:14:25,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:14:25,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:14:25,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:25,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:14:25,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:25,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:14:26,039 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:14:26,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:14:26,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 05:14:26,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 05:14:26,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 05:14:26,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-09-08 05:14:26,042 INFO L87 Difference]: Start difference. First operand 882 states and 1198 transitions. Second operand 16 states. [2019-09-08 05:14:26,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:14:26,482 INFO L93 Difference]: Finished difference Result 1441 states and 1915 transitions. [2019-09-08 05:14:26,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 05:14:26,482 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 166 [2019-09-08 05:14:26,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:14:26,489 INFO L225 Difference]: With dead ends: 1441 [2019-09-08 05:14:26,490 INFO L226 Difference]: Without dead ends: 914 [2019-09-08 05:14:26,491 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-09-08 05:14:26,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2019-09-08 05:14:26,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 910. [2019-09-08 05:14:26,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 910 states. [2019-09-08 05:14:26,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1235 transitions. [2019-09-08 05:14:26,545 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1235 transitions. Word has length 166 [2019-09-08 05:14:26,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:14:26,546 INFO L475 AbstractCegarLoop]: Abstraction has 910 states and 1235 transitions. [2019-09-08 05:14:26,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 05:14:26,547 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1235 transitions. [2019-09-08 05:14:26,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 05:14:26,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:14:26,550 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 05:14:26,551 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:14:26,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:14:26,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1824277491, now seen corresponding path program 1 times [2019-09-08 05:14:26,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:14:26,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:14:26,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:26,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:14:26,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:26,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:14:26,743 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:14:26,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:14:26,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:14:26,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:14:26,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:14:26,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:14:26,745 INFO L87 Difference]: Start difference. First operand 910 states and 1235 transitions. Second operand 8 states. [2019-09-08 05:14:27,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:14:27,749 INFO L93 Difference]: Finished difference Result 1561 states and 2068 transitions. [2019-09-08 05:14:27,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 05:14:27,750 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 175 [2019-09-08 05:14:27,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:14:27,761 INFO L225 Difference]: With dead ends: 1561 [2019-09-08 05:14:27,761 INFO L226 Difference]: Without dead ends: 1474 [2019-09-08 05:14:27,763 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:14:27,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2019-09-08 05:14:27,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1461. [2019-09-08 05:14:27,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1461 states. [2019-09-08 05:14:27,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1461 states and 1946 transitions. [2019-09-08 05:14:27,875 INFO L78 Accepts]: Start accepts. Automaton has 1461 states and 1946 transitions. Word has length 175 [2019-09-08 05:14:27,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:14:27,875 INFO L475 AbstractCegarLoop]: Abstraction has 1461 states and 1946 transitions. [2019-09-08 05:14:27,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:14:27,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 1946 transitions. [2019-09-08 05:14:27,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 05:14:27,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:14:27,880 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 05:14:27,880 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:14:27,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:14:27,881 INFO L82 PathProgramCache]: Analyzing trace with hash -819623501, now seen corresponding path program 1 times [2019-09-08 05:14:27,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:14:27,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:14:27,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:27,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:14:27,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:27,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:14:28,301 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-08 05:14:28,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:14:28,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 05:14:28,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 05:14:28,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 05:14:28,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-09-08 05:14:28,305 INFO L87 Difference]: Start difference. First operand 1461 states and 1946 transitions. Second operand 15 states. [2019-09-08 05:14:28,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:14:28,923 INFO L93 Difference]: Finished difference Result 1982 states and 2605 transitions. [2019-09-08 05:14:28,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 05:14:28,923 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 176 [2019-09-08 05:14:28,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:14:28,932 INFO L225 Difference]: With dead ends: 1982 [2019-09-08 05:14:28,932 INFO L226 Difference]: Without dead ends: 1460 [2019-09-08 05:14:28,935 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=615, Unknown=0, NotChecked=0, Total=702 [2019-09-08 05:14:28,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2019-09-08 05:14:28,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1459. [2019-09-08 05:14:28,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1459 states. [2019-09-08 05:14:29,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 1941 transitions. [2019-09-08 05:14:29,004 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 1941 transitions. Word has length 176 [2019-09-08 05:14:29,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:14:29,005 INFO L475 AbstractCegarLoop]: Abstraction has 1459 states and 1941 transitions. [2019-09-08 05:14:29,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 05:14:29,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 1941 transitions. [2019-09-08 05:14:29,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 05:14:29,009 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:14:29,009 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 05:14:29,010 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:14:29,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:14:29,010 INFO L82 PathProgramCache]: Analyzing trace with hash -429039633, now seen corresponding path program 2 times [2019-09-08 05:14:29,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:14:29,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:14:29,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:29,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:14:29,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:29,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:14:29,209 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-08 05:14:29,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:14:29,209 INFO L223 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-09-08 05:14:29,230 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 05:14:29,541 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-09-08 05:14:29,541 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 05:14:29,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 1962 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 05:14:29,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:14:29,815 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-09-08 05:14:29,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:14:29,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2019-09-08 05:14:29,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 05:14:29,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 05:14:29,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2019-09-08 05:14:29,836 INFO L87 Difference]: Start difference. First operand 1459 states and 1941 transitions. Second operand 17 states. [2019-09-08 05:14:31,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:14:31,913 INFO L93 Difference]: Finished difference Result 3088 states and 4112 transitions. [2019-09-08 05:14:31,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 05:14:31,914 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 176 [2019-09-08 05:14:31,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:14:31,934 INFO L225 Difference]: With dead ends: 3088 [2019-09-08 05:14:31,934 INFO L226 Difference]: Without dead ends: 2436 [2019-09-08 05:14:31,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=199, Invalid=1523, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 05:14:31,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2436 states. [2019-09-08 05:14:32,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2436 to 2417. [2019-09-08 05:14:32,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2417 states. [2019-09-08 05:14:32,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2417 states to 2417 states and 3260 transitions. [2019-09-08 05:14:32,126 INFO L78 Accepts]: Start accepts. Automaton has 2417 states and 3260 transitions. Word has length 176 [2019-09-08 05:14:32,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:14:32,127 INFO L475 AbstractCegarLoop]: Abstraction has 2417 states and 3260 transitions. [2019-09-08 05:14:32,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 05:14:32,127 INFO L276 IsEmpty]: Start isEmpty. Operand 2417 states and 3260 transitions. [2019-09-08 05:14:32,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-09-08 05:14:32,151 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:14:32,152 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:14:32,152 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:14:32,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:14:32,153 INFO L82 PathProgramCache]: Analyzing trace with hash -217673920, now seen corresponding path program 1 times [2019-09-08 05:14:32,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:14:32,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:14:32,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:32,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 05:14:32,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:32,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:14:32,479 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-09-08 05:14:32,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:14:32,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:14:32,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:14:32,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:14:32,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:14:32,481 INFO L87 Difference]: Start difference. First operand 2417 states and 3260 transitions. Second operand 8 states. [2019-09-08 05:14:32,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:14:32,586 INFO L93 Difference]: Finished difference Result 3750 states and 4884 transitions. [2019-09-08 05:14:32,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 05:14:32,587 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 282 [2019-09-08 05:14:32,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:14:32,600 INFO L225 Difference]: With dead ends: 3750 [2019-09-08 05:14:32,601 INFO L226 Difference]: Without dead ends: 2417 [2019-09-08 05:14:32,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:14:32,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2019-09-08 05:14:32,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 2417. [2019-09-08 05:14:32,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2417 states. [2019-09-08 05:14:32,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2417 states to 2417 states and 3254 transitions. [2019-09-08 05:14:32,731 INFO L78 Accepts]: Start accepts. Automaton has 2417 states and 3254 transitions. Word has length 282 [2019-09-08 05:14:32,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:14:32,732 INFO L475 AbstractCegarLoop]: Abstraction has 2417 states and 3254 transitions. [2019-09-08 05:14:32,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:14:32,732 INFO L276 IsEmpty]: Start isEmpty. Operand 2417 states and 3254 transitions. [2019-09-08 05:14:32,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-09-08 05:14:32,744 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:14:32,745 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 05:14:32,745 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:14:32,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:14:32,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1779720117, now seen corresponding path program 1 times [2019-09-08 05:14:32,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:14:32,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:14:32,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:32,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:14:32,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:32,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:14:33,003 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-08 05:14:33,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:14:33,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 05:14:33,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 05:14:33,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 05:14:33,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:14:33,005 INFO L87 Difference]: Start difference. First operand 2417 states and 3254 transitions. Second operand 13 states. [2019-09-08 05:14:35,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:14:35,774 INFO L93 Difference]: Finished difference Result 6037 states and 8031 transitions. [2019-09-08 05:14:35,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 05:14:35,775 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 288 [2019-09-08 05:14:35,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:14:35,809 INFO L225 Difference]: With dead ends: 6037 [2019-09-08 05:14:35,810 INFO L226 Difference]: Without dead ends: 4842 [2019-09-08 05:14:35,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2019-09-08 05:14:35,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4842 states. [2019-09-08 05:14:36,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4842 to 4737. [2019-09-08 05:14:36,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4737 states. [2019-09-08 05:14:36,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4737 states to 4737 states and 6386 transitions. [2019-09-08 05:14:36,130 INFO L78 Accepts]: Start accepts. Automaton has 4737 states and 6386 transitions. Word has length 288 [2019-09-08 05:14:36,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:14:36,131 INFO L475 AbstractCegarLoop]: Abstraction has 4737 states and 6386 transitions. [2019-09-08 05:14:36,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 05:14:36,131 INFO L276 IsEmpty]: Start isEmpty. Operand 4737 states and 6386 transitions. [2019-09-08 05:14:36,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-09-08 05:14:36,160 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:14:36,161 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:14:36,161 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:14:36,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:14:36,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1875855851, now seen corresponding path program 1 times [2019-09-08 05:14:36,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:14:36,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:14:36,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:36,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:14:36,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:36,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:14:36,341 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-09-08 05:14:36,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:14:36,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:14:36,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:14:36,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:14:36,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:14:36,344 INFO L87 Difference]: Start difference. First operand 4737 states and 6386 transitions. Second operand 3 states. [2019-09-08 05:14:36,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:14:36,546 INFO L93 Difference]: Finished difference Result 10028 states and 13783 transitions. [2019-09-08 05:14:36,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:14:36,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 287 [2019-09-08 05:14:36,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:14:36,584 INFO L225 Difference]: With dead ends: 10028 [2019-09-08 05:14:36,585 INFO L226 Difference]: Without dead ends: 5365 [2019-09-08 05:14:36,602 INFO L628 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-09-08 05:14:36,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5365 states. [2019-09-08 05:14:36,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5365 to 5361. [2019-09-08 05:14:36,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5361 states. [2019-09-08 05:14:36,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5361 states to 5361 states and 7462 transitions. [2019-09-08 05:14:36,882 INFO L78 Accepts]: Start accepts. Automaton has 5361 states and 7462 transitions. Word has length 287 [2019-09-08 05:14:36,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:14:36,883 INFO L475 AbstractCegarLoop]: Abstraction has 5361 states and 7462 transitions. [2019-09-08 05:14:36,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:14:36,883 INFO L276 IsEmpty]: Start isEmpty. Operand 5361 states and 7462 transitions. [2019-09-08 05:14:36,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-09-08 05:14:36,915 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:14:36,916 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:14:36,916 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:14:36,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:14:36,917 INFO L82 PathProgramCache]: Analyzing trace with hash -79460746, now seen corresponding path program 1 times [2019-09-08 05:14:36,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:14:36,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:14:36,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:36,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:14:36,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:14:37,355 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-09-08 05:14:37,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:14:37,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 05:14:37,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 05:14:37,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 05:14:37,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 05:14:37,357 INFO L87 Difference]: Start difference. First operand 5361 states and 7462 transitions. Second operand 9 states. [2019-09-08 05:14:37,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:14:37,626 INFO L93 Difference]: Finished difference Result 7610 states and 10221 transitions. [2019-09-08 05:14:37,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 05:14:37,627 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 290 [2019-09-08 05:14:37,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:14:37,669 INFO L225 Difference]: With dead ends: 7610 [2019-09-08 05:14:37,669 INFO L226 Difference]: Without dead ends: 5499 [2019-09-08 05:14:37,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-08 05:14:37,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5499 states. [2019-09-08 05:14:37,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5499 to 5427. [2019-09-08 05:14:37,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5427 states. [2019-09-08 05:14:37,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5427 states to 5427 states and 7546 transitions. [2019-09-08 05:14:37,948 INFO L78 Accepts]: Start accepts. Automaton has 5427 states and 7546 transitions. Word has length 290 [2019-09-08 05:14:37,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:14:37,949 INFO L475 AbstractCegarLoop]: Abstraction has 5427 states and 7546 transitions. [2019-09-08 05:14:37,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 05:14:37,949 INFO L276 IsEmpty]: Start isEmpty. Operand 5427 states and 7546 transitions. [2019-09-08 05:14:37,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-09-08 05:14:37,977 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:14:37,978 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:14:37,978 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:14:37,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:14:37,979 INFO L82 PathProgramCache]: Analyzing trace with hash -849772088, now seen corresponding path program 1 times [2019-09-08 05:14:37,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:14:37,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:14:37,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:37,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:14:37,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:14:38,240 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-09-08 05:14:38,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:14:38,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 05:14:38,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 05:14:38,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 05:14:38,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-08 05:14:38,243 INFO L87 Difference]: Start difference. First operand 5427 states and 7546 transitions. Second operand 11 states. [2019-09-08 05:14:41,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:14:41,766 INFO L93 Difference]: Finished difference Result 8142 states and 10833 transitions. [2019-09-08 05:14:41,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 05:14:41,767 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 290 [2019-09-08 05:14:41,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:14:41,797 INFO L225 Difference]: With dead ends: 8142 [2019-09-08 05:14:41,798 INFO L226 Difference]: Without dead ends: 6711 [2019-09-08 05:14:41,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2019-09-08 05:14:41,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6711 states. [2019-09-08 05:14:42,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6711 to 6639. [2019-09-08 05:14:42,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6639 states. [2019-09-08 05:14:42,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6639 states to 6639 states and 8998 transitions. [2019-09-08 05:14:42,132 INFO L78 Accepts]: Start accepts. Automaton has 6639 states and 8998 transitions. Word has length 290 [2019-09-08 05:14:42,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:14:42,133 INFO L475 AbstractCegarLoop]: Abstraction has 6639 states and 8998 transitions. [2019-09-08 05:14:42,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 05:14:42,133 INFO L276 IsEmpty]: Start isEmpty. Operand 6639 states and 8998 transitions. [2019-09-08 05:14:42,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-09-08 05:14:42,164 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:14:42,165 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:14:42,165 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:14:42,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:14:42,166 INFO L82 PathProgramCache]: Analyzing trace with hash 248167711, now seen corresponding path program 1 times [2019-09-08 05:14:42,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:14:42,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:14:42,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:42,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:14:42,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:42,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:14:43,282 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-08 05:14:43,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:14:43,283 INFO L223 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) [2019-09-08 05:14:43,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:14:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:14:43,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 3136 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:14:43,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:14:44,176 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-08 05:14:44,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:14:44,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [35] total 42 [2019-09-08 05:14:44,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-08 05:14:44,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-08 05:14:44,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1635, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 05:14:44,198 INFO L87 Difference]: Start difference. First operand 6639 states and 8998 transitions. Second operand 42 states. [2019-09-08 05:14:50,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:14:50,573 INFO L93 Difference]: Finished difference Result 14529 states and 19497 transitions. [2019-09-08 05:14:50,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-08 05:14:50,574 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 307 [2019-09-08 05:14:50,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:14:50,602 INFO L225 Difference]: With dead ends: 14529 [2019-09-08 05:14:50,602 INFO L226 Difference]: Without dead ends: 7568 [2019-09-08 05:14:50,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 955 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=363, Invalid=7119, Unknown=0, NotChecked=0, Total=7482 [2019-09-08 05:14:50,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7568 states. [2019-09-08 05:14:51,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7568 to 7177. [2019-09-08 05:14:51,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7177 states. [2019-09-08 05:14:51,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7177 states to 7177 states and 9611 transitions. [2019-09-08 05:14:51,107 INFO L78 Accepts]: Start accepts. Automaton has 7177 states and 9611 transitions. Word has length 307 [2019-09-08 05:14:51,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:14:51,107 INFO L475 AbstractCegarLoop]: Abstraction has 7177 states and 9611 transitions. [2019-09-08 05:14:51,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-08 05:14:51,107 INFO L276 IsEmpty]: Start isEmpty. Operand 7177 states and 9611 transitions. [2019-09-08 05:14:51,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-08 05:14:51,138 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:14:51,139 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:14:51,140 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:14:51,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:14:51,140 INFO L82 PathProgramCache]: Analyzing trace with hash -136694712, now seen corresponding path program 1 times [2019-09-08 05:14:51,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:14:51,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:14:51,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:51,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:14:51,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:51,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:14:51,512 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-09-08 05:14:51,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:14:51,512 INFO L223 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) [2019-09-08 05:14:51,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:14:51,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:14:51,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 3182 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:14:51,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:14:52,140 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-08 05:14:52,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:14:52,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [18] total 23 [2019-09-08 05:14:52,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 05:14:52,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 05:14:52,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2019-09-08 05:14:52,150 INFO L87 Difference]: Start difference. First operand 7177 states and 9611 transitions. Second operand 23 states. [2019-09-08 05:14:55,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:14:55,986 INFO L93 Difference]: Finished difference Result 15334 states and 20395 transitions. [2019-09-08 05:14:55,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 05:14:55,988 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 320 [2019-09-08 05:14:55,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:14:56,019 INFO L225 Difference]: With dead ends: 15334 [2019-09-08 05:14:56,020 INFO L226 Difference]: Without dead ends: 8152 [2019-09-08 05:14:56,044 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=205, Invalid=2051, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 05:14:56,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8152 states. [2019-09-08 05:14:56,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8152 to 7901. [2019-09-08 05:14:56,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7901 states. [2019-09-08 05:14:56,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7901 states to 7901 states and 10448 transitions. [2019-09-08 05:14:56,476 INFO L78 Accepts]: Start accepts. Automaton has 7901 states and 10448 transitions. Word has length 320 [2019-09-08 05:14:56,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:14:56,477 INFO L475 AbstractCegarLoop]: Abstraction has 7901 states and 10448 transitions. [2019-09-08 05:14:56,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 05:14:56,478 INFO L276 IsEmpty]: Start isEmpty. Operand 7901 states and 10448 transitions. [2019-09-08 05:14:56,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-08 05:14:56,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:14:56,527 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:14:56,528 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:14:56,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:14:56,528 INFO L82 PathProgramCache]: Analyzing trace with hash -669395263, now seen corresponding path program 1 times [2019-09-08 05:14:56,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:14:56,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:14:56,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:56,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:14:56,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:14:56,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:14:56,885 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-08 05:14:56,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:14:56,886 INFO L223 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-09-08 05:14:56,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:14:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:14:57,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 3180 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:14:57,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:14:57,528 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-09-08 05:14:57,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:14:57,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2019-09-08 05:14:57,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 05:14:57,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 05:14:57,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-09-08 05:14:57,537 INFO L87 Difference]: Start difference. First operand 7901 states and 10448 transitions. Second operand 14 states. [2019-09-08 05:15:01,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:15:01,780 INFO L93 Difference]: Finished difference Result 16888 states and 22668 transitions. [2019-09-08 05:15:01,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 05:15:01,790 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 318 [2019-09-08 05:15:01,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:15:01,878 INFO L225 Difference]: With dead ends: 16888 [2019-09-08 05:15:01,878 INFO L226 Difference]: Without dead ends: 9015 [2019-09-08 05:15:01,926 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=969, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 05:15:01,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9015 states. [2019-09-08 05:15:02,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9015 to 8541. [2019-09-08 05:15:02,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8541 states. [2019-09-08 05:15:02,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8541 states to 8541 states and 11611 transitions. [2019-09-08 05:15:02,401 INFO L78 Accepts]: Start accepts. Automaton has 8541 states and 11611 transitions. Word has length 318 [2019-09-08 05:15:02,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:15:02,402 INFO L475 AbstractCegarLoop]: Abstraction has 8541 states and 11611 transitions. [2019-09-08 05:15:02,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 05:15:02,402 INFO L276 IsEmpty]: Start isEmpty. Operand 8541 states and 11611 transitions. [2019-09-08 05:15:02,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-09-08 05:15:02,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:15:02,431 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:15:02,431 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:15:02,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:15:02,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1957473541, now seen corresponding path program 1 times [2019-09-08 05:15:02,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:15:02,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:15:02,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:15:02,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:15:02,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:15:02,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:15:02,842 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-08 05:15:02,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:15:02,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 05:15:02,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:15:02,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:15:02,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:15:02,845 INFO L87 Difference]: Start difference. First operand 8541 states and 11611 transitions. Second operand 18 states. [2019-09-08 05:15:04,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:15:04,723 INFO L93 Difference]: Finished difference Result 8874 states and 11984 transitions. [2019-09-08 05:15:04,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 05:15:04,725 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 323 [2019-09-08 05:15:04,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:15:04,749 INFO L225 Difference]: With dead ends: 8874 [2019-09-08 05:15:04,750 INFO L226 Difference]: Without dead ends: 8788 [2019-09-08 05:15:04,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=954, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 05:15:04,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8788 states. [2019-09-08 05:15:05,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8788 to 8667. [2019-09-08 05:15:05,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8667 states. [2019-09-08 05:15:05,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8667 states to 8667 states and 11748 transitions. [2019-09-08 05:15:05,208 INFO L78 Accepts]: Start accepts. Automaton has 8667 states and 11748 transitions. Word has length 323 [2019-09-08 05:15:05,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:15:05,209 INFO L475 AbstractCegarLoop]: Abstraction has 8667 states and 11748 transitions. [2019-09-08 05:15:05,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 05:15:05,209 INFO L276 IsEmpty]: Start isEmpty. Operand 8667 states and 11748 transitions. [2019-09-08 05:15:05,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-09-08 05:15:05,244 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:15:05,244 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:15:05,245 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:15:05,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:15:05,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1178888307, now seen corresponding path program 1 times [2019-09-08 05:15:05,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:15:05,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:15:05,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:15:05,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:15:05,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:15:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:15:05,473 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-09-08 05:15:05,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:15:05,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:15:05,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:15:05,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:15:05,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:15:05,476 INFO L87 Difference]: Start difference. First operand 8667 states and 11748 transitions. Second operand 8 states. [2019-09-08 05:15:10,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:15:10,257 INFO L93 Difference]: Finished difference Result 22617 states and 29900 transitions. [2019-09-08 05:15:10,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 05:15:10,258 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 323 [2019-09-08 05:15:10,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:15:10,319 INFO L225 Difference]: With dead ends: 22617 [2019-09-08 05:15:10,319 INFO L226 Difference]: Without dead ends: 19953 [2019-09-08 05:15:10,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-08 05:15:10,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19953 states. [2019-09-08 05:15:11,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19953 to 17739. [2019-09-08 05:15:11,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17739 states. [2019-09-08 05:15:11,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17739 states to 17739 states and 24144 transitions. [2019-09-08 05:15:11,414 INFO L78 Accepts]: Start accepts. Automaton has 17739 states and 24144 transitions. Word has length 323 [2019-09-08 05:15:11,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:15:11,415 INFO L475 AbstractCegarLoop]: Abstraction has 17739 states and 24144 transitions. [2019-09-08 05:15:11,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:15:11,415 INFO L276 IsEmpty]: Start isEmpty. Operand 17739 states and 24144 transitions. [2019-09-08 05:15:11,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-08 05:15:11,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:15:11,457 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:15:11,458 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:15:11,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:15:11,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1544442236, now seen corresponding path program 1 times [2019-09-08 05:15:11,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:15:11,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:15:11,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:15:11,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:15:11,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:15:11,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:15:11,661 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-09-08 05:15:11,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:15:11,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:15:11,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:15:11,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:15:11,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:15:11,663 INFO L87 Difference]: Start difference. First operand 17739 states and 24144 transitions. Second operand 8 states. [2019-09-08 05:15:12,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:15:12,846 INFO L93 Difference]: Finished difference Result 19168 states and 25899 transitions. [2019-09-08 05:15:12,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 05:15:12,847 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 324 [2019-09-08 05:15:12,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:15:12,901 INFO L225 Difference]: With dead ends: 19168 [2019-09-08 05:15:12,901 INFO L226 Difference]: Without dead ends: 19079 [2019-09-08 05:15:12,910 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-08 05:15:12,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19079 states. [2019-09-08 05:15:14,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19079 to 18430. [2019-09-08 05:15:14,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18430 states. [2019-09-08 05:15:14,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18430 states to 18430 states and 25025 transitions. [2019-09-08 05:15:14,722 INFO L78 Accepts]: Start accepts. Automaton has 18430 states and 25025 transitions. Word has length 324 [2019-09-08 05:15:14,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:15:14,723 INFO L475 AbstractCegarLoop]: Abstraction has 18430 states and 25025 transitions. [2019-09-08 05:15:14,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:15:14,723 INFO L276 IsEmpty]: Start isEmpty. Operand 18430 states and 25025 transitions. [2019-09-08 05:15:14,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-09-08 05:15:14,767 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:15:14,768 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:15:14,768 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:15:14,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:15:14,769 INFO L82 PathProgramCache]: Analyzing trace with hash 724214450, now seen corresponding path program 2 times [2019-09-08 05:15:14,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:15:14,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:15:14,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:15:14,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:15:14,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:15:14,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:15:14,975 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-09-08 05:15:14,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:15:14,975 INFO L223 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-09-08 05:15:14,986 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 05:15:15,338 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-09-08 05:15:15,339 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 05:15:15,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 1965 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 05:15:15,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:15:15,550 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-09-08 05:15:15,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:15:15,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2019-09-08 05:15:15,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:15:15,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:15:15,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:15:15,557 INFO L87 Difference]: Start difference. First operand 18430 states and 25025 transitions. Second operand 18 states. [2019-09-08 05:15:22,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:15:22,283 INFO L93 Difference]: Finished difference Result 33109 states and 44841 transitions. [2019-09-08 05:15:22,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-08 05:15:22,285 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 321 [2019-09-08 05:15:22,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:15:22,358 INFO L225 Difference]: With dead ends: 33109 [2019-09-08 05:15:22,359 INFO L226 Difference]: Without dead ends: 29301 [2019-09-08 05:15:22,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=268, Invalid=2924, Unknown=0, NotChecked=0, Total=3192 [2019-09-08 05:15:22,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29301 states. [2019-09-08 05:15:23,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29301 to 28674. [2019-09-08 05:15:23,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28674 states. [2019-09-08 05:15:23,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28674 states to 28674 states and 39314 transitions. [2019-09-08 05:15:23,600 INFO L78 Accepts]: Start accepts. Automaton has 28674 states and 39314 transitions. Word has length 321 [2019-09-08 05:15:23,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:15:23,600 INFO L475 AbstractCegarLoop]: Abstraction has 28674 states and 39314 transitions. [2019-09-08 05:15:23,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 05:15:23,601 INFO L276 IsEmpty]: Start isEmpty. Operand 28674 states and 39314 transitions. [2019-09-08 05:15:23,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-09-08 05:15:23,675 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:15:23,676 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:15:23,676 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:15:23,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:15:23,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1529796975, now seen corresponding path program 1 times [2019-09-08 05:15:23,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:15:23,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:15:23,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:15:23,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 05:15:23,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:15:23,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:15:23,843 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-09-08 05:15:23,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:15:23,843 INFO L223 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) [2019-09-08 05:15:23,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:15:24,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:15:24,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 3183 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:15:24,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:15:24,406 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-09-08 05:15:24,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:15:24,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-09-08 05:15:24,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 05:15:24,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 05:15:24,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-09-08 05:15:24,422 INFO L87 Difference]: Start difference. First operand 28674 states and 39314 transitions. Second operand 12 states. [2019-09-08 05:15:26,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:15:26,307 INFO L93 Difference]: Finished difference Result 53324 states and 71947 transitions. [2019-09-08 05:15:26,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 05:15:26,310 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 321 [2019-09-08 05:15:26,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:15:26,364 INFO L225 Difference]: With dead ends: 53324 [2019-09-08 05:15:26,364 INFO L226 Difference]: Without dead ends: 24742 [2019-09-08 05:15:26,412 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:15:26,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24742 states. [2019-09-08 05:15:28,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24742 to 24692. [2019-09-08 05:15:28,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24692 states. [2019-09-08 05:15:28,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24692 states to 24692 states and 32683 transitions. [2019-09-08 05:15:28,634 INFO L78 Accepts]: Start accepts. Automaton has 24692 states and 32683 transitions. Word has length 321 [2019-09-08 05:15:28,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:15:28,634 INFO L475 AbstractCegarLoop]: Abstraction has 24692 states and 32683 transitions. [2019-09-08 05:15:28,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 05:15:28,634 INFO L276 IsEmpty]: Start isEmpty. Operand 24692 states and 32683 transitions. [2019-09-08 05:15:28,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-08 05:15:28,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:15:28,669 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:15:28,669 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:15:28,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:15:28,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1819216923, now seen corresponding path program 1 times [2019-09-08 05:15:28,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:15:28,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:15:28,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:15:28,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:15:28,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:15:28,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:15:28,878 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-09-08 05:15:28,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:15:28,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:15:28,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:15:28,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:15:28,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:15:28,881 INFO L87 Difference]: Start difference. First operand 24692 states and 32683 transitions. Second operand 8 states. [2019-09-08 05:15:34,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:15:34,684 INFO L93 Difference]: Finished difference Result 65465 states and 84861 transitions. [2019-09-08 05:15:34,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 05:15:34,684 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 324 [2019-09-08 05:15:34,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:15:34,802 INFO L225 Difference]: With dead ends: 65465 [2019-09-08 05:15:34,802 INFO L226 Difference]: Without dead ends: 57516 [2019-09-08 05:15:34,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-08 05:15:34,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57516 states. [2019-09-08 05:15:36,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57516 to 49626. [2019-09-08 05:15:36,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49626 states. [2019-09-08 05:15:36,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49626 states to 49626 states and 66015 transitions. [2019-09-08 05:15:36,906 INFO L78 Accepts]: Start accepts. Automaton has 49626 states and 66015 transitions. Word has length 324 [2019-09-08 05:15:36,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:15:36,907 INFO L475 AbstractCegarLoop]: Abstraction has 49626 states and 66015 transitions. [2019-09-08 05:15:36,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:15:36,907 INFO L276 IsEmpty]: Start isEmpty. Operand 49626 states and 66015 transitions. [2019-09-08 05:15:36,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-09-08 05:15:36,988 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:15:36,988 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:15:36,989 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:15:36,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:15:36,989 INFO L82 PathProgramCache]: Analyzing trace with hash -194285411, now seen corresponding path program 1 times [2019-09-08 05:15:36,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:15:36,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:15:36,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:15:36,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:15:36,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:15:37,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:15:37,144 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-09-08 05:15:37,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:15:37,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:15:37,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:15:37,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:15:37,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:15:37,146 INFO L87 Difference]: Start difference. First operand 49626 states and 66015 transitions. Second operand 3 states. [2019-09-08 05:15:39,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:15:39,027 INFO L93 Difference]: Finished difference Result 106371 states and 144753 transitions. [2019-09-08 05:15:39,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:15:39,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 323 [2019-09-08 05:15:39,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:15:39,167 INFO L225 Difference]: With dead ends: 106371 [2019-09-08 05:15:39,167 INFO L226 Difference]: Without dead ends: 56850 [2019-09-08 05:15:39,237 INFO L628 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-09-08 05:15:39,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56850 states. [2019-09-08 05:15:41,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56850 to 56826. [2019-09-08 05:15:41,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56826 states. [2019-09-08 05:15:41,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56826 states to 56826 states and 78639 transitions. [2019-09-08 05:15:41,836 INFO L78 Accepts]: Start accepts. Automaton has 56826 states and 78639 transitions. Word has length 323 [2019-09-08 05:15:41,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:15:41,836 INFO L475 AbstractCegarLoop]: Abstraction has 56826 states and 78639 transitions. [2019-09-08 05:15:41,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:15:41,837 INFO L276 IsEmpty]: Start isEmpty. Operand 56826 states and 78639 transitions. [2019-09-08 05:15:41,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-08 05:15:41,939 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:15:41,939 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:15:41,940 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:15:41,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:15:41,940 INFO L82 PathProgramCache]: Analyzing trace with hash -218050876, now seen corresponding path program 1 times [2019-09-08 05:15:41,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:15:41,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:15:41,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:15:41,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:15:41,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:15:41,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:15:42,145 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-09-08 05:15:42,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:15:42,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 05:15:42,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 05:15:42,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 05:15:42,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 05:15:42,147 INFO L87 Difference]: Start difference. First operand 56826 states and 78639 transitions. Second operand 9 states. [2019-09-08 05:15:45,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:15:45,439 INFO L93 Difference]: Finished difference Result 81745 states and 108543 transitions. [2019-09-08 05:15:45,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 05:15:45,439 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 324 [2019-09-08 05:15:45,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:15:45,595 INFO L225 Difference]: With dead ends: 81745 [2019-09-08 05:15:45,596 INFO L226 Difference]: Without dead ends: 57636 [2019-09-08 05:15:45,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-08 05:15:45,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57636 states. [2019-09-08 05:15:47,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57636 to 57420. [2019-09-08 05:15:47,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57420 states. [2019-09-08 05:15:48,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57420 states to 57420 states and 79215 transitions. [2019-09-08 05:15:48,010 INFO L78 Accepts]: Start accepts. Automaton has 57420 states and 79215 transitions. Word has length 324 [2019-09-08 05:15:48,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:15:48,010 INFO L475 AbstractCegarLoop]: Abstraction has 57420 states and 79215 transitions. [2019-09-08 05:15:48,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 05:15:48,011 INFO L276 IsEmpty]: Start isEmpty. Operand 57420 states and 79215 transitions. [2019-09-08 05:15:48,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-08 05:15:48,121 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:15:48,121 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:15:48,121 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:15:48,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:15:48,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1541148583, now seen corresponding path program 1 times [2019-09-08 05:15:48,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:15:48,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:15:48,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:15:48,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:15:48,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:15:48,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:15:48,321 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-09-08 05:15:48,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:15:48,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 05:15:48,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 05:15:48,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 05:15:48,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 05:15:48,323 INFO L87 Difference]: Start difference. First operand 57420 states and 79215 transitions. Second operand 9 states. [2019-09-08 05:15:50,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:15:50,185 INFO L93 Difference]: Finished difference Result 82303 states and 109155 transitions. [2019-09-08 05:15:50,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 05:15:50,186 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 327 [2019-09-08 05:15:50,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:15:50,308 INFO L225 Difference]: With dead ends: 82303 [2019-09-08 05:15:50,308 INFO L226 Difference]: Without dead ends: 58068 [2019-09-08 05:15:50,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-08 05:15:50,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58068 states. [2019-09-08 05:15:52,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58068 to 57834. [2019-09-08 05:15:52,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57834 states. [2019-09-08 05:15:52,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57834 states to 57834 states and 79575 transitions. [2019-09-08 05:15:52,927 INFO L78 Accepts]: Start accepts. Automaton has 57834 states and 79575 transitions. Word has length 327 [2019-09-08 05:15:52,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:15:52,928 INFO L475 AbstractCegarLoop]: Abstraction has 57834 states and 79575 transitions. [2019-09-08 05:15:52,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 05:15:52,928 INFO L276 IsEmpty]: Start isEmpty. Operand 57834 states and 79575 transitions. [2019-09-08 05:15:53,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-08 05:15:53,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:15:53,033 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:15:53,033 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:15:53,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:15:53,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1135909162, now seen corresponding path program 3 times [2019-09-08 05:15:53,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:15:53,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:15:53,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:15:53,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:15:53,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:15:53,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:15:53,348 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-09-08 05:15:53,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:15:53,349 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:15:53,360 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 05:15:53,813 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-08 05:15:53,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 05:15:53,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 2733 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-08 05:15:53,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:15:54,131 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-08 05:15:54,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:15:54,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2019-09-08 05:15:54,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 05:15:54,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 05:15:54,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=866, Unknown=0, NotChecked=0, Total=930 [2019-09-08 05:15:54,143 INFO L87 Difference]: Start difference. First operand 57834 states and 79575 transitions. Second operand 31 states. [2019-09-08 05:15:58,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:15:58,799 INFO L93 Difference]: Finished difference Result 59828 states and 82289 transitions. [2019-09-08 05:15:58,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-08 05:15:58,800 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 320 [2019-09-08 05:15:58,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:15:58,923 INFO L225 Difference]: With dead ends: 59828 [2019-09-08 05:15:58,923 INFO L226 Difference]: Without dead ends: 59051 [2019-09-08 05:15:58,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=206, Invalid=2764, Unknown=0, NotChecked=0, Total=2970 [2019-09-08 05:15:58,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59051 states. [2019-09-08 05:16:01,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59051 to 51230. [2019-09-08 05:16:01,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51230 states. [2019-09-08 05:16:01,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51230 states to 51230 states and 71557 transitions. [2019-09-08 05:16:01,138 INFO L78 Accepts]: Start accepts. Automaton has 51230 states and 71557 transitions. Word has length 320 [2019-09-08 05:16:01,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:16:01,139 INFO L475 AbstractCegarLoop]: Abstraction has 51230 states and 71557 transitions. [2019-09-08 05:16:01,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 05:16:01,139 INFO L276 IsEmpty]: Start isEmpty. Operand 51230 states and 71557 transitions. [2019-09-08 05:16:01,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-08 05:16:01,238 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:16:01,239 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:16:01,239 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:16:01,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:16:01,239 INFO L82 PathProgramCache]: Analyzing trace with hash -282147011, now seen corresponding path program 1 times [2019-09-08 05:16:01,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:16:01,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:16:01,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:16:01,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 05:16:01,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:16:01,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:16:01,425 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-08 05:16:01,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:16:01,425 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:16:01,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:16:01,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:16:01,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 3190 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:16:01,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:16:02,078 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-08 05:16:02,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:16:02,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2019-09-08 05:16:02,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 05:16:02,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 05:16:02,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-09-08 05:16:02,096 INFO L87 Difference]: Start difference. First operand 51230 states and 71557 transitions. Second operand 15 states. [2019-09-08 05:16:14,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:16:14,861 INFO L93 Difference]: Finished difference Result 169263 states and 244675 transitions. [2019-09-08 05:16:14,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 05:16:14,861 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 328 [2019-09-08 05:16:14,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:16:15,347 INFO L225 Difference]: With dead ends: 169263 [2019-09-08 05:16:15,347 INFO L226 Difference]: Without dead ends: 118065 [2019-09-08 05:16:15,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=238, Invalid=1322, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 05:16:15,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118065 states. [2019-09-08 05:16:19,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118065 to 102199. [2019-09-08 05:16:19,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102199 states. [2019-09-08 05:16:20,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102199 states to 102199 states and 144714 transitions. [2019-09-08 05:16:20,203 INFO L78 Accepts]: Start accepts. Automaton has 102199 states and 144714 transitions. Word has length 328 [2019-09-08 05:16:20,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:16:20,203 INFO L475 AbstractCegarLoop]: Abstraction has 102199 states and 144714 transitions. [2019-09-08 05:16:20,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 05:16:20,204 INFO L276 IsEmpty]: Start isEmpty. Operand 102199 states and 144714 transitions. [2019-09-08 05:16:20,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-08 05:16:20,585 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:16:20,586 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:16:20,586 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:16:20,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:16:20,587 INFO L82 PathProgramCache]: Analyzing trace with hash 745667620, now seen corresponding path program 1 times [2019-09-08 05:16:20,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:16:20,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:16:20,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:16:20,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:16:20,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:16:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:16:22,999 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-09-08 05:16:22,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:16:23,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 05:16:23,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 05:16:23,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 05:16:23,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-09-08 05:16:23,001 INFO L87 Difference]: Start difference. First operand 102199 states and 144714 transitions. Second operand 22 states. [2019-09-08 05:16:27,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:16:27,064 INFO L93 Difference]: Finished difference Result 106799 states and 149997 transitions. [2019-09-08 05:16:27,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 05:16:27,065 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 327 [2019-09-08 05:16:27,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:16:27,321 INFO L225 Difference]: With dead ends: 106799 [2019-09-08 05:16:27,321 INFO L226 Difference]: Without dead ends: 105688 [2019-09-08 05:16:27,349 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=1362, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 05:16:27,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105688 states. [2019-09-08 05:16:33,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105688 to 103009. [2019-09-08 05:16:33,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103009 states. [2019-09-08 05:16:34,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103009 states to 103009 states and 145520 transitions. [2019-09-08 05:16:34,116 INFO L78 Accepts]: Start accepts. Automaton has 103009 states and 145520 transitions. Word has length 327 [2019-09-08 05:16:34,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:16:34,116 INFO L475 AbstractCegarLoop]: Abstraction has 103009 states and 145520 transitions. [2019-09-08 05:16:34,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 05:16:34,116 INFO L276 IsEmpty]: Start isEmpty. Operand 103009 states and 145520 transitions. [2019-09-08 05:16:34,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-09-08 05:16:34,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:16:34,391 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:16:34,391 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:16:34,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:16:34,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1570127652, now seen corresponding path program 1 times [2019-09-08 05:16:34,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:16:34,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:16:34,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:16:34,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:16:34,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:16:34,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:16:34,698 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-09-08 05:16:34,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:16:34,699 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:16:34,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:16:35,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:16:35,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 3186 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 05:16:35,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:16:35,285 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-08 05:16:35,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:16:35,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 4] total 20 [2019-09-08 05:16:35,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 05:16:35,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 05:16:35,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2019-09-08 05:16:35,294 INFO L87 Difference]: Start difference. First operand 103009 states and 145520 transitions. Second operand 20 states. [2019-09-08 05:16:41,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:16:41,011 INFO L93 Difference]: Finished difference Result 138316 states and 188866 transitions. [2019-09-08 05:16:41,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 05:16:41,012 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 329 [2019-09-08 05:16:41,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:16:41,273 INFO L225 Difference]: With dead ends: 138316 [2019-09-08 05:16:41,273 INFO L226 Difference]: Without dead ends: 105244 [2019-09-08 05:16:41,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=1284, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 05:16:41,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105244 states. [2019-09-08 05:16:45,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105244 to 102573. [2019-09-08 05:16:45,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102573 states. [2019-09-08 05:16:49,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102573 states to 102573 states and 145192 transitions. [2019-09-08 05:16:49,984 INFO L78 Accepts]: Start accepts. Automaton has 102573 states and 145192 transitions. Word has length 329 [2019-09-08 05:16:49,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:16:49,984 INFO L475 AbstractCegarLoop]: Abstraction has 102573 states and 145192 transitions. [2019-09-08 05:16:49,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 05:16:49,984 INFO L276 IsEmpty]: Start isEmpty. Operand 102573 states and 145192 transitions. [2019-09-08 05:16:50,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-09-08 05:16:50,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:16:50,228 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 05:16:50,228 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:16:50,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:16:50,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1075136265, now seen corresponding path program 1 times [2019-09-08 05:16:50,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:16:50,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:16:50,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:16:50,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:16:50,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:16:50,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:16:50,364 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-08 05:16:50,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:16:50,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:16:50,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:16:50,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:16:50,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:16:50,366 INFO L87 Difference]: Start difference. First operand 102573 states and 145192 transitions. Second operand 3 states. [2019-09-08 05:16:54,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:16:54,868 INFO L93 Difference]: Finished difference Result 232473 states and 340833 transitions. [2019-09-08 05:16:54,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:16:54,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 329 [2019-09-08 05:16:54,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:16:55,197 INFO L225 Difference]: With dead ends: 232473 [2019-09-08 05:16:55,197 INFO L226 Difference]: Without dead ends: 130281 [2019-09-08 05:16:55,324 INFO L628 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-09-08 05:16:55,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130281 states. [2019-09-08 05:17:04,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130281 to 130233. [2019-09-08 05:17:04,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130233 states. [2019-09-08 05:17:04,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130233 states to 130233 states and 195310 transitions. [2019-09-08 05:17:04,566 INFO L78 Accepts]: Start accepts. Automaton has 130233 states and 195310 transitions. Word has length 329 [2019-09-08 05:17:04,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:17:04,566 INFO L475 AbstractCegarLoop]: Abstraction has 130233 states and 195310 transitions. [2019-09-08 05:17:04,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:17:04,567 INFO L276 IsEmpty]: Start isEmpty. Operand 130233 states and 195310 transitions. [2019-09-08 05:17:05,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-09-08 05:17:05,146 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:17:05,146 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 05:17:05,146 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:17:05,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:17:05,147 INFO L82 PathProgramCache]: Analyzing trace with hash 2017557641, now seen corresponding path program 1 times [2019-09-08 05:17:05,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:17:05,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:17:05,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:17:05,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:17:05,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:17:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:17:05,286 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-09-08 05:17:05,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:17:05,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:17:05,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:17:05,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:17:05,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:17:05,288 INFO L87 Difference]: Start difference. First operand 130233 states and 195310 transitions. Second operand 3 states. [2019-09-08 05:17:17,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:17:17,308 INFO L93 Difference]: Finished difference Result 313101 states and 487293 transitions. [2019-09-08 05:17:17,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:17:17,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 329 [2019-09-08 05:17:17,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:17:17,914 INFO L225 Difference]: With dead ends: 313101 [2019-09-08 05:17:17,914 INFO L226 Difference]: Without dead ends: 183285 [2019-09-08 05:17:18,111 INFO L628 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-09-08 05:17:18,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183285 states. [2019-09-08 05:17:27,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183285 to 183237. [2019-09-08 05:17:27,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183237 states. [2019-09-08 05:17:28,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183237 states to 183237 states and 290932 transitions. [2019-09-08 05:17:28,168 INFO L78 Accepts]: Start accepts. Automaton has 183237 states and 290932 transitions. Word has length 329 [2019-09-08 05:17:28,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:17:28,168 INFO L475 AbstractCegarLoop]: Abstraction has 183237 states and 290932 transitions. [2019-09-08 05:17:28,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:17:28,168 INFO L276 IsEmpty]: Start isEmpty. Operand 183237 states and 290932 transitions. [2019-09-08 05:17:28,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2019-09-08 05:17:28,896 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:17:28,896 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:17:28,896 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:17:28,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:17:28,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1075627486, now seen corresponding path program 1 times [2019-09-08 05:17:28,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:17:28,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:17:28,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:17:28,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:17:28,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:17:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:17:29,040 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-09-08 05:17:29,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:17:29,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:17:29,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:17:29,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:17:29,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:17:29,042 INFO L87 Difference]: Start difference. First operand 183237 states and 290932 transitions. Second operand 6 states. [2019-09-08 05:17:37,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:17:37,555 INFO L93 Difference]: Finished difference Result 252717 states and 396053 transitions. [2019-09-08 05:17:37,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:17:37,555 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 346 [2019-09-08 05:17:37,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:17:37,716 INFO L225 Difference]: With dead ends: 252717 [2019-09-08 05:17:37,716 INFO L226 Difference]: Without dead ends: 70029 [2019-09-08 05:17:37,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:17:38,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70029 states. [2019-09-08 05:17:41,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70029 to 69375. [2019-09-08 05:17:41,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69375 states. [2019-09-08 05:17:41,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69375 states to 69375 states and 104324 transitions. [2019-09-08 05:17:41,698 INFO L78 Accepts]: Start accepts. Automaton has 69375 states and 104324 transitions. Word has length 346 [2019-09-08 05:17:41,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:17:41,698 INFO L475 AbstractCegarLoop]: Abstraction has 69375 states and 104324 transitions. [2019-09-08 05:17:41,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:17:41,699 INFO L276 IsEmpty]: Start isEmpty. Operand 69375 states and 104324 transitions. [2019-09-08 05:17:41,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-09-08 05:17:41,900 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:17:41,900 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 05:17:41,901 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:17:41,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:17:41,901 INFO L82 PathProgramCache]: Analyzing trace with hash -2088845001, now seen corresponding path program 1 times [2019-09-08 05:17:41,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:17:41,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:17:41,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:17:41,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:17:41,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:17:41,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:17:42,048 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-08 05:17:42,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:17:42,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:17:42,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:17:42,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:17:42,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:17:42,050 INFO L87 Difference]: Start difference. First operand 69375 states and 104324 transitions. Second operand 3 states. [2019-09-08 05:17:48,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:17:48,424 INFO L93 Difference]: Finished difference Result 169725 states and 262359 transitions. [2019-09-08 05:17:48,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:17:48,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 331 [2019-09-08 05:17:48,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:17:48,651 INFO L225 Difference]: With dead ends: 169725 [2019-09-08 05:17:48,651 INFO L226 Difference]: Without dead ends: 100803 [2019-09-08 05:17:48,745 INFO L628 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-09-08 05:17:48,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100803 states. [2019-09-08 05:17:53,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100803 to 100779. [2019-09-08 05:17:53,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100779 states. [2019-09-08 05:17:54,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100779 states to 100779 states and 157642 transitions. [2019-09-08 05:17:54,096 INFO L78 Accepts]: Start accepts. Automaton has 100779 states and 157642 transitions. Word has length 331 [2019-09-08 05:17:54,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:17:54,097 INFO L475 AbstractCegarLoop]: Abstraction has 100779 states and 157642 transitions. [2019-09-08 05:17:54,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:17:54,097 INFO L276 IsEmpty]: Start isEmpty. Operand 100779 states and 157642 transitions. [2019-09-08 05:17:55,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-09-08 05:17:55,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:17:55,035 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 05:17:55,035 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:17:55,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:17:55,036 INFO L82 PathProgramCache]: Analyzing trace with hash 461749513, now seen corresponding path program 1 times [2019-09-08 05:17:55,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:17:55,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:17:55,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:17:55,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:17:55,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:17:55,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:17:55,203 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-09-08 05:17:55,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:17:55,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:17:55,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:17:55,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:17:55,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:17:55,205 INFO L87 Difference]: Start difference. First operand 100779 states and 157642 transitions. Second operand 3 states. [2019-09-08 05:18:06,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:18:06,570 INFO L93 Difference]: Finished difference Result 264861 states and 424837 transitions. [2019-09-08 05:18:06,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:18:06,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 331 [2019-09-08 05:18:06,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:18:07,019 INFO L225 Difference]: With dead ends: 264861 [2019-09-08 05:18:07,019 INFO L226 Difference]: Without dead ends: 164559 [2019-09-08 05:18:07,200 INFO L628 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-09-08 05:18:07,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164559 states. [2019-09-08 05:18:16,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164559 to 164535. [2019-09-08 05:18:16,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164535 states. [2019-09-08 05:18:17,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164535 states to 164535 states and 265872 transitions. [2019-09-08 05:18:17,376 INFO L78 Accepts]: Start accepts. Automaton has 164535 states and 265872 transitions. Word has length 331 [2019-09-08 05:18:17,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:18:17,376 INFO L475 AbstractCegarLoop]: Abstraction has 164535 states and 265872 transitions. [2019-09-08 05:18:17,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:18:17,376 INFO L276 IsEmpty]: Start isEmpty. Operand 164535 states and 265872 transitions. [2019-09-08 05:18:18,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2019-09-08 05:18:18,132 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:18:18,132 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 05:18:18,133 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:18:18,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:18:18,133 INFO L82 PathProgramCache]: Analyzing trace with hash -909582957, now seen corresponding path program 1 times [2019-09-08 05:18:18,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:18:18,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:18:18,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:18:18,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:18:18,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:18:18,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:18:18,441 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2019-09-08 05:18:18,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:18:18,441 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:18:18,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:18:18,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:18:18,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 3259 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:18:18,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:18:22,867 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-08 05:18:22,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:18:22,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [18] total 23 [2019-09-08 05:18:22,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 05:18:22,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 05:18:22,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2019-09-08 05:18:22,876 INFO L87 Difference]: Start difference. First operand 164535 states and 265872 transitions. Second operand 23 states. [2019-09-08 05:18:31,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:18:31,669 INFO L93 Difference]: Finished difference Result 220512 states and 354246 transitions. [2019-09-08 05:18:31,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 05:18:31,669 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 347 [2019-09-08 05:18:31,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:18:31,955 INFO L225 Difference]: With dead ends: 220512 [2019-09-08 05:18:31,955 INFO L226 Difference]: Without dead ends: 110737 [2019-09-08 05:18:32,111 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=205, Invalid=2051, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 05:18:32,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110737 states. [2019-09-08 05:18:39,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110737 to 110666. [2019-09-08 05:18:39,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110666 states. [2019-09-08 05:18:39,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110666 states to 110666 states and 177941 transitions. [2019-09-08 05:18:39,620 INFO L78 Accepts]: Start accepts. Automaton has 110666 states and 177941 transitions. Word has length 347 [2019-09-08 05:18:39,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:18:39,621 INFO L475 AbstractCegarLoop]: Abstraction has 110666 states and 177941 transitions. [2019-09-08 05:18:39,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 05:18:39,621 INFO L276 IsEmpty]: Start isEmpty. Operand 110666 states and 177941 transitions. [2019-09-08 05:18:40,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-09-08 05:18:40,089 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:18:40,090 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:18:40,090 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:18:40,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:18:40,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1089916328, now seen corresponding path program 1 times [2019-09-08 05:18:40,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:18:40,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:18:40,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:18:40,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:18:40,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:18:40,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:18:40,244 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-09-08 05:18:40,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:18:40,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:18:40,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:18:40,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:18:40,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:18:40,247 INFO L87 Difference]: Start difference. First operand 110666 states and 177941 transitions. Second operand 3 states. [2019-09-08 05:18:54,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:18:54,153 INFO L93 Difference]: Finished difference Result 299573 states and 490331 transitions. [2019-09-08 05:18:54,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:18:54,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 340 [2019-09-08 05:18:54,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:18:54,797 INFO L225 Difference]: With dead ends: 299573 [2019-09-08 05:18:54,797 INFO L226 Difference]: Without dead ends: 189282 [2019-09-08 05:18:55,009 INFO L628 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-09-08 05:18:55,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189282 states. [2019-09-08 05:19:06,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189282 to 189266. [2019-09-08 05:19:06,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189266 states. [2019-09-08 05:19:07,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189266 states to 189266 states and 310297 transitions. [2019-09-08 05:19:07,428 INFO L78 Accepts]: Start accepts. Automaton has 189266 states and 310297 transitions. Word has length 340 [2019-09-08 05:19:07,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:19:07,429 INFO L475 AbstractCegarLoop]: Abstraction has 189266 states and 310297 transitions. [2019-09-08 05:19:07,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:19:07,429 INFO L276 IsEmpty]: Start isEmpty. Operand 189266 states and 310297 transitions. [2019-09-08 05:19:08,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2019-09-08 05:19:08,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:19:08,264 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:19:08,264 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:19:08,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:19:08,264 INFO L82 PathProgramCache]: Analyzing trace with hash 462688807, now seen corresponding path program 1 times [2019-09-08 05:19:08,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:19:08,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:19:08,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:19:08,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:19:08,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:19:08,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:19:08,411 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-09-08 05:19:08,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:19:08,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:19:08,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:19:08,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:19:08,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:19:08,413 INFO L87 Difference]: Start difference. First operand 189266 states and 310297 transitions. Second operand 3 states. [2019-09-08 05:19:31,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:19:31,115 INFO L93 Difference]: Finished difference Result 527661 states and 866877 transitions. [2019-09-08 05:19:31,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:19:31,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 341 [2019-09-08 05:19:31,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:19:32,299 INFO L225 Difference]: With dead ends: 527661 [2019-09-08 05:19:32,299 INFO L226 Difference]: Without dead ends: 338794 [2019-09-08 05:19:32,666 INFO L628 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-09-08 05:19:32,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338794 states. [2019-09-08 05:20:10,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338794 to 338778. [2019-09-08 05:20:10,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338778 states. [2019-09-08 05:20:11,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338778 states to 338778 states and 551965 transitions. [2019-09-08 05:20:11,244 INFO L78 Accepts]: Start accepts. Automaton has 338778 states and 551965 transitions. Word has length 341 [2019-09-08 05:20:11,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:20:11,244 INFO L475 AbstractCegarLoop]: Abstraction has 338778 states and 551965 transitions. [2019-09-08 05:20:11,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:20:11,244 INFO L276 IsEmpty]: Start isEmpty. Operand 338778 states and 551965 transitions. [2019-09-08 05:20:14,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-09-08 05:20:14,649 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:20:14,649 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:20:14,649 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:20:14,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:20:14,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1268271998, now seen corresponding path program 1 times [2019-09-08 05:20:14,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:20:14,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:20:14,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:14,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:20:14,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:14,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:20:14,853 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-08 05:20:14,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:20:14,853 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:20:14,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:20:15,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:20:15,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 3277 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:20:15,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:20:15,481 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 05:20:15,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:20:15,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 17 [2019-09-08 05:20:15,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 05:20:15,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 05:20:15,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-09-08 05:20:15,491 INFO L87 Difference]: Start difference. First operand 338778 states and 551965 transitions. Second operand 17 states. [2019-09-08 05:20:34,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:20:34,388 INFO L93 Difference]: Finished difference Result 508477 states and 824796 transitions. [2019-09-08 05:20:34,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 05:20:34,388 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 357 [2019-09-08 05:20:34,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:20:34,872 INFO L225 Difference]: With dead ends: 508477 [2019-09-08 05:20:34,872 INFO L226 Difference]: Without dead ends: 169946 [2019-09-08 05:20:35,266 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=1180, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 05:20:35,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169946 states. [2019-09-08 05:20:53,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169946 to 169695. [2019-09-08 05:20:53,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169695 states. [2019-09-08 05:20:53,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169695 states to 169695 states and 272488 transitions. [2019-09-08 05:20:53,922 INFO L78 Accepts]: Start accepts. Automaton has 169695 states and 272488 transitions. Word has length 357 [2019-09-08 05:20:53,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:20:53,923 INFO L475 AbstractCegarLoop]: Abstraction has 169695 states and 272488 transitions. [2019-09-08 05:20:53,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 05:20:53,923 INFO L276 IsEmpty]: Start isEmpty. Operand 169695 states and 272488 transitions. [2019-09-08 05:20:54,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2019-09-08 05:20:54,542 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:20:54,542 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:20:54,543 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:20:54,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:20:54,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1152652155, now seen corresponding path program 1 times [2019-09-08 05:20:54,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:20:54,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:20:54,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:54,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:20:54,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:54,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:20:54,715 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 41 proven. 2 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-09-08 05:20:54,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:20:54,716 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:20:54,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:20:55,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:20:55,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 3262 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 05:20:55,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:20:55,760 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (13)] Exception during sending of exit command (exit): Stream closed [2019-09-08 05:20:55,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:20:55,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2019-09-08 05:20:55,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 05:20:55,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 05:20:55,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-09-08 05:20:55,780 INFO L87 Difference]: Start difference. First operand 169695 states and 272488 transitions. Second operand 12 states. [2019-09-08 05:21:15,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:21:15,649 INFO L93 Difference]: Finished difference Result 339975 states and 545621 transitions. [2019-09-08 05:21:15,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 05:21:15,649 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 351 [2019-09-08 05:21:15,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:21:16,278 INFO L225 Difference]: With dead ends: 339975 [2019-09-08 05:21:16,279 INFO L226 Difference]: Without dead ends: 254747 [2019-09-08 05:21:16,434 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 356 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=145, Invalid=725, Unknown=0, NotChecked=0, Total=870 [2019-09-08 05:21:16,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254747 states. [2019-09-08 05:21:39,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254747 to 254098. [2019-09-08 05:21:39,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254098 states. [2019-09-08 05:21:40,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254098 states to 254098 states and 404370 transitions. [2019-09-08 05:21:40,597 INFO L78 Accepts]: Start accepts. Automaton has 254098 states and 404370 transitions. Word has length 351 [2019-09-08 05:21:40,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:21:40,598 INFO L475 AbstractCegarLoop]: Abstraction has 254098 states and 404370 transitions. [2019-09-08 05:21:40,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 05:21:40,598 INFO L276 IsEmpty]: Start isEmpty. Operand 254098 states and 404370 transitions. [2019-09-08 05:21:41,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-09-08 05:21:41,661 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:21:41,661 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:21:41,661 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:21:41,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:21:41,662 INFO L82 PathProgramCache]: Analyzing trace with hash 17858747, now seen corresponding path program 1 times [2019-09-08 05:21:41,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:21:41,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:21:41,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:21:41,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:21:41,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:21:41,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:21:41,967 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-09-08 05:21:41,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:21:41,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 05:21:41,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:21:41,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:21:41,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:21:41,968 INFO L87 Difference]: Start difference. First operand 254098 states and 404370 transitions. Second operand 18 states. [2019-09-08 05:22:03,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:22:03,960 INFO L93 Difference]: Finished difference Result 254435 states and 404744 transitions. [2019-09-08 05:22:03,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 05:22:03,960 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 350 [2019-09-08 05:22:03,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:22:04,560 INFO L225 Difference]: With dead ends: 254435 [2019-09-08 05:22:04,560 INFO L226 Difference]: Without dead ends: 254223 [2019-09-08 05:22:04,613 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=954, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 05:22:04,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254223 states. [2019-09-08 05:22:21,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254223 to 254098. [2019-09-08 05:22:21,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254098 states. [2019-09-08 05:22:22,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254098 states to 254098 states and 404363 transitions. [2019-09-08 05:22:22,226 INFO L78 Accepts]: Start accepts. Automaton has 254098 states and 404363 transitions. Word has length 350 [2019-09-08 05:22:22,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:22:22,226 INFO L475 AbstractCegarLoop]: Abstraction has 254098 states and 404363 transitions. [2019-09-08 05:22:22,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 05:22:22,226 INFO L276 IsEmpty]: Start isEmpty. Operand 254098 states and 404363 transitions. [2019-09-08 05:22:23,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2019-09-08 05:22:23,184 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:22:23,184 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:22:23,184 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:22:23,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:22:23,184 INFO L82 PathProgramCache]: Analyzing trace with hash -393418944, now seen corresponding path program 1 times [2019-09-08 05:22:23,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:22:23,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:22:23,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:23,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:22:23,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:23,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:22:24,103 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-09-08 05:22:24,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:22:24,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 05:22:24,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 05:22:24,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 05:22:24,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-09-08 05:22:24,105 INFO L87 Difference]: Start difference. First operand 254098 states and 404363 transitions. Second operand 22 states. [2019-09-08 05:22:42,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:22:42,151 INFO L93 Difference]: Finished difference Result 254136 states and 404401 transitions. [2019-09-08 05:22:42,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 05:22:42,152 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 351 [2019-09-08 05:22:42,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:22:42,785 INFO L225 Difference]: With dead ends: 254136 [2019-09-08 05:22:42,786 INFO L226 Difference]: Without dead ends: 254117 [2019-09-08 05:22:42,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=1510, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 05:22:43,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254117 states. [2019-09-08 05:23:01,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254117 to 254092. [2019-09-08 05:23:01,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254092 states. [2019-09-08 05:23:01,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254092 states to 254092 states and 404351 transitions. [2019-09-08 05:23:01,847 INFO L78 Accepts]: Start accepts. Automaton has 254092 states and 404351 transitions. Word has length 351 [2019-09-08 05:23:01,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:23:01,848 INFO L475 AbstractCegarLoop]: Abstraction has 254092 states and 404351 transitions. [2019-09-08 05:23:01,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 05:23:01,848 INFO L276 IsEmpty]: Start isEmpty. Operand 254092 states and 404351 transitions. [2019-09-08 05:23:02,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-09-08 05:23:02,877 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:23:02,877 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:23:02,877 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:23:02,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:23:02,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1593688822, now seen corresponding path program 1 times [2019-09-08 05:23:02,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:23:02,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:23:02,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:23:02,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:23:02,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:23:02,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:23:08,842 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-09-08 05:23:08,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:23:08,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:23:08,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:23:08,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:23:08,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:23:08,845 INFO L87 Difference]: Start difference. First operand 254092 states and 404351 transitions. Second operand 8 states. [2019-09-08 05:23:21,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:23:21,627 INFO L93 Difference]: Finished difference Result 254119 states and 404377 transitions. [2019-09-08 05:23:21,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 05:23:21,627 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 352 [2019-09-08 05:23:21,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:23:22,339 INFO L225 Difference]: With dead ends: 254119 [2019-09-08 05:23:22,339 INFO L226 Difference]: Without dead ends: 254110 [2019-09-08 05:23:22,408 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-08 05:23:22,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254110 states. [2019-09-08 05:23:40,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254110 to 254101. [2019-09-08 05:23:40,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254101 states. [2019-09-08 05:23:41,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254101 states to 254101 states and 404359 transitions. [2019-09-08 05:23:41,075 INFO L78 Accepts]: Start accepts. Automaton has 254101 states and 404359 transitions. Word has length 352 [2019-09-08 05:23:41,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:23:41,076 INFO L475 AbstractCegarLoop]: Abstraction has 254101 states and 404359 transitions. [2019-09-08 05:23:41,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:23:41,076 INFO L276 IsEmpty]: Start isEmpty. Operand 254101 states and 404359 transitions. [2019-09-08 05:23:49,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-09-08 05:23:49,089 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:23:49,090 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:23:49,090 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:23:49,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:23:49,090 INFO L82 PathProgramCache]: Analyzing trace with hash -706185141, now seen corresponding path program 1 times [2019-09-08 05:23:49,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:23:49,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:23:49,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:23:49,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:23:49,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:23:49,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:23:49,499 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-09-08 05:23:49,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:23:49,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 05:23:49,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 05:23:49,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 05:23:49,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-09-08 05:23:49,501 INFO L87 Difference]: Start difference. First operand 254101 states and 404359 transitions. Second operand 22 states. [2019-09-08 05:24:03,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:24:03,049 INFO L93 Difference]: Finished difference Result 254124 states and 404380 transitions. [2019-09-08 05:24:03,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 05:24:03,050 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 352 [2019-09-08 05:24:03,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:24:03,685 INFO L225 Difference]: With dead ends: 254124 [2019-09-08 05:24:03,685 INFO L226 Difference]: Without dead ends: 253987 [2019-09-08 05:24:03,747 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=1362, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 05:24:04,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253987 states. [2019-09-08 05:24:27,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253987 to 253967. [2019-09-08 05:24:27,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253967 states. [2019-09-08 05:24:28,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253967 states to 253967 states and 404202 transitions. [2019-09-08 05:24:28,529 INFO L78 Accepts]: Start accepts. Automaton has 253967 states and 404202 transitions. Word has length 352 [2019-09-08 05:24:28,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:24:28,530 INFO L475 AbstractCegarLoop]: Abstraction has 253967 states and 404202 transitions. [2019-09-08 05:24:28,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 05:24:28,530 INFO L276 IsEmpty]: Start isEmpty. Operand 253967 states and 404202 transitions. [2019-09-08 05:24:30,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2019-09-08 05:24:30,090 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:24:30,090 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:24:30,090 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:24:30,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:24:30,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1076295472, now seen corresponding path program 1 times [2019-09-08 05:24:30,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:24:30,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:24:30,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:24:30,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:24:30,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:24:30,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:24:30,294 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-09-08 05:24:30,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:24:30,294 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:24:30,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:24:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:24:30,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 3297 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 05:24:30,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:24:30,895 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-09-08 05:24:30,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:24:30,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2019-09-08 05:24:30,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 05:24:30,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 05:24:30,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2019-09-08 05:24:30,913 INFO L87 Difference]: Start difference. First operand 253967 states and 404202 transitions. Second operand 15 states. [2019-09-08 05:24:43,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:24:43,822 INFO L93 Difference]: Finished difference Result 271577 states and 426299 transitions. [2019-09-08 05:24:43,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 05:24:43,822 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 353 [2019-09-08 05:24:43,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:24:45,035 INFO L225 Difference]: With dead ends: 271577 [2019-09-08 05:24:45,035 INFO L226 Difference]: Without dead ends: 250703 [2019-09-08 05:24:45,103 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2019-09-08 05:24:45,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250703 states.