java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/email_spec8_product20.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 05:41:45,599 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 05:41:45,602 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 05:41:45,620 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 05:41:45,620 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 05:41:45,622 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 05:41:45,624 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 05:41:45,633 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 05:41:45,637 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 05:41:45,640 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 05:41:45,642 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 05:41:45,644 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 05:41:45,644 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 05:41:45,646 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 05:41:45,648 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 05:41:45,649 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 05:41:45,650 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 05:41:45,652 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 05:41:45,653 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 05:41:45,658 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 05:41:45,662 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 05:41:45,664 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 05:41:45,666 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 05:41:45,667 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 05:41:45,670 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 05:41:45,670 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 05:41:45,670 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 05:41:45,672 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 05:41:45,673 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 05:41:45,674 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 05:41:45,674 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 05:41:45,675 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 05:41:45,676 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 05:41:45,676 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 05:41:45,678 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 05:41:45,679 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 05:41:45,679 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 05:41:45,679 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 05:41:45,680 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 05:41:45,681 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 05:41:45,682 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 05:41:45,684 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:41:45,719 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 05:41:45,720 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 05:41:45,724 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 05:41:45,724 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 05:41:45,725 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 05:41:45,725 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 05:41:45,727 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 05:41:45,727 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 05:41:45,727 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 05:41:45,728 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 05:41:45,728 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 05:41:45,728 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 05:41:45,728 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 05:41:45,728 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 05:41:45,729 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 05:41:45,729 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 05:41:45,729 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 05:41:45,729 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 05:41:45,730 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 05:41:45,730 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 05:41:45,730 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 05:41:45,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 05:41:45,731 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 05:41:45,732 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 05:41:45,732 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 05:41:45,732 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 05:41:45,733 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 05:41:45,733 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 05:41:45,733 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 05:41:45,777 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 05:41:45,787 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 05:41:45,790 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 05:41:45,792 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 05:41:45,792 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 05:41:45,793 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec8_product20.cil.c [2019-09-08 05:41:45,855 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c81258d7c/4201157dfb124c95bc0cef85e39e7e7d/FLAG5e46c8aed [2019-09-08 05:41:46,486 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 05:41:46,487 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec8_product20.cil.c [2019-09-08 05:41:46,518 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c81258d7c/4201157dfb124c95bc0cef85e39e7e7d/FLAG5e46c8aed [2019-09-08 05:41:46,737 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c81258d7c/4201157dfb124c95bc0cef85e39e7e7d [2019-09-08 05:41:46,746 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 05:41:46,748 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 05:41:46,749 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 05:41:46,749 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 05:41:46,752 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 05:41:46,753 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:41:46" (1/1) ... [2019-09-08 05:41:46,756 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17b28ca0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:41:46, skipping insertion in model container [2019-09-08 05:41:46,756 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:41:46" (1/1) ... [2019-09-08 05:41:46,764 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 05:41:46,834 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 05:41:47,531 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:41:47,551 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 05:41:47,661 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:41:47,763 INFO L192 MainTranslator]: Completed translation [2019-09-08 05:41:47,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:41:47 WrapperNode [2019-09-08 05:41:47,764 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 05:41:47,765 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 05:41:47,765 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 05:41:47,766 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 05:41:47,779 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:41:47" (1/1) ... [2019-09-08 05:41:47,780 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:41:47" (1/1) ... [2019-09-08 05:41:47,810 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:41:47" (1/1) ... [2019-09-08 05:41:47,811 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:41:47" (1/1) ... [2019-09-08 05:41:47,862 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:41:47" (1/1) ... [2019-09-08 05:41:47,901 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:41:47" (1/1) ... [2019-09-08 05:41:47,920 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:41:47" (1/1) ... [2019-09-08 05:41:47,950 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 05:41:47,950 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 05:41:47,950 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 05:41:47,951 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 05:41:47,952 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:41:47" (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:41:48,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 05:41:48,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 05:41:48,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 05:41:48,020 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 05:41:48,020 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 05:41:48,020 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 05:41:48,020 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 05:41:48,021 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 05:41:48,021 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 05:41:48,021 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-08 05:41:48,021 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-08 05:41:48,022 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-08 05:41:48,022 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-08 05:41:48,022 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-08 05:41:48,022 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-08 05:41:48,023 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-08 05:41:48,023 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-08 05:41:48,023 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-08 05:41:48,023 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-08 05:41:48,024 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-08 05:41:48,024 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-08 05:41:48,025 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-08 05:41:48,025 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-08 05:41:48,025 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-08 05:41:48,025 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-08 05:41:48,025 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-08 05:41:48,026 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-08 05:41:48,026 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-08 05:41:48,026 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-08 05:41:48,026 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-08 05:41:48,026 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-08 05:41:48,027 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 05:41:48,027 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-08 05:41:48,027 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-08 05:41:48,027 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-08 05:41:48,027 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-08 05:41:48,027 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-08 05:41:48,028 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-08 05:41:48,028 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-08 05:41:48,028 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-08 05:41:48,028 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-08 05:41:48,028 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-08 05:41:48,028 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-08 05:41:48,029 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-08 05:41:48,029 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-08 05:41:48,029 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-08 05:41:48,029 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-08 05:41:48,029 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-08 05:41:48,029 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-08 05:41:48,029 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-08 05:41:48,030 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-08 05:41:48,030 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-08 05:41:48,030 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-08 05:41:48,030 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-08 05:41:48,030 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-08 05:41:48,031 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-08 05:41:48,031 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-08 05:41:48,031 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-08 05:41:48,031 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-08 05:41:48,031 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-08 05:41:48,032 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-08 05:41:48,032 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptAutoResponder_spec__1 [2019-09-08 05:41:48,032 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptAutoResponder_spec__2 [2019-09-08 05:41:48,032 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 05:41:48,032 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-08 05:41:48,033 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-08 05:41:48,033 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-08 05:41:48,033 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-08 05:41:48,033 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-08 05:41:48,033 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-08 05:41:48,034 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-08 05:41:48,034 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-08 05:41:48,034 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-08 05:41:48,034 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-08 05:41:48,034 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-08 05:41:48,034 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-08 05:41:48,035 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-08 05:41:48,035 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-08 05:41:48,035 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 05:41:48,035 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 05:41:48,035 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-08 05:41:48,035 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-08 05:41:48,036 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-08 05:41:48,036 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-08 05:41:48,036 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-08 05:41:48,036 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-08 05:41:48,036 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-08 05:41:48,036 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-08 05:41:48,037 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-08 05:41:48,037 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-09-08 05:41:48,037 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-09-08 05:41:48,037 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-08 05:41:48,037 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-08 05:41:48,037 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-09-08 05:41:48,037 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-08 05:41:48,038 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-08 05:41:48,038 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-09-08 05:41:48,038 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AddressBook [2019-09-08 05:41:48,038 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-08 05:41:48,038 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-08 05:41:48,038 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-08 05:41:48,039 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-08 05:41:48,039 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-08 05:41:48,039 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-08 05:41:48,039 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-08 05:41:48,039 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-08 05:41:48,039 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-08 05:41:48,040 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-09-08 05:41:48,040 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-09-08 05:41:48,040 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 05:41:48,040 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 05:41:48,040 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 05:41:48,040 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 05:41:48,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 05:41:48,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 05:41:48,041 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 05:41:48,041 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 05:41:48,041 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 05:41:48,041 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 05:41:48,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 05:41:48,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 05:41:48,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 05:41:48,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 05:41:48,042 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 05:41:48,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 05:41:48,042 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 05:41:48,042 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 05:41:48,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 05:41:48,043 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 05:41:48,043 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 05:41:48,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 05:41:48,043 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 05:41:48,043 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 05:41:48,044 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-08 05:41:48,044 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-08 05:41:48,044 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-08 05:41:48,044 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-08 05:41:48,044 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-08 05:41:48,044 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-08 05:41:48,044 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-08 05:41:48,045 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-08 05:41:48,045 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-08 05:41:48,045 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-08 05:41:48,045 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-08 05:41:48,045 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-08 05:41:48,045 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-08 05:41:48,046 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-08 05:41:48,046 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-08 05:41:48,046 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-08 05:41:48,046 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-08 05:41:48,047 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-08 05:41:48,047 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-08 05:41:48,047 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-08 05:41:48,048 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-08 05:41:48,048 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-08 05:41:48,048 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 05:41:48,048 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-08 05:41:48,048 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-08 05:41:48,048 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-08 05:41:48,048 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-08 05:41:48,049 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-08 05:41:48,049 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-08 05:41:48,049 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-08 05:41:48,049 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-08 05:41:48,049 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-08 05:41:48,049 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-08 05:41:48,049 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-08 05:41:48,050 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-08 05:41:48,050 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-08 05:41:48,050 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-08 05:41:48,050 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-08 05:41:48,050 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-08 05:41:48,050 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-08 05:41:48,050 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-08 05:41:48,050 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-08 05:41:48,051 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-08 05:41:48,051 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-08 05:41:48,051 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-08 05:41:48,051 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-08 05:41:48,051 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-08 05:41:48,051 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-08 05:41:48,051 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-08 05:41:48,052 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-08 05:41:48,052 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-08 05:41:48,052 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-08 05:41:48,052 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-08 05:41:48,052 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptAutoResponder_spec__1 [2019-09-08 05:41:48,052 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptAutoResponder_spec__2 [2019-09-08 05:41:48,052 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-08 05:41:48,053 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-09-08 05:41:48,053 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-08 05:41:48,053 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-08 05:41:48,053 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-08 05:41:48,053 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-08 05:41:48,053 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-09-08 05:41:48,053 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-08 05:41:48,053 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-08 05:41:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-08 05:41:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 05:41:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-08 05:41:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-08 05:41:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-08 05:41:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-08 05:41:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-08 05:41:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-08 05:41:48,055 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 05:41:48,055 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 05:41:48,055 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 05:41:48,055 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-08 05:41:48,057 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-08 05:41:48,057 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-08 05:41:48,057 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-08 05:41:48,058 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-08 05:41:48,058 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-08 05:41:48,058 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-08 05:41:48,058 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-08 05:41:48,058 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-08 05:41:48,058 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-08 05:41:48,059 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 05:41:48,059 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 05:41:48,059 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-08 05:41:48,059 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-08 05:41:48,059 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-08 05:41:48,060 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-08 05:41:48,060 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-08 05:41:48,060 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-08 05:41:48,060 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-08 05:41:48,060 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-08 05:41:48,061 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-08 05:41:48,061 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-08 05:41:48,061 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-08 05:41:48,061 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-09-08 05:41:48,061 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-09-08 05:41:48,061 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-08 05:41:48,062 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-09-08 05:41:48,062 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-09-08 05:41:48,062 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AddressBook [2019-09-08 05:41:48,062 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 05:41:48,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 05:41:48,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 05:41:48,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 05:41:50,334 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 05:41:50,334 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 05:41:50,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:41:50 BoogieIcfgContainer [2019-09-08 05:41:50,336 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 05:41:50,337 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 05:41:50,337 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 05:41:50,340 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 05:41:50,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 05:41:46" (1/3) ... [2019-09-08 05:41:50,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b30f13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:41:50, skipping insertion in model container [2019-09-08 05:41:50,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:41:47" (2/3) ... [2019-09-08 05:41:50,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b30f13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:41:50, skipping insertion in model container [2019-09-08 05:41:50,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:41:50" (3/3) ... [2019-09-08 05:41:50,344 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec8_product20.cil.c [2019-09-08 05:41:50,353 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 05:41:50,364 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 05:41:50,381 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 05:41:50,426 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 05:41:50,427 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 05:41:50,427 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 05:41:50,427 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 05:41:50,427 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 05:41:50,427 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 05:41:50,427 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 05:41:50,428 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 05:41:50,428 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 05:41:50,465 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states. [2019-09-08 05:41:50,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-08 05:41:50,497 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:41:50,499 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:41:50,501 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:41:50,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:41:50,508 INFO L82 PathProgramCache]: Analyzing trace with hash -26401555, now seen corresponding path program 1 times [2019-09-08 05:41:50,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:41:50,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:41:50,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:50,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:41:50,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:41:51,145 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:41:51,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:41:51,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 05:41:51,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 05:41:51,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 05:41:51,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 05:41:51,172 INFO L87 Difference]: Start difference. First operand 563 states. Second operand 2 states. [2019-09-08 05:41:51,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:41:51,278 INFO L93 Difference]: Finished difference Result 764 states and 1044 transitions. [2019-09-08 05:41:51,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 05:41:51,280 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 154 [2019-09-08 05:41:51,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:41:51,302 INFO L225 Difference]: With dead ends: 764 [2019-09-08 05:41:51,302 INFO L226 Difference]: Without dead ends: 510 [2019-09-08 05:41:51,309 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:41:51,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-09-08 05:41:51,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2019-09-08 05:41:51,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2019-09-08 05:41:51,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 701 transitions. [2019-09-08 05:41:51,403 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 701 transitions. Word has length 154 [2019-09-08 05:41:51,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:41:51,406 INFO L475 AbstractCegarLoop]: Abstraction has 510 states and 701 transitions. [2019-09-08 05:41:51,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 05:41:51,406 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 701 transitions. [2019-09-08 05:41:51,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-08 05:41:51,412 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:41:51,412 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:41:51,413 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:41:51,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:41:51,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1452305840, now seen corresponding path program 1 times [2019-09-08 05:41:51,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:41:51,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:41:51,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:51,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:41:51,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:41:51,670 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:41:51,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:41:51,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:41:51,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:41:51,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:41:51,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:41:51,674 INFO L87 Difference]: Start difference. First operand 510 states and 701 transitions. Second operand 3 states. [2019-09-08 05:41:51,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:41:51,754 INFO L93 Difference]: Finished difference Result 747 states and 1010 transitions. [2019-09-08 05:41:51,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:41:51,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-09-08 05:41:51,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:41:51,765 INFO L225 Difference]: With dead ends: 747 [2019-09-08 05:41:51,765 INFO L226 Difference]: Without dead ends: 513 [2019-09-08 05:41:51,769 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:41:51,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-09-08 05:41:51,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 512. [2019-09-08 05:41:51,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-09-08 05:41:51,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 703 transitions. [2019-09-08 05:41:51,828 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 703 transitions. Word has length 155 [2019-09-08 05:41:51,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:41:51,829 INFO L475 AbstractCegarLoop]: Abstraction has 512 states and 703 transitions. [2019-09-08 05:41:51,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:41:51,830 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 703 transitions. [2019-09-08 05:41:51,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 05:41:51,836 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:41:51,836 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:41:51,836 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:41:51,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:41:51,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1395553248, now seen corresponding path program 1 times [2019-09-08 05:41:51,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:41:51,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:41:51,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:51,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:41:51,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:51,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:41:52,106 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:41:52,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:41:52,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:41:52,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:41:52,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:41:52,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:41:52,108 INFO L87 Difference]: Start difference. First operand 512 states and 703 transitions. Second operand 3 states. [2019-09-08 05:41:52,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:41:52,146 INFO L93 Difference]: Finished difference Result 1002 states and 1407 transitions. [2019-09-08 05:41:52,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:41:52,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-09-08 05:41:52,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:41:52,152 INFO L225 Difference]: With dead ends: 1002 [2019-09-08 05:41:52,152 INFO L226 Difference]: Without dead ends: 555 [2019-09-08 05:41:52,155 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:41:52,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-09-08 05:41:52,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 554. [2019-09-08 05:41:52,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-09-08 05:41:52,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 775 transitions. [2019-09-08 05:41:52,181 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 775 transitions. Word has length 165 [2019-09-08 05:41:52,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:41:52,182 INFO L475 AbstractCegarLoop]: Abstraction has 554 states and 775 transitions. [2019-09-08 05:41:52,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:41:52,182 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 775 transitions. [2019-09-08 05:41:52,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 05:41:52,187 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:41:52,187 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:41:52,187 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:41:52,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:41:52,188 INFO L82 PathProgramCache]: Analyzing trace with hash 742155615, now seen corresponding path program 1 times [2019-09-08 05:41:52,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:41:52,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:41:52,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:52,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:41:52,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:52,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:41:52,331 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:41:52,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:41:52,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:41:52,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:41:52,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:41:52,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:41:52,335 INFO L87 Difference]: Start difference. First operand 554 states and 775 transitions. Second operand 3 states. [2019-09-08 05:41:52,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:41:52,379 INFO L93 Difference]: Finished difference Result 1125 states and 1618 transitions. [2019-09-08 05:41:52,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:41:52,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-09-08 05:41:52,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:41:52,388 INFO L225 Difference]: With dead ends: 1125 [2019-09-08 05:41:52,390 INFO L226 Difference]: Without dead ends: 636 [2019-09-08 05:41:52,393 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:41:52,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2019-09-08 05:41:52,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 635. [2019-09-08 05:41:52,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-09-08 05:41:52,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 913 transitions. [2019-09-08 05:41:52,428 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 913 transitions. Word has length 166 [2019-09-08 05:41:52,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:41:52,428 INFO L475 AbstractCegarLoop]: Abstraction has 635 states and 913 transitions. [2019-09-08 05:41:52,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:41:52,429 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 913 transitions. [2019-09-08 05:41:52,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 05:41:52,433 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:41:52,434 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:41:52,434 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:41:52,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:41:52,434 INFO L82 PathProgramCache]: Analyzing trace with hash -158203488, now seen corresponding path program 1 times [2019-09-08 05:41:52,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:41:52,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:41:52,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:52,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:41:52,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:52,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:41:52,592 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:41:52,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:41:52,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:41:52,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:41:52,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:41:52,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:41:52,595 INFO L87 Difference]: Start difference. First operand 635 states and 913 transitions. Second operand 3 states. [2019-09-08 05:41:52,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:41:52,644 INFO L93 Difference]: Finished difference Result 1362 states and 2022 transitions. [2019-09-08 05:41:52,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:41:52,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-09-08 05:41:52,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:41:52,652 INFO L225 Difference]: With dead ends: 1362 [2019-09-08 05:41:52,653 INFO L226 Difference]: Without dead ends: 792 [2019-09-08 05:41:52,656 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:41:52,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2019-09-08 05:41:52,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 791. [2019-09-08 05:41:52,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2019-09-08 05:41:52,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1177 transitions. [2019-09-08 05:41:52,714 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1177 transitions. Word has length 167 [2019-09-08 05:41:52,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:41:52,715 INFO L475 AbstractCegarLoop]: Abstraction has 791 states and 1177 transitions. [2019-09-08 05:41:52,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:41:52,715 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1177 transitions. [2019-09-08 05:41:52,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 05:41:52,723 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:41:52,723 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:41:52,724 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:41:52,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:41:52,725 INFO L82 PathProgramCache]: Analyzing trace with hash 937061343, now seen corresponding path program 1 times [2019-09-08 05:41:52,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:41:52,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:41:52,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:52,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:41:52,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:41:52,991 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:41:52,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:41:52,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:41:52,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:41:52,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:41:52,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:41:52,993 INFO L87 Difference]: Start difference. First operand 791 states and 1177 transitions. Second operand 3 states. [2019-09-08 05:41:53,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:41:53,054 INFO L93 Difference]: Finished difference Result 1818 states and 2794 transitions. [2019-09-08 05:41:53,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:41:53,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-09-08 05:41:53,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:41:53,065 INFO L225 Difference]: With dead ends: 1818 [2019-09-08 05:41:53,065 INFO L226 Difference]: Without dead ends: 1092 [2019-09-08 05:41:53,069 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:41:53,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2019-09-08 05:41:53,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 1091. [2019-09-08 05:41:53,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1091 states. [2019-09-08 05:41:53,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1681 transitions. [2019-09-08 05:41:53,116 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1681 transitions. Word has length 168 [2019-09-08 05:41:53,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:41:53,118 INFO L475 AbstractCegarLoop]: Abstraction has 1091 states and 1681 transitions. [2019-09-08 05:41:53,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:41:53,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1681 transitions. [2019-09-08 05:41:53,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-08 05:41:53,125 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:41:53,126 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:41:53,126 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:41:53,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:41:53,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1598706118, now seen corresponding path program 1 times [2019-09-08 05:41:53,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:41:53,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:41:53,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:53,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:41:53,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:41:53,347 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:41:53,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:41:53,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:41:53,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:41:53,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:41:53,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:41:53,350 INFO L87 Difference]: Start difference. First operand 1091 states and 1681 transitions. Second operand 3 states. [2019-09-08 05:41:53,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:41:53,406 INFO L93 Difference]: Finished difference Result 1426 states and 2141 transitions. [2019-09-08 05:41:53,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:41:53,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-09-08 05:41:53,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:41:53,416 INFO L225 Difference]: With dead ends: 1426 [2019-09-08 05:41:53,417 INFO L226 Difference]: Without dead ends: 1205 [2019-09-08 05:41:53,418 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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:41:53,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2019-09-08 05:41:53,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 1204. [2019-09-08 05:41:53,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1204 states. [2019-09-08 05:41:53,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1843 transitions. [2019-09-08 05:41:53,498 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1843 transitions. Word has length 171 [2019-09-08 05:41:53,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:41:53,500 INFO L475 AbstractCegarLoop]: Abstraction has 1204 states and 1843 transitions. [2019-09-08 05:41:53,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:41:53,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1843 transitions. [2019-09-08 05:41:53,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-09-08 05:41:53,511 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:41:53,511 INFO L399 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:53,512 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:41:53,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:41:53,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1464715799, now seen corresponding path program 1 times [2019-09-08 05:41:53,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:41:53,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:41:53,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:53,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:41:53,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:53,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:41:53,878 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-08 05:41:53,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:41:53,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:41:53,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:41:53,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:41:53,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:41:53,882 INFO L87 Difference]: Start difference. First operand 1204 states and 1843 transitions. Second operand 6 states. [2019-09-08 05:41:54,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:41:54,618 INFO L93 Difference]: Finished difference Result 2682 states and 4084 transitions. [2019-09-08 05:41:54,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 05:41:54,619 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 295 [2019-09-08 05:41:54,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:41:54,637 INFO L225 Difference]: With dead ends: 2682 [2019-09-08 05:41:54,637 INFO L226 Difference]: Without dead ends: 2359 [2019-09-08 05:41:54,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 05:41:54,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2359 states. [2019-09-08 05:41:54,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2359 to 2348. [2019-09-08 05:41:54,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2348 states. [2019-09-08 05:41:54,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2348 states to 2348 states and 3636 transitions. [2019-09-08 05:41:54,822 INFO L78 Accepts]: Start accepts. Automaton has 2348 states and 3636 transitions. Word has length 295 [2019-09-08 05:41:54,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:41:54,825 INFO L475 AbstractCegarLoop]: Abstraction has 2348 states and 3636 transitions. [2019-09-08 05:41:54,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:41:54,825 INFO L276 IsEmpty]: Start isEmpty. Operand 2348 states and 3636 transitions. [2019-09-08 05:41:54,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-09-08 05:41:54,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:41:54,843 INFO L399 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:54,843 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:41:54,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:41:54,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1738724539, now seen corresponding path program 1 times [2019-09-08 05:41:54,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:41:54,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:41:54,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:54,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:41:54,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:41:55,141 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-08 05:41:55,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:41:55,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 05:41:55,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 05:41:55,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 05:41:55,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 05:41:55,146 INFO L87 Difference]: Start difference. First operand 2348 states and 3636 transitions. Second operand 9 states. [2019-09-08 05:41:55,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:41:55,565 INFO L93 Difference]: Finished difference Result 2991 states and 4495 transitions. [2019-09-08 05:41:55,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 05:41:55,566 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 296 [2019-09-08 05:41:55,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:41:55,585 INFO L225 Difference]: With dead ends: 2991 [2019-09-08 05:41:55,585 INFO L226 Difference]: Without dead ends: 2322 [2019-09-08 05:41:55,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-09-08 05:41:55,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2322 states. [2019-09-08 05:41:55,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2322 to 2318. [2019-09-08 05:41:55,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2318 states. [2019-09-08 05:41:55,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 3585 transitions. [2019-09-08 05:41:55,761 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 3585 transitions. Word has length 296 [2019-09-08 05:41:55,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:41:55,762 INFO L475 AbstractCegarLoop]: Abstraction has 2318 states and 3585 transitions. [2019-09-08 05:41:55,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 05:41:55,762 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 3585 transitions. [2019-09-08 05:41:55,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-09-08 05:41:55,777 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:41:55,777 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, 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] [2019-09-08 05:41:55,778 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:41:55,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:41:55,778 INFO L82 PathProgramCache]: Analyzing trace with hash -2024929825, now seen corresponding path program 1 times [2019-09-08 05:41:55,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:41:55,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:41:55,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:55,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:41:55,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:55,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:41:56,255 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-09-08 05:41:56,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:41:56,256 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:41:56,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:41:56,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:41:56,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 3330 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:41:56,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:41:57,304 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 64 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:41:57,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:41:57,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [22] total 29 [2019-09-08 05:41:57,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-08 05:41:57,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-08 05:41:57,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=746, Unknown=0, NotChecked=0, Total=812 [2019-09-08 05:41:57,329 INFO L87 Difference]: Start difference. First operand 2318 states and 3585 transitions. Second operand 29 states. [2019-09-08 05:42:36,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:42:36,516 INFO L93 Difference]: Finished difference Result 11222 states and 17411 transitions. [2019-09-08 05:42:36,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-09-08 05:42:36,516 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 289 [2019-09-08 05:42:36,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:42:36,572 INFO L225 Difference]: With dead ends: 11222 [2019-09-08 05:42:36,572 INFO L226 Difference]: Without dead ends: 8796 [2019-09-08 05:42:36,593 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10451 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2054, Invalid=28048, Unknown=0, NotChecked=0, Total=30102 [2019-09-08 05:42:36,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8796 states. [2019-09-08 05:42:37,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8796 to 8398. [2019-09-08 05:42:37,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8398 states. [2019-09-08 05:42:37,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8398 states to 8398 states and 12814 transitions. [2019-09-08 05:42:37,116 INFO L78 Accepts]: Start accepts. Automaton has 8398 states and 12814 transitions. Word has length 289 [2019-09-08 05:42:37,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:42:37,116 INFO L475 AbstractCegarLoop]: Abstraction has 8398 states and 12814 transitions. [2019-09-08 05:42:37,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-08 05:42:37,117 INFO L276 IsEmpty]: Start isEmpty. Operand 8398 states and 12814 transitions. [2019-09-08 05:42:37,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-09-08 05:42:37,153 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:42:37,153 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:42:37,154 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:42:37,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:42:37,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1616303592, now seen corresponding path program 1 times [2019-09-08 05:42:37,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:42:37,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:42:37,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:42:37,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:42:37,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:42:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:42:37,818 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-09-08 05:42:37,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:42:37,819 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:42:37,840 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:42:38,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:42:38,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 3332 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:42:38,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:42:38,576 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-08 05:42:38,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:42:38,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [18] total 23 [2019-09-08 05:42:38,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 05:42:38,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 05:42:38,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2019-09-08 05:42:38,586 INFO L87 Difference]: Start difference. First operand 8398 states and 12814 transitions. Second operand 23 states. [2019-09-08 05:43:10,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:43:10,565 INFO L93 Difference]: Finished difference Result 22896 states and 35219 transitions. [2019-09-08 05:43:10,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-09-08 05:43:10,565 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 291 [2019-09-08 05:43:10,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:43:10,648 INFO L225 Difference]: With dead ends: 22896 [2019-09-08 05:43:10,648 INFO L226 Difference]: Without dead ends: 13026 [2019-09-08 05:43:10,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9531 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1916, Invalid=24816, Unknown=0, NotChecked=0, Total=26732 [2019-09-08 05:43:10,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13026 states. [2019-09-08 05:43:12,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13026 to 11572. [2019-09-08 05:43:12,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11572 states. [2019-09-08 05:43:12,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11572 states to 11572 states and 17496 transitions. [2019-09-08 05:43:12,275 INFO L78 Accepts]: Start accepts. Automaton has 11572 states and 17496 transitions. Word has length 291 [2019-09-08 05:43:12,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:43:12,276 INFO L475 AbstractCegarLoop]: Abstraction has 11572 states and 17496 transitions. [2019-09-08 05:43:12,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 05:43:12,276 INFO L276 IsEmpty]: Start isEmpty. Operand 11572 states and 17496 transitions. [2019-09-08 05:43:12,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-09-08 05:43:12,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:43:12,315 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:43:12,316 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:43:12,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:43:12,316 INFO L82 PathProgramCache]: Analyzing trace with hash -319847030, now seen corresponding path program 1 times [2019-09-08 05:43:12,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:43:12,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:43:12,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:43:12,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:43:12,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:43:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:43:12,506 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-09-08 05:43:12,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:43:12,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:43:12,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:43:12,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:43:12,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:43:12,508 INFO L87 Difference]: Start difference. First operand 11572 states and 17496 transitions. Second operand 5 states. [2019-09-08 05:43:12,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:43:12,828 INFO L93 Difference]: Finished difference Result 19389 states and 28685 transitions. [2019-09-08 05:43:12,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 05:43:12,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 293 [2019-09-08 05:43:12,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:43:12,891 INFO L225 Difference]: With dead ends: 19389 [2019-09-08 05:43:12,891 INFO L226 Difference]: Without dead ends: 10966 [2019-09-08 05:43:12,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:43:12,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10966 states. [2019-09-08 05:43:13,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10966 to 10758. [2019-09-08 05:43:13,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10758 states. [2019-09-08 05:43:13,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10758 states to 10758 states and 16232 transitions. [2019-09-08 05:43:13,534 INFO L78 Accepts]: Start accepts. Automaton has 10758 states and 16232 transitions. Word has length 293 [2019-09-08 05:43:13,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:43:13,536 INFO L475 AbstractCegarLoop]: Abstraction has 10758 states and 16232 transitions. [2019-09-08 05:43:13,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:43:13,536 INFO L276 IsEmpty]: Start isEmpty. Operand 10758 states and 16232 transitions. [2019-09-08 05:43:13,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-09-08 05:43:13,572 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:43:13,572 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:43:13,572 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:43:13,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:43:13,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1761345107, now seen corresponding path program 1 times [2019-09-08 05:43:13,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:43:13,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:43:13,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:43:13,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:43:13,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:43:13,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:43:13,918 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-09-08 05:43:13,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:43:13,919 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:43:13,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:43:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:43:14,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 3334 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:43:14,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:43:14,791 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 05:43:14,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:43:14,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 25 [2019-09-08 05:43:14,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 05:43:14,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 05:43:14,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2019-09-08 05:43:14,811 INFO L87 Difference]: Start difference. First operand 10758 states and 16232 transitions. Second operand 25 states. [2019-09-08 05:43:49,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:43:49,361 INFO L93 Difference]: Finished difference Result 28531 states and 43530 transitions. [2019-09-08 05:43:49,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-09-08 05:43:49,362 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 293 [2019-09-08 05:43:49,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:43:49,424 INFO L225 Difference]: With dead ends: 28531 [2019-09-08 05:43:49,425 INFO L226 Difference]: Without dead ends: 15479 [2019-09-08 05:43:49,464 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9535 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1939, Invalid=25451, Unknown=0, NotChecked=0, Total=27390 [2019-09-08 05:43:49,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15479 states. [2019-09-08 05:43:50,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15479 to 13098. [2019-09-08 05:43:50,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13098 states. [2019-09-08 05:43:50,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13098 states to 13098 states and 19637 transitions. [2019-09-08 05:43:50,193 INFO L78 Accepts]: Start accepts. Automaton has 13098 states and 19637 transitions. Word has length 293 [2019-09-08 05:43:50,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:43:50,193 INFO L475 AbstractCegarLoop]: Abstraction has 13098 states and 19637 transitions. [2019-09-08 05:43:50,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 05:43:50,194 INFO L276 IsEmpty]: Start isEmpty. Operand 13098 states and 19637 transitions. [2019-09-08 05:43:50,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-09-08 05:43:50,232 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:43:50,233 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:43:50,233 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:43:50,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:43:50,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1758638245, now seen corresponding path program 1 times [2019-09-08 05:43:50,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:43:50,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:43:50,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:43:50,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:43:50,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:43:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:43:50,531 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-09-08 05:43:50,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:43:50,535 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) [2019-09-08 05:43:50,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:43:50,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:43:51,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 3334 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:43:51,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:43:51,409 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-09-08 05:43:51,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:43:51,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 23 [2019-09-08 05:43:51,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 05:43:51,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 05:43:51,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=457, Unknown=0, NotChecked=0, Total=506 [2019-09-08 05:43:51,423 INFO L87 Difference]: Start difference. First operand 13098 states and 19637 transitions. Second operand 23 states. [2019-09-08 05:43:55,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:43:55,097 INFO L93 Difference]: Finished difference Result 27342 states and 42254 transitions. [2019-09-08 05:43:55,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 05:43:55,098 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 293 [2019-09-08 05:43:55,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:43:55,164 INFO L225 Difference]: With dead ends: 27342 [2019-09-08 05:43:55,165 INFO L226 Difference]: Without dead ends: 13925 [2019-09-08 05:43:55,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=1740, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 05:43:55,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13925 states. [2019-09-08 05:43:55,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13925 to 13864. [2019-09-08 05:43:55,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13864 states. [2019-09-08 05:43:55,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13864 states to 13864 states and 20890 transitions. [2019-09-08 05:43:55,973 INFO L78 Accepts]: Start accepts. Automaton has 13864 states and 20890 transitions. Word has length 293 [2019-09-08 05:43:55,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:43:55,974 INFO L475 AbstractCegarLoop]: Abstraction has 13864 states and 20890 transitions. [2019-09-08 05:43:55,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 05:43:55,974 INFO L276 IsEmpty]: Start isEmpty. Operand 13864 states and 20890 transitions. [2019-09-08 05:43:55,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-09-08 05:43:55,997 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:43:55,998 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:43:55,999 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:43:55,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:43:55,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1176083215, now seen corresponding path program 1 times [2019-09-08 05:43:55,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:43:55,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:43:56,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:43:56,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:43:56,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:43:56,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:43:56,509 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-08 05:43:56,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:43:56,509 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) [2019-09-08 05:43:56,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:43:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:43:57,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 3335 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:43:57,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:43:57,400 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-09-08 05:43:57,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:43:57,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [24] total 29 [2019-09-08 05:43:57,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-08 05:43:57,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-08 05:43:57,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=748, Unknown=0, NotChecked=0, Total=812 [2019-09-08 05:43:57,422 INFO L87 Difference]: Start difference. First operand 13864 states and 20890 transitions. Second operand 29 states. [2019-09-08 05:44:33,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:44:33,086 INFO L93 Difference]: Finished difference Result 50538 states and 77836 transitions. [2019-09-08 05:44:33,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2019-09-08 05:44:33,086 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 295 [2019-09-08 05:44:33,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:44:33,243 INFO L225 Difference]: With dead ends: 50538 [2019-09-08 05:44:33,243 INFO L226 Difference]: Without dead ends: 32290 [2019-09-08 05:44:33,312 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15335 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2506, Invalid=39314, Unknown=0, NotChecked=0, Total=41820 [2019-09-08 05:44:33,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32290 states. [2019-09-08 05:44:34,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32290 to 28225. [2019-09-08 05:44:34,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28225 states. [2019-09-08 05:44:34,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28225 states to 28225 states and 42616 transitions. [2019-09-08 05:44:34,919 INFO L78 Accepts]: Start accepts. Automaton has 28225 states and 42616 transitions. Word has length 295 [2019-09-08 05:44:34,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:44:34,920 INFO L475 AbstractCegarLoop]: Abstraction has 28225 states and 42616 transitions. [2019-09-08 05:44:34,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-08 05:44:34,920 INFO L276 IsEmpty]: Start isEmpty. Operand 28225 states and 42616 transitions. [2019-09-08 05:44:34,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-09-08 05:44:34,935 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:44:34,936 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 05:44:34,936 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:44:34,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:44:34,937 INFO L82 PathProgramCache]: Analyzing trace with hash 2008613164, now seen corresponding path program 1 times [2019-09-08 05:44:34,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:44:34,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:44:34,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:44:34,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:44:34,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:44:34,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:44:35,133 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-08 05:44:35,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:44:35,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 05:44:35,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 05:44:35,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 05:44:35,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 05:44:35,135 INFO L87 Difference]: Start difference. First operand 28225 states and 42616 transitions. Second operand 9 states. [2019-09-08 05:44:35,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:44:35,864 INFO L93 Difference]: Finished difference Result 52147 states and 80064 transitions. [2019-09-08 05:44:35,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 05:44:35,864 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 298 [2019-09-08 05:44:35,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:44:35,994 INFO L225 Difference]: With dead ends: 52147 [2019-09-08 05:44:35,995 INFO L226 Difference]: Without dead ends: 29230 [2019-09-08 05:44:36,063 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:44:36,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29230 states. [2019-09-08 05:44:37,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29230 to 28973. [2019-09-08 05:44:37,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28973 states. [2019-09-08 05:44:37,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28973 states to 28973 states and 43799 transitions. [2019-09-08 05:44:37,565 INFO L78 Accepts]: Start accepts. Automaton has 28973 states and 43799 transitions. Word has length 298 [2019-09-08 05:44:37,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:44:37,566 INFO L475 AbstractCegarLoop]: Abstraction has 28973 states and 43799 transitions. [2019-09-08 05:44:37,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 05:44:37,566 INFO L276 IsEmpty]: Start isEmpty. Operand 28973 states and 43799 transitions. [2019-09-08 05:44:37,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-08 05:44:37,591 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:44:37,592 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:44:37,592 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:44:37,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:44:37,592 INFO L82 PathProgramCache]: Analyzing trace with hash 628638122, now seen corresponding path program 1 times [2019-09-08 05:44:37,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:44:37,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:44:37,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:44:37,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:44:37,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:44:37,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:44:37,789 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-08 05:44:37,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:44:37,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 05:44:37,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 05:44:37,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 05:44:37,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 05:44:37,791 INFO L87 Difference]: Start difference. First operand 28973 states and 43799 transitions. Second operand 9 states. [2019-09-08 05:44:38,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:44:38,534 INFO L93 Difference]: Finished difference Result 53568 states and 82339 transitions. [2019-09-08 05:44:38,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 05:44:38,534 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 300 [2019-09-08 05:44:38,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:44:38,643 INFO L225 Difference]: With dead ends: 53568 [2019-09-08 05:44:38,644 INFO L226 Difference]: Without dead ends: 29903 [2019-09-08 05:44:38,714 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:44:38,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29903 states. [2019-09-08 05:44:41,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29903 to 29707. [2019-09-08 05:44:41,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29707 states. [2019-09-08 05:44:41,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29707 states to 29707 states and 44940 transitions. [2019-09-08 05:44:41,482 INFO L78 Accepts]: Start accepts. Automaton has 29707 states and 44940 transitions. Word has length 300 [2019-09-08 05:44:41,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:44:41,483 INFO L475 AbstractCegarLoop]: Abstraction has 29707 states and 44940 transitions. [2019-09-08 05:44:41,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 05:44:41,483 INFO L276 IsEmpty]: Start isEmpty. Operand 29707 states and 44940 transitions. [2019-09-08 05:44:41,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-09-08 05:44:41,507 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:44:41,508 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:44:41,508 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:44:41,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:44:41,508 INFO L82 PathProgramCache]: Analyzing trace with hash -226885184, now seen corresponding path program 1 times [2019-09-08 05:44:41,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:44:41,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:44:41,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:44:41,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:44:41,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:44:41,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:44:41,679 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-09-08 05:44:41,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:44:41,679 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:44:41,693 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:44:42,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:44:42,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 3336 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:44:42,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:44:42,305 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-09-08 05:44:42,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:44:42,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2019-09-08 05:44:42,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 05:44:42,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 05:44:42,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-08 05:44:42,316 INFO L87 Difference]: Start difference. First operand 29707 states and 44940 transitions. Second operand 10 states. [2019-09-08 05:44:46,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:44:46,819 INFO L93 Difference]: Finished difference Result 90130 states and 136755 transitions. [2019-09-08 05:44:46,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 05:44:46,819 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 295 [2019-09-08 05:44:46,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:44:47,042 INFO L225 Difference]: With dead ends: 90130 [2019-09-08 05:44:47,042 INFO L226 Difference]: Without dead ends: 60241 [2019-09-08 05:44:47,101 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2019-09-08 05:44:47,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60241 states. [2019-09-08 05:44:48,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60241 to 59704. [2019-09-08 05:44:48,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59704 states. [2019-09-08 05:44:49,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59704 states to 59704 states and 90378 transitions. [2019-09-08 05:44:49,640 INFO L78 Accepts]: Start accepts. Automaton has 59704 states and 90378 transitions. Word has length 295 [2019-09-08 05:44:49,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:44:49,640 INFO L475 AbstractCegarLoop]: Abstraction has 59704 states and 90378 transitions. [2019-09-08 05:44:49,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 05:44:49,641 INFO L276 IsEmpty]: Start isEmpty. Operand 59704 states and 90378 transitions. [2019-09-08 05:44:49,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-09-08 05:44:49,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:44:49,667 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:44:49,668 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:44:49,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:44:49,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1135009235, now seen corresponding path program 1 times [2019-09-08 05:44:49,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:44:49,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:44:49,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:44:49,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:44:49,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:44:49,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:44:49,918 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-09-08 05:44:49,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:44:49,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 05:44:49,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 05:44:49,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 05:44:49,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:44:49,920 INFO L87 Difference]: Start difference. First operand 59704 states and 90378 transitions. Second operand 13 states. [2019-09-08 05:44:56,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:44:56,027 INFO L93 Difference]: Finished difference Result 171203 states and 267072 transitions. [2019-09-08 05:44:56,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 05:44:56,028 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 296 [2019-09-08 05:44:56,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:44:56,411 INFO L225 Difference]: With dead ends: 171203 [2019-09-08 05:44:56,412 INFO L226 Difference]: Without dead ends: 117934 [2019-09-08 05:44:56,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2019-09-08 05:44:56,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117934 states. [2019-09-08 05:45:03,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117934 to 116780. [2019-09-08 05:45:03,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116780 states. [2019-09-08 05:45:04,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116780 states to 116780 states and 175196 transitions. [2019-09-08 05:45:04,109 INFO L78 Accepts]: Start accepts. Automaton has 116780 states and 175196 transitions. Word has length 296 [2019-09-08 05:45:04,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:45:04,109 INFO L475 AbstractCegarLoop]: Abstraction has 116780 states and 175196 transitions. [2019-09-08 05:45:04,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 05:45:04,110 INFO L276 IsEmpty]: Start isEmpty. Operand 116780 states and 175196 transitions. [2019-09-08 05:45:04,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-09-08 05:45:04,157 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:45:04,157 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:45:04,157 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:45:04,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:45:04,157 INFO L82 PathProgramCache]: Analyzing trace with hash -2131652446, now seen corresponding path program 1 times [2019-09-08 05:45:04,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:45:04,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:45:04,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:45:04,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:45:04,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:45:04,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:45:04,301 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-09-08 05:45:04,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:45:04,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:45:04,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:45:04,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:45:04,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:45:04,304 INFO L87 Difference]: Start difference. First operand 116780 states and 175196 transitions. Second operand 3 states. [2019-09-08 05:45:08,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:45:08,373 INFO L93 Difference]: Finished difference Result 240395 states and 362735 transitions. [2019-09-08 05:45:08,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:45:08,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 296 [2019-09-08 05:45:08,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:45:08,779 INFO L225 Difference]: With dead ends: 240395 [2019-09-08 05:45:08,780 INFO L226 Difference]: Without dead ends: 123704 [2019-09-08 05:45:08,982 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:45:09,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123704 states. [2019-09-08 05:45:17,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123704 to 123664. [2019-09-08 05:45:17,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123664 states. [2019-09-08 05:45:18,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123664 states to 123664 states and 187397 transitions. [2019-09-08 05:45:18,291 INFO L78 Accepts]: Start accepts. Automaton has 123664 states and 187397 transitions. Word has length 296 [2019-09-08 05:45:18,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:45:18,292 INFO L475 AbstractCegarLoop]: Abstraction has 123664 states and 187397 transitions. [2019-09-08 05:45:18,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:45:18,292 INFO L276 IsEmpty]: Start isEmpty. Operand 123664 states and 187397 transitions. [2019-09-08 05:45:18,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-08 05:45:18,398 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:45:18,399 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:45:18,399 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:45:18,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:45:18,399 INFO L82 PathProgramCache]: Analyzing trace with hash 463131064, now seen corresponding path program 1 times [2019-09-08 05:45:18,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:45:18,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:45:18,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:45:18,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:45:18,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:45:18,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:45:18,604 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-08 05:45:18,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:45:18,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:45:18,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:45:18,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:45:18,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:45:18,612 INFO L87 Difference]: Start difference. First operand 123664 states and 187397 transitions. Second operand 5 states. [2019-09-08 05:45:26,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:45:26,136 INFO L93 Difference]: Finished difference Result 225044 states and 342045 transitions. [2019-09-08 05:45:26,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 05:45:26,136 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 300 [2019-09-08 05:45:26,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:45:26,565 INFO L225 Difference]: With dead ends: 225044 [2019-09-08 05:45:26,566 INFO L226 Difference]: Without dead ends: 123893 [2019-09-08 05:45:26,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:45:26,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123893 states. [2019-09-08 05:45:30,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123893 to 123716. [2019-09-08 05:45:30,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123716 states. [2019-09-08 05:45:31,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123716 states to 123716 states and 187235 transitions. [2019-09-08 05:45:31,136 INFO L78 Accepts]: Start accepts. Automaton has 123716 states and 187235 transitions. Word has length 300 [2019-09-08 05:45:31,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:45:31,137 INFO L475 AbstractCegarLoop]: Abstraction has 123716 states and 187235 transitions. [2019-09-08 05:45:31,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:45:31,137 INFO L276 IsEmpty]: Start isEmpty. Operand 123716 states and 187235 transitions. [2019-09-08 05:45:31,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-09-08 05:45:31,243 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:45:31,243 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:45:31,243 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:45:31,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:45:31,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1961029764, now seen corresponding path program 1 times [2019-09-08 05:45:31,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:45:31,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:45:31,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:45:31,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:45:31,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:45:31,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:45:34,620 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-08 05:45:34,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:45:34,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 05:45:34,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 05:45:34,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 05:45:34,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-08 05:45:34,621 INFO L87 Difference]: Start difference. First operand 123716 states and 187235 transitions. Second operand 11 states. [2019-09-08 05:45:42,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:45:42,562 INFO L93 Difference]: Finished difference Result 242942 states and 362297 transitions. [2019-09-08 05:45:42,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 05:45:42,564 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 298 [2019-09-08 05:45:42,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:45:43,006 INFO L225 Difference]: With dead ends: 242942 [2019-09-08 05:45:43,006 INFO L226 Difference]: Without dead ends: 138746 [2019-09-08 05:45:43,185 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:45:43,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138746 states. [2019-09-08 05:45:52,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138746 to 126605. [2019-09-08 05:45:52,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126605 states. [2019-09-08 05:45:53,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126605 states to 126605 states and 193143 transitions. [2019-09-08 05:45:53,191 INFO L78 Accepts]: Start accepts. Automaton has 126605 states and 193143 transitions. Word has length 298 [2019-09-08 05:45:53,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:45:53,192 INFO L475 AbstractCegarLoop]: Abstraction has 126605 states and 193143 transitions. [2019-09-08 05:45:53,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 05:45:53,192 INFO L276 IsEmpty]: Start isEmpty. Operand 126605 states and 193143 transitions. [2019-09-08 05:45:53,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-09-08 05:45:53,259 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:45:53,260 INFO L399 BasicCegarLoop]: trace histogram [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, 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:45:53,260 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:45:53,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:45:53,260 INFO L82 PathProgramCache]: Analyzing trace with hash -215299606, now seen corresponding path program 1 times [2019-09-08 05:45:53,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:45:53,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:45:53,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:45:53,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:45:53,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:45:53,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:45:53,418 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-08 05:45:53,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:45:53,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:45:53,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:45:53,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:45:53,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:45:53,420 INFO L87 Difference]: Start difference. First operand 126605 states and 193143 transitions. Second operand 3 states. [2019-09-08 05:45:57,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:45:57,708 INFO L93 Difference]: Finished difference Result 267149 states and 411253 transitions. [2019-09-08 05:45:57,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:45:57,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 350 [2019-09-08 05:45:57,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:45:58,129 INFO L225 Difference]: With dead ends: 267149 [2019-09-08 05:45:58,130 INFO L226 Difference]: Without dead ends: 140633 [2019-09-08 05:45:58,327 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:45:58,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140633 states. [2019-09-08 05:46:07,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140633 to 140427. [2019-09-08 05:46:07,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140427 states. [2019-09-08 05:46:08,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140427 states to 140427 states and 217525 transitions. [2019-09-08 05:46:08,293 INFO L78 Accepts]: Start accepts. Automaton has 140427 states and 217525 transitions. Word has length 350 [2019-09-08 05:46:08,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:46:08,293 INFO L475 AbstractCegarLoop]: Abstraction has 140427 states and 217525 transitions. [2019-09-08 05:46:08,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:46:08,293 INFO L276 IsEmpty]: Start isEmpty. Operand 140427 states and 217525 transitions. [2019-09-08 05:46:08,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-09-08 05:46:08,414 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:46:08,414 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-09-08 05:46:08,414 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:46:08,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:46:08,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1716394783, now seen corresponding path program 1 times [2019-09-08 05:46:08,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:46:08,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:46:08,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:08,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:46:08,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:08,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:46:08,565 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-09-08 05:46:08,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:46:08,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:46:08,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:46:08,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:46:08,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:46:08,566 INFO L87 Difference]: Start difference. First operand 140427 states and 217525 transitions. Second operand 3 states. [2019-09-08 05:46:19,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:46:19,250 INFO L93 Difference]: Finished difference Result 306889 states and 481617 transitions. [2019-09-08 05:46:19,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:46:19,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2019-09-08 05:46:19,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:46:19,756 INFO L225 Difference]: With dead ends: 306889 [2019-09-08 05:46:19,756 INFO L226 Difference]: Without dead ends: 166551 [2019-09-08 05:46:19,979 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:46:20,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166551 states. [2019-09-08 05:46:26,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166551 to 166431. [2019-09-08 05:46:26,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166431 states. [2019-09-08 05:46:27,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166431 states to 166431 states and 263250 transitions. [2019-09-08 05:46:27,274 INFO L78 Accepts]: Start accepts. Automaton has 166431 states and 263250 transitions. Word has length 335 [2019-09-08 05:46:27,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:46:27,274 INFO L475 AbstractCegarLoop]: Abstraction has 166431 states and 263250 transitions. [2019-09-08 05:46:27,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:46:27,275 INFO L276 IsEmpty]: Start isEmpty. Operand 166431 states and 263250 transitions. [2019-09-08 05:46:27,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-09-08 05:46:27,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:46:27,475 INFO L399 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:46:27,476 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:46:27,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:46:27,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1111968792, now seen corresponding path program 1 times [2019-09-08 05:46:27,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:46:27,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:46:27,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:27,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:46:27,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:27,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:46:27,654 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-08 05:46:27,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:46:27,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 05:46:27,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:46:27,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:46:27,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:46:27,656 INFO L87 Difference]: Start difference. First operand 166431 states and 263250 transitions. Second operand 7 states. [2019-09-08 05:46:38,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:46:38,477 INFO L93 Difference]: Finished difference Result 332881 states and 528895 transitions. [2019-09-08 05:46:38,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 05:46:38,477 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 352 [2019-09-08 05:46:38,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:46:39,354 INFO L225 Difference]: With dead ends: 332881 [2019-09-08 05:46:39,354 INFO L226 Difference]: Without dead ends: 166539 [2019-09-08 05:46:39,584 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:46:39,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166539 states. [2019-09-08 05:46:46,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166539 to 166445. [2019-09-08 05:46:46,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166445 states. [2019-09-08 05:46:46,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166445 states to 166445 states and 263244 transitions. [2019-09-08 05:46:46,694 INFO L78 Accepts]: Start accepts. Automaton has 166445 states and 263244 transitions. Word has length 352 [2019-09-08 05:46:46,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:46:46,694 INFO L475 AbstractCegarLoop]: Abstraction has 166445 states and 263244 transitions. [2019-09-08 05:46:46,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 05:46:46,694 INFO L276 IsEmpty]: Start isEmpty. Operand 166445 states and 263244 transitions. [2019-09-08 05:46:46,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-09-08 05:46:46,896 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:46:46,896 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 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, 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:46:46,896 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:46:46,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:46:46,896 INFO L82 PathProgramCache]: Analyzing trace with hash 761568818, now seen corresponding path program 1 times [2019-09-08 05:46:46,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:46:46,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:46:46,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:46,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:46:46,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:46:47,078 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-09-08 05:46:47,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:46:47,078 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:46:47,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:46:47,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:46:47,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 3695 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 05:46:47,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:46:47,713 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-09-08 05:46:47,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:46:47,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-09-08 05:46:47,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 05:46:47,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 05:46:47,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-08 05:46:47,721 INFO L87 Difference]: Start difference. First operand 166445 states and 263244 transitions. Second operand 10 states. [2019-09-08 05:46:56,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:46:56,039 INFO L93 Difference]: Finished difference Result 276659 states and 427909 transitions. [2019-09-08 05:46:56,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 05:46:56,039 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 352 [2019-09-08 05:46:56,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:46:56,558 INFO L225 Difference]: With dead ends: 276659 [2019-09-08 05:46:56,559 INFO L226 Difference]: Without dead ends: 167077 [2019-09-08 05:46:56,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 05:46:56,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167077 states. [2019-09-08 05:47:04,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167077 to 166951. [2019-09-08 05:47:04,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166951 states. [2019-09-08 05:47:05,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166951 states to 166951 states and 261613 transitions. [2019-09-08 05:47:05,213 INFO L78 Accepts]: Start accepts. Automaton has 166951 states and 261613 transitions. Word has length 352 [2019-09-08 05:47:05,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:47:05,213 INFO L475 AbstractCegarLoop]: Abstraction has 166951 states and 261613 transitions. [2019-09-08 05:47:05,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 05:47:05,213 INFO L276 IsEmpty]: Start isEmpty. Operand 166951 states and 261613 transitions. [2019-09-08 05:47:05,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-08 05:47:05,439 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:47:05,439 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:47:05,440 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:47:05,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:47:05,440 INFO L82 PathProgramCache]: Analyzing trace with hash -688617930, now seen corresponding path program 1 times [2019-09-08 05:47:05,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:47:05,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:47:05,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:47:05,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:47:05,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:47:05,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:47:05,582 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-09-08 05:47:05,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:47:05,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:47:05,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:47:05,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:47:05,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:47:05,584 INFO L87 Difference]: Start difference. First operand 166951 states and 261613 transitions. Second operand 3 states. [2019-09-08 05:47:16,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:47:16,152 INFO L93 Difference]: Finished difference Result 383081 states and 610092 transitions. [2019-09-08 05:47:16,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:47:16,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 322 [2019-09-08 05:47:16,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:47:16,824 INFO L225 Difference]: With dead ends: 383081 [2019-09-08 05:47:16,824 INFO L226 Difference]: Without dead ends: 216994 [2019-09-08 05:47:17,098 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:47:17,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216994 states. [2019-09-08 05:47:31,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216994 to 216982. [2019-09-08 05:47:31,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216982 states. [2019-09-08 05:47:32,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216982 states to 216982 states and 348152 transitions. [2019-09-08 05:47:32,022 INFO L78 Accepts]: Start accepts. Automaton has 216982 states and 348152 transitions. Word has length 322 [2019-09-08 05:47:32,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:47:32,022 INFO L475 AbstractCegarLoop]: Abstraction has 216982 states and 348152 transitions. [2019-09-08 05:47:32,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:47:32,022 INFO L276 IsEmpty]: Start isEmpty. Operand 216982 states and 348152 transitions. [2019-09-08 05:47:32,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2019-09-08 05:47:32,456 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:47:32,456 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 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:47:32,456 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:47:32,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:47:32,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1181199740, now seen corresponding path program 1 times [2019-09-08 05:47:32,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:47:32,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:47:32,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:47:32,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:47:32,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:47:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:47:32,667 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-08 05:47:32,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:47:32,668 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:47:32,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:47:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:47:33,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 3735 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 05:47:33,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:47:33,445 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-09-08 05:47:33,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:47:33,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2019-09-08 05:47:33,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 05:47:33,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 05:47:33,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:47:33,468 INFO L87 Difference]: Start difference. First operand 216982 states and 348152 transitions. Second operand 13 states. [2019-09-08 05:47:48,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:47:48,760 INFO L93 Difference]: Finished difference Result 334613 states and 522554 transitions. [2019-09-08 05:47:48,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 05:47:48,760 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 367 [2019-09-08 05:47:48,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:47:49,552 INFO L225 Difference]: With dead ends: 334613 [2019-09-08 05:47:49,552 INFO L226 Difference]: Without dead ends: 225289 [2019-09-08 05:47:49,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2019-09-08 05:47:49,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225289 states. [2019-09-08 05:47:59,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225289 to 224209. [2019-09-08 05:47:59,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224209 states. [2019-09-08 05:48:01,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224209 states to 224209 states and 359634 transitions. [2019-09-08 05:48:01,126 INFO L78 Accepts]: Start accepts. Automaton has 224209 states and 359634 transitions. Word has length 367 [2019-09-08 05:48:01,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:48:01,127 INFO L475 AbstractCegarLoop]: Abstraction has 224209 states and 359634 transitions. [2019-09-08 05:48:01,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 05:48:01,127 INFO L276 IsEmpty]: Start isEmpty. Operand 224209 states and 359634 transitions. [2019-09-08 05:48:01,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-08 05:48:01,625 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:48:01,626 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 05:48:01,626 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:48:01,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:48:01,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1649687388, now seen corresponding path program 1 times [2019-09-08 05:48:01,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:48:01,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:48:01,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:48:01,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:48:01,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:48:01,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:48:01,784 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-09-08 05:48:01,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:48:01,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:48:01,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:48:01,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:48:01,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:48:01,786 INFO L87 Difference]: Start difference. First operand 224209 states and 359634 transitions. Second operand 3 states. [2019-09-08 05:48:17,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:48:17,937 INFO L93 Difference]: Finished difference Result 540651 states and 878922 transitions. [2019-09-08 05:48:17,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:48:17,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-09-08 05:48:17,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:48:19,560 INFO L225 Difference]: With dead ends: 540651 [2019-09-08 05:48:19,560 INFO L226 Difference]: Without dead ends: 321631 [2019-09-08 05:48:19,960 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:48:20,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321631 states. [2019-09-08 05:48:43,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321631 to 321619. [2019-09-08 05:48:43,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321619 states. [2019-09-08 05:48:45,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321619 states to 321619 states and 524033 transitions. [2019-09-08 05:48:45,554 INFO L78 Accepts]: Start accepts. Automaton has 321619 states and 524033 transitions. Word has length 324 [2019-09-08 05:48:45,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:48:45,555 INFO L475 AbstractCegarLoop]: Abstraction has 321619 states and 524033 transitions. [2019-09-08 05:48:45,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:48:45,555 INFO L276 IsEmpty]: Start isEmpty. Operand 321619 states and 524033 transitions. [2019-09-08 05:48:46,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-09-08 05:48:46,509 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:48:46,509 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 05:48:46,509 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:48:46,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:48:46,510 INFO L82 PathProgramCache]: Analyzing trace with hash -712153757, now seen corresponding path program 1 times [2019-09-08 05:48:46,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:48:46,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:48:46,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:48:46,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:48:46,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:48:46,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:48:46,672 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-09-08 05:48:46,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:48:46,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:48:46,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:48:46,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:48:46,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:48:46,673 INFO L87 Difference]: Start difference. First operand 321619 states and 524033 transitions. Second operand 3 states. [2019-09-08 05:49:19,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:49:19,422 INFO L93 Difference]: Finished difference Result 818474 states and 1352131 transitions. [2019-09-08 05:49:19,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:49:19,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 325 [2019-09-08 05:49:19,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:49:21,029 INFO L225 Difference]: With dead ends: 818474 [2019-09-08 05:49:21,029 INFO L226 Difference]: Without dead ends: 504412 [2019-09-08 05:49:21,529 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:49:21,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504412 states. [2019-09-08 05:50:00,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504412 to 504400. [2019-09-08 05:50:00,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504400 states. [2019-09-08 05:50:02,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504400 states to 504400 states and 833257 transitions. [2019-09-08 05:50:02,396 INFO L78 Accepts]: Start accepts. Automaton has 504400 states and 833257 transitions. Word has length 325 [2019-09-08 05:50:02,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:50:02,396 INFO L475 AbstractCegarLoop]: Abstraction has 504400 states and 833257 transitions. [2019-09-08 05:50:02,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:50:02,396 INFO L276 IsEmpty]: Start isEmpty. Operand 504400 states and 833257 transitions. [2019-09-08 05:50:04,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-09-08 05:50:04,341 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:50:04,342 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 05:50:04,342 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:50:04,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:50:04,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1506508477, now seen corresponding path program 1 times [2019-09-08 05:50:04,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:50:04,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:50:04,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:50:04,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:50:04,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:50:14,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:50:14,602 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-09-08 05:50:14,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:50:14,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:50:14,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:50:14,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:50:14,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:50:14,603 INFO L87 Difference]: Start difference. First operand 504400 states and 833257 transitions. Second operand 3 states. [2019-09-08 05:50:56,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:50:56,963 INFO L93 Difference]: Finished difference Result 943962 states and 1548583 transitions. [2019-09-08 05:50:56,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:50:56,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 325 [2019-09-08 05:50:56,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:50:59,574 INFO L225 Difference]: With dead ends: 943962 [2019-09-08 05:50:59,574 INFO L226 Difference]: Without dead ends: 835048 [2019-09-08 05:51:00,792 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:51:01,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835048 states. [2019-09-08 05:52:13,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835048 to 835036. [2019-09-08 05:52:13,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 835036 states.