java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/email_spec4_product31.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 05:17:46,698 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 05:17:46,700 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 05:17:46,716 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 05:17:46,716 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 05:17:46,717 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 05:17:46,718 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 05:17:46,720 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 05:17:46,722 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 05:17:46,723 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 05:17:46,724 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 05:17:46,725 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 05:17:46,725 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 05:17:46,726 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 05:17:46,727 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 05:17:46,728 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 05:17:46,729 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 05:17:46,730 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 05:17:46,731 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 05:17:46,733 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 05:17:46,737 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 05:17:46,738 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 05:17:46,740 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 05:17:46,743 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 05:17:46,745 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 05:17:46,745 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 05:17:46,746 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 05:17:46,747 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 05:17:46,748 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 05:17:46,751 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 05:17:46,751 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 05:17:46,752 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 05:17:46,753 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 05:17:46,754 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 05:17:46,756 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 05:17:46,756 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 05:17:46,757 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 05:17:46,758 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 05:17:46,758 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 05:17:46,760 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 05:17:46,761 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 05:17:46,763 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:17:46,788 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 05:17:46,788 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 05:17:46,791 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 05:17:46,791 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 05:17:46,791 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 05:17:46,791 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 05:17:46,792 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 05:17:46,792 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 05:17:46,792 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 05:17:46,792 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 05:17:46,793 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 05:17:46,794 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 05:17:46,794 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 05:17:46,794 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 05:17:46,794 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 05:17:46,795 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 05:17:46,795 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 05:17:46,795 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 05:17:46,795 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 05:17:46,795 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 05:17:46,796 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 05:17:46,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 05:17:46,796 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 05:17:46,797 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 05:17:46,797 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 05:17:46,797 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 05:17:46,797 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 05:17:46,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 05:17:46,798 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 05:17:46,827 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 05:17:46,839 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 05:17:46,843 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 05:17:46,844 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 05:17:46,844 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 05:17:46,845 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec4_product31.cil.c [2019-09-08 05:17:46,903 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4c69ec2a/0c0a4c16cf1a451dacedc06f306418d6/FLAGea712d4b0 [2019-09-08 05:17:47,565 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 05:17:47,567 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec4_product31.cil.c [2019-09-08 05:17:47,599 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4c69ec2a/0c0a4c16cf1a451dacedc06f306418d6/FLAGea712d4b0 [2019-09-08 05:17:47,705 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4c69ec2a/0c0a4c16cf1a451dacedc06f306418d6 [2019-09-08 05:17:47,716 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 05:17:47,717 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 05:17:47,719 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 05:17:47,719 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 05:17:47,722 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 05:17:47,723 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:17:47" (1/1) ... [2019-09-08 05:17:47,726 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b099e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:17:47, skipping insertion in model container [2019-09-08 05:17:47,727 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:17:47" (1/1) ... [2019-09-08 05:17:47,733 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 05:17:47,818 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 05:17:48,554 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:17:48,572 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 05:17:48,744 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:17:48,853 INFO L192 MainTranslator]: Completed translation [2019-09-08 05:17:48,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:17:48 WrapperNode [2019-09-08 05:17:48,855 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 05:17:48,856 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 05:17:48,856 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 05:17:48,856 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 05:17:48,870 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:17:48" (1/1) ... [2019-09-08 05:17:48,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:17:48" (1/1) ... [2019-09-08 05:17:48,901 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:17:48" (1/1) ... [2019-09-08 05:17:48,902 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:17:48" (1/1) ... [2019-09-08 05:17:48,956 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:17:48" (1/1) ... [2019-09-08 05:17:48,979 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:17:48" (1/1) ... [2019-09-08 05:17:48,991 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:17:48" (1/1) ... [2019-09-08 05:17:49,009 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 05:17:49,009 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 05:17:49,010 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 05:17:49,010 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 05:17:49,011 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:17:48" (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:17:49,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 05:17:49,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 05:17:49,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 05:17:49,101 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-08 05:17:49,102 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-08 05:17:49,102 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-08 05:17:49,103 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-08 05:17:49,103 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-08 05:17:49,103 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-08 05:17:49,103 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-08 05:17:49,103 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-08 05:17:49,104 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-08 05:17:49,104 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-08 05:17:49,105 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-08 05:17:49,106 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-08 05:17:49,106 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-08 05:17:49,108 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-08 05:17:49,109 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-08 05:17:49,109 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-08 05:17:49,109 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-08 05:17:49,109 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-08 05:17:49,110 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-08 05:17:49,110 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-08 05:17:49,110 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-08 05:17:49,110 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-08 05:17:49,110 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-08 05:17:49,111 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-08 05:17:49,111 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-08 05:17:49,111 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-08 05:17:49,111 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-08 05:17:49,111 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-08 05:17:49,112 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-08 05:17:49,112 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 05:17:49,112 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 05:17:49,112 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 05:17:49,113 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 05:17:49,113 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 05:17:49,113 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 05:17:49,113 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 05:17:49,113 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-08 05:17:49,113 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-08 05:17:49,113 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-08 05:17:49,114 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-08 05:17:49,114 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-08 05:17:49,114 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-08 05:17:49,114 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-08 05:17:49,115 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-08 05:17:49,115 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 05:17:49,115 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 05:17:49,115 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-08 05:17:49,115 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-08 05:17:49,115 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-08 05:17:49,116 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-08 05:17:49,116 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-08 05:17:49,116 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-08 05:17:49,116 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-08 05:17:49,116 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-08 05:17:49,116 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-08 05:17:49,116 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-09-08 05:17:49,117 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-08 05:17:49,117 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-08 05:17:49,117 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-08 05:17:49,117 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-08 05:17:49,117 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-08 05:17:49,117 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-08 05:17:49,117 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-08 05:17:49,118 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-08 05:17:49,118 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-08 05:17:49,118 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-08 05:17:49,119 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-08 05:17:49,119 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-08 05:17:49,119 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-08 05:17:49,119 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-08 05:17:49,119 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-08 05:17:49,120 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-08 05:17:49,120 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-08 05:17:49,121 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-08 05:17:49,121 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-08 05:17:49,121 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-08 05:17:49,121 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-08 05:17:49,121 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-08 05:17:49,121 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-08 05:17:49,122 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2019-09-08 05:17:49,122 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-08 05:17:49,122 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-08 05:17:49,123 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-09-08 05:17:49,123 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-09-08 05:17:49,124 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-09-08 05:17:49,124 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-08 05:17:49,125 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-08 05:17:49,125 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-08 05:17:49,126 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-08 05:17:49,126 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-08 05:17:49,126 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-08 05:17:49,126 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-08 05:17:49,126 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-08 05:17:49,126 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-08 05:17:49,127 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-09-08 05:17:49,127 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-09-08 05:17:49,127 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-09-08 05:17:49,127 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__SignForward_spec__1 [2019-09-08 05:17:49,127 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-08 05:17:49,127 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Encrypt [2019-09-08 05:17:49,127 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Forward [2019-09-08 05:17:49,128 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-08 05:17:49,128 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-08 05:17:49,128 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-08 05:17:49,128 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-08 05:17:49,128 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-08 05:17:49,129 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 05:17:49,129 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 05:17:49,129 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 05:17:49,129 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 05:17:49,129 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-08 05:17:49,129 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 05:17:49,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 05:17:49,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 05:17:49,130 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-08 05:17:49,131 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-08 05:17:49,131 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-08 05:17:49,131 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-08 05:17:49,131 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-08 05:17:49,132 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-08 05:17:49,132 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-08 05:17:49,133 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-08 05:17:49,133 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-08 05:17:49,133 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-08 05:17:49,133 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-08 05:17:49,133 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-08 05:17:49,133 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-08 05:17:49,134 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-08 05:17:49,134 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-08 05:17:49,134 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-08 05:17:49,135 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-08 05:17:49,135 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-08 05:17:49,135 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-08 05:17:49,136 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-08 05:17:49,136 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-08 05:17:49,136 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-08 05:17:49,137 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-08 05:17:49,140 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-08 05:17:49,141 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-08 05:17:49,142 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-08 05:17:49,142 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-08 05:17:49,151 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-08 05:17:49,151 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-08 05:17:49,151 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 05:17:49,151 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 05:17:49,151 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 05:17:49,152 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 05:17:49,152 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 05:17:49,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 05:17:49,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 05:17:49,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 05:17:49,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 05:17:49,152 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 05:17:49,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 05:17:49,153 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 05:17:49,153 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 05:17:49,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 05:17:49,154 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 05:17:49,154 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 05:17:49,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 05:17:49,154 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 05:17:49,155 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 05:17:49,155 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-08 05:17:49,155 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 05:17:49,155 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 05:17:49,155 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 05:17:49,155 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-08 05:17:49,155 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-08 05:17:49,156 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-08 05:17:49,156 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-08 05:17:49,156 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-08 05:17:49,156 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-08 05:17:49,156 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-08 05:17:49,156 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-08 05:17:49,156 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-08 05:17:49,157 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-08 05:17:49,157 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-08 05:17:49,157 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 05:17:49,157 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 05:17:49,157 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 05:17:49,157 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-08 05:17:49,157 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-08 05:17:49,157 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-08 05:17:49,158 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-08 05:17:49,158 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-08 05:17:49,158 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-08 05:17:49,158 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-08 05:17:49,158 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-08 05:17:49,158 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-08 05:17:49,158 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-09-08 05:17:49,159 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-08 05:17:49,159 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-08 05:17:49,159 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-08 05:17:49,159 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-08 05:17:49,159 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-08 05:17:49,159 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-08 05:17:49,159 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-08 05:17:49,160 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-08 05:17:49,160 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-08 05:17:49,160 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-08 05:17:49,160 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-08 05:17:49,160 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-08 05:17:49,160 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-08 05:17:49,160 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-08 05:17:49,161 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-08 05:17:49,161 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-08 05:17:49,161 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-08 05:17:49,161 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-08 05:17:49,161 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-08 05:17:49,161 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-08 05:17:49,161 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-08 05:17:49,162 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-08 05:17:49,163 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-08 05:17:49,163 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-08 05:17:49,163 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-08 05:17:49,163 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-08 05:17:49,163 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-08 05:17:49,163 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-08 05:17:49,164 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-08 05:17:49,164 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-08 05:17:49,164 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-08 05:17:49,164 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-08 05:17:49,164 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-08 05:17:49,165 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-09-08 05:17:49,165 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-09-08 05:17:49,165 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-09-08 05:17:49,165 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__SignForward_spec__1 [2019-09-08 05:17:49,165 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-08 05:17:49,165 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2019-09-08 05:17:49,166 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-09-08 05:17:49,166 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-09-08 05:17:49,166 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-09-08 05:17:49,166 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-08 05:17:49,166 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-08 05:17:49,166 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Encrypt [2019-09-08 05:17:49,167 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Forward [2019-09-08 05:17:49,167 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-08 05:17:49,167 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 05:17:49,167 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-08 05:17:49,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 05:17:49,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 05:17:49,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 05:17:51,284 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 05:17:51,285 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 05:17:51,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:17:51 BoogieIcfgContainer [2019-09-08 05:17:51,288 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 05:17:51,289 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 05:17:51,290 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 05:17:51,293 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 05:17:51,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 05:17:47" (1/3) ... [2019-09-08 05:17:51,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f258a78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:17:51, skipping insertion in model container [2019-09-08 05:17:51,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:17:48" (2/3) ... [2019-09-08 05:17:51,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f258a78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:17:51, skipping insertion in model container [2019-09-08 05:17:51,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:17:51" (3/3) ... [2019-09-08 05:17:51,298 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec4_product31.cil.c [2019-09-08 05:17:51,308 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 05:17:51,318 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 05:17:51,336 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 05:17:51,373 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 05:17:51,374 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 05:17:51,374 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 05:17:51,374 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 05:17:51,374 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 05:17:51,374 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 05:17:51,374 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 05:17:51,375 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 05:17:51,375 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 05:17:51,409 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states. [2019-09-08 05:17:51,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-08 05:17:51,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:17:51,431 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:17:51,434 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:17:51,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:17:51,441 INFO L82 PathProgramCache]: Analyzing trace with hash -908593919, now seen corresponding path program 1 times [2019-09-08 05:17:51,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:17:51,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:17:51,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:17:51,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:17:51,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:17:51,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:17:52,020 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:17:52,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:17:52,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 05:17:52,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 05:17:52,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 05:17:52,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 05:17:52,048 INFO L87 Difference]: Start difference. First operand 558 states. Second operand 2 states. [2019-09-08 05:17:52,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:17:52,175 INFO L93 Difference]: Finished difference Result 858 states and 1126 transitions. [2019-09-08 05:17:52,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 05:17:52,178 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 164 [2019-09-08 05:17:52,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:17:52,222 INFO L225 Difference]: With dead ends: 858 [2019-09-08 05:17:52,223 INFO L226 Difference]: Without dead ends: 535 [2019-09-08 05:17:52,238 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:17:52,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-08 05:17:52,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2019-09-08 05:17:52,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2019-09-08 05:17:52,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 707 transitions. [2019-09-08 05:17:52,400 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 707 transitions. Word has length 164 [2019-09-08 05:17:52,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:17:52,403 INFO L475 AbstractCegarLoop]: Abstraction has 535 states and 707 transitions. [2019-09-08 05:17:52,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 05:17:52,403 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 707 transitions. [2019-09-08 05:17:52,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 05:17:52,419 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:17:52,420 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:17:52,420 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:17:52,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:17:52,421 INFO L82 PathProgramCache]: Analyzing trace with hash 644714031, now seen corresponding path program 1 times [2019-09-08 05:17:52,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:17:52,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:17:52,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:17:52,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:17:52,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:17:52,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:17:52,718 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:17:52,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:17:52,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:17:52,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:17:52,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:17:52,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:17:52,725 INFO L87 Difference]: Start difference. First operand 535 states and 707 transitions. Second operand 3 states. [2019-09-08 05:17:52,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:17:52,786 INFO L93 Difference]: Finished difference Result 841 states and 1094 transitions. [2019-09-08 05:17:52,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:17:52,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-09-08 05:17:52,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:17:52,798 INFO L225 Difference]: With dead ends: 841 [2019-09-08 05:17:52,798 INFO L226 Difference]: Without dead ends: 538 [2019-09-08 05:17:52,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:17:52,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-09-08 05:17:52,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 537. [2019-09-08 05:17:52,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-09-08 05:17:52,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 709 transitions. [2019-09-08 05:17:52,837 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 709 transitions. Word has length 165 [2019-09-08 05:17:52,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:17:52,839 INFO L475 AbstractCegarLoop]: Abstraction has 537 states and 709 transitions. [2019-09-08 05:17:52,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:17:52,839 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 709 transitions. [2019-09-08 05:17:52,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-08 05:17:52,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:17:52,844 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:17:52,844 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:17:52,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:17:52,845 INFO L82 PathProgramCache]: Analyzing trace with hash -826054429, now seen corresponding path program 1 times [2019-09-08 05:17:52,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:17:52,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:17:52,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:17:52,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:17:52,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:17:52,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:17:53,118 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:17:53,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:17:53,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:17:53,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:17:53,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:17:53,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:17:53,120 INFO L87 Difference]: Start difference. First operand 537 states and 709 transitions. Second operand 3 states. [2019-09-08 05:17:53,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:17:53,152 INFO L93 Difference]: Finished difference Result 1050 states and 1416 transitions. [2019-09-08 05:17:53,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:17:53,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-09-08 05:17:53,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:17:53,157 INFO L225 Difference]: With dead ends: 1050 [2019-09-08 05:17:53,157 INFO L226 Difference]: Without dead ends: 578 [2019-09-08 05:17:53,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:17:53,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-09-08 05:17:53,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 577. [2019-09-08 05:17:53,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-09-08 05:17:53,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 778 transitions. [2019-09-08 05:17:53,181 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 778 transitions. Word has length 171 [2019-09-08 05:17:53,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:17:53,182 INFO L475 AbstractCegarLoop]: Abstraction has 577 states and 778 transitions. [2019-09-08 05:17:53,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:17:53,183 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 778 transitions. [2019-09-08 05:17:53,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-08 05:17:53,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:17:53,186 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:17:53,186 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:17:53,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:17:53,187 INFO L82 PathProgramCache]: Analyzing trace with hash -290621353, now seen corresponding path program 1 times [2019-09-08 05:17:53,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:17:53,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:17:53,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:17:53,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:17:53,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:17:53,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:17:53,386 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:17:53,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:17:53,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 05:17:53,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:17:53,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:17:53,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:17:53,388 INFO L87 Difference]: Start difference. First operand 577 states and 778 transitions. Second operand 7 states. [2019-09-08 05:17:56,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:17:56,815 INFO L93 Difference]: Finished difference Result 1175 states and 1544 transitions. [2019-09-08 05:17:56,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 05:17:56,816 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 172 [2019-09-08 05:17:56,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:17:56,824 INFO L225 Difference]: With dead ends: 1175 [2019-09-08 05:17:56,824 INFO L226 Difference]: Without dead ends: 883 [2019-09-08 05:17:56,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:17:56,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2019-09-08 05:17:56,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 874. [2019-09-08 05:17:56,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2019-09-08 05:17:56,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1159 transitions. [2019-09-08 05:17:56,923 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1159 transitions. Word has length 172 [2019-09-08 05:17:56,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:17:56,927 INFO L475 AbstractCegarLoop]: Abstraction has 874 states and 1159 transitions. [2019-09-08 05:17:56,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 05:17:56,927 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1159 transitions. [2019-09-08 05:17:56,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 05:17:56,934 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:17:56,934 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:17:56,935 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:17:56,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:17:56,935 INFO L82 PathProgramCache]: Analyzing trace with hash 598384953, now seen corresponding path program 1 times [2019-09-08 05:17:56,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:17:56,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:17:56,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:17:56,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:17:56,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:17:56,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:17:57,300 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:17:57,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:17:57,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 05:17:57,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:17:57,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:17:57,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:17:57,304 INFO L87 Difference]: Start difference. First operand 874 states and 1159 transitions. Second operand 18 states. [2019-09-08 05:17:57,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:17:57,787 INFO L93 Difference]: Finished difference Result 1541 states and 2026 transitions. [2019-09-08 05:17:57,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 05:17:57,787 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 173 [2019-09-08 05:17:57,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:17:57,794 INFO L225 Difference]: With dead ends: 1541 [2019-09-08 05:17:57,795 INFO L226 Difference]: Without dead ends: 924 [2019-09-08 05:17:57,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2019-09-08 05:17:57,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2019-09-08 05:17:57,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 920. [2019-09-08 05:17:57,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 920 states. [2019-09-08 05:17:57,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1224 transitions. [2019-09-08 05:17:57,844 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1224 transitions. Word has length 173 [2019-09-08 05:17:57,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:17:57,845 INFO L475 AbstractCegarLoop]: Abstraction has 920 states and 1224 transitions. [2019-09-08 05:17:57,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 05:17:57,845 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1224 transitions. [2019-09-08 05:17:57,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-08 05:17:57,848 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:17:57,849 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:17:57,849 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:17:57,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:17:57,849 INFO L82 PathProgramCache]: Analyzing trace with hash 747428244, now seen corresponding path program 1 times [2019-09-08 05:17:57,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:17:57,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:17:57,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:17:57,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:17:57,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:17:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:17:58,026 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:17:58,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:17:58,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:17:58,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:17:58,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:17:58,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:17:58,028 INFO L87 Difference]: Start difference. First operand 920 states and 1224 transitions. Second operand 8 states. [2019-09-08 05:17:58,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:17:58,898 INFO L93 Difference]: Finished difference Result 1747 states and 2309 transitions. [2019-09-08 05:17:58,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 05:17:58,899 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 182 [2019-09-08 05:17:58,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:17:58,908 INFO L225 Difference]: With dead ends: 1747 [2019-09-08 05:17:58,909 INFO L226 Difference]: Without dead ends: 1588 [2019-09-08 05:17:58,910 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:17:58,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1588 states. [2019-09-08 05:17:58,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1588 to 1575. [2019-09-08 05:17:58,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2019-09-08 05:17:58,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2083 transitions. [2019-09-08 05:17:58,986 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2083 transitions. Word has length 182 [2019-09-08 05:17:58,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:17:58,987 INFO L475 AbstractCegarLoop]: Abstraction has 1575 states and 2083 transitions. [2019-09-08 05:17:58,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:17:58,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2083 transitions. [2019-09-08 05:17:58,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-08 05:17:58,991 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:17:58,991 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:17:58,992 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:17:58,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:17:58,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1282001460, now seen corresponding path program 1 times [2019-09-08 05:17:58,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:17:58,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:17:58,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:17:58,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:17:58,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:17:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:17:59,287 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-08 05:17:59,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:17:59,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 05:17:59,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 05:17:59,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 05:17:59,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-09-08 05:17:59,289 INFO L87 Difference]: Start difference. First operand 1575 states and 2083 transitions. Second operand 17 states. [2019-09-08 05:18:00,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:18:00,178 INFO L93 Difference]: Finished difference Result 2182 states and 2860 transitions. [2019-09-08 05:18:00,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 05:18:00,180 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 183 [2019-09-08 05:18:00,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:18:00,195 INFO L225 Difference]: With dead ends: 2182 [2019-09-08 05:18:00,196 INFO L226 Difference]: Without dead ends: 1574 [2019-09-08 05:18:00,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=829, Unknown=0, NotChecked=0, Total=930 [2019-09-08 05:18:00,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2019-09-08 05:18:00,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 1573. [2019-09-08 05:18:00,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2019-09-08 05:18:00,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2078 transitions. [2019-09-08 05:18:00,292 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2078 transitions. Word has length 183 [2019-09-08 05:18:00,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:18:00,293 INFO L475 AbstractCegarLoop]: Abstraction has 1573 states and 2078 transitions. [2019-09-08 05:18:00,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 05:18:00,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2078 transitions. [2019-09-08 05:18:00,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-08 05:18:00,297 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:18:00,298 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:18:00,298 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:18:00,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:18:00,299 INFO L82 PathProgramCache]: Analyzing trace with hash -287789140, now seen corresponding path program 2 times [2019-09-08 05:18:00,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:18:00,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:18:00,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:18:00,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:18:00,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:18:00,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:18:00,598 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-08 05:18:00,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:18:00,599 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:18:00,620 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 05:18:01,047 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-09-08 05:18:01,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 05:18:01,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 2032 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 05:18:01,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:18:01,324 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 05:18:01,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:18:01,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2019-09-08 05:18:01,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 05:18:01,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 05:18:01,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2019-09-08 05:18:01,342 INFO L87 Difference]: Start difference. First operand 1573 states and 2078 transitions. Second operand 17 states. [2019-09-08 05:18:03,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:18:03,828 INFO L93 Difference]: Finished difference Result 3460 states and 4588 transitions. [2019-09-08 05:18:03,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 05:18:03,828 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 183 [2019-09-08 05:18:03,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:18:03,845 INFO L225 Difference]: With dead ends: 3460 [2019-09-08 05:18:03,846 INFO L226 Difference]: Without dead ends: 2632 [2019-09-08 05:18:03,850 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=199, Invalid=1523, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 05:18:03,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2632 states. [2019-09-08 05:18:03,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2632 to 2613. [2019-09-08 05:18:03,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2613 states. [2019-09-08 05:18:04,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2613 states to 2613 states and 3486 transitions. [2019-09-08 05:18:04,007 INFO L78 Accepts]: Start accepts. Automaton has 2613 states and 3486 transitions. Word has length 183 [2019-09-08 05:18:04,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:18:04,008 INFO L475 AbstractCegarLoop]: Abstraction has 2613 states and 3486 transitions. [2019-09-08 05:18:04,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 05:18:04,008 INFO L276 IsEmpty]: Start isEmpty. Operand 2613 states and 3486 transitions. [2019-09-08 05:18:04,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-09-08 05:18:04,022 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:18:04,022 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:18:04,023 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:18:04,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:18:04,023 INFO L82 PathProgramCache]: Analyzing trace with hash -672583201, now seen corresponding path program 1 times [2019-09-08 05:18:04,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:18:04,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:18:04,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:18:04,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 05:18:04,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:18:04,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:18:04,563 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 24 proven. 14 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-09-08 05:18:04,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:18:04,564 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:18:04,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:18:05,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:18:05,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 3391 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:18:05,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:18:05,453 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-09-08 05:18:05,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:18:05,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [22] total 29 [2019-09-08 05:18:05,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-08 05:18:05,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-08 05:18:05,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=746, Unknown=0, NotChecked=0, Total=812 [2019-09-08 05:18:05,473 INFO L87 Difference]: Start difference. First operand 2613 states and 3486 transitions. Second operand 29 states. [2019-09-08 05:18:35,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:18:35,257 INFO L93 Difference]: Finished difference Result 16948 states and 22979 transitions. [2019-09-08 05:18:35,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-09-08 05:18:35,258 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 313 [2019-09-08 05:18:35,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:18:35,350 INFO L225 Difference]: With dead ends: 16948 [2019-09-08 05:18:35,350 INFO L226 Difference]: Without dead ends: 14323 [2019-09-08 05:18:35,375 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5967 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1453, Invalid=17453, Unknown=0, NotChecked=0, Total=18906 [2019-09-08 05:18:35,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14323 states. [2019-09-08 05:18:36,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14323 to 11635. [2019-09-08 05:18:36,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11635 states. [2019-09-08 05:18:36,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11635 states to 11635 states and 15761 transitions. [2019-09-08 05:18:36,222 INFO L78 Accepts]: Start accepts. Automaton has 11635 states and 15761 transitions. Word has length 313 [2019-09-08 05:18:36,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:18:36,223 INFO L475 AbstractCegarLoop]: Abstraction has 11635 states and 15761 transitions. [2019-09-08 05:18:36,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-08 05:18:36,223 INFO L276 IsEmpty]: Start isEmpty. Operand 11635 states and 15761 transitions. [2019-09-08 05:18:36,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-09-08 05:18:36,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:18:36,304 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:18:36,305 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:18:36,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:18:36,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1004484848, now seen corresponding path program 1 times [2019-09-08 05:18:36,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:18:36,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:18:36,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:18:36,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:18:36,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:18:36,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:18:36,997 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-09-08 05:18:36,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:18:36,998 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 05:18:37,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:18:37,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:18:37,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 3393 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:18:37,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:18:37,687 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-09-08 05:18:37,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:18:37,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [16] total 21 [2019-09-08 05:18:37,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 05:18:37,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 05:18:37,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2019-09-08 05:18:37,701 INFO L87 Difference]: Start difference. First operand 11635 states and 15761 transitions. Second operand 21 states. [2019-09-08 05:18:40,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:18:40,397 INFO L93 Difference]: Finished difference Result 24291 states and 33290 transitions. [2019-09-08 05:18:40,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 05:18:40,398 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 315 [2019-09-08 05:18:40,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:18:40,461 INFO L225 Difference]: With dead ends: 24291 [2019-09-08 05:18:40,461 INFO L226 Difference]: Without dead ends: 11915 [2019-09-08 05:18:40,507 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=1424, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 05:18:40,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11915 states. [2019-09-08 05:18:41,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11915 to 11419. [2019-09-08 05:18:41,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11419 states. [2019-09-08 05:18:41,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11419 states to 11419 states and 15284 transitions. [2019-09-08 05:18:41,089 INFO L78 Accepts]: Start accepts. Automaton has 11419 states and 15284 transitions. Word has length 315 [2019-09-08 05:18:41,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:18:41,091 INFO L475 AbstractCegarLoop]: Abstraction has 11419 states and 15284 transitions. [2019-09-08 05:18:41,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 05:18:41,091 INFO L276 IsEmpty]: Start isEmpty. Operand 11419 states and 15284 transitions. [2019-09-08 05:18:41,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-09-08 05:18:41,137 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:18:41,138 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:18:41,138 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:18:41,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:18:41,138 INFO L82 PathProgramCache]: Analyzing trace with hash 577301806, now seen corresponding path program 1 times [2019-09-08 05:18:41,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:18:41,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:18:41,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:18:41,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:18:41,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:18:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:18:41,393 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-09-08 05:18:41,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:18:41,394 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:18:41,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:18:42,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:18:42,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 3395 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:18:42,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:18:42,830 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-09-08 05:18:42,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:18:42,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2019-09-08 05:18:42,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:18:42,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:18:42,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:18:42,838 INFO L87 Difference]: Start difference. First operand 11419 states and 15284 transitions. Second operand 18 states. [2019-09-08 05:18:45,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:18:45,568 INFO L93 Difference]: Finished difference Result 23355 states and 31370 transitions. [2019-09-08 05:18:45,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 05:18:45,569 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 317 [2019-09-08 05:18:45,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:18:45,632 INFO L225 Difference]: With dead ends: 23355 [2019-09-08 05:18:45,632 INFO L226 Difference]: Without dead ends: 11739 [2019-09-08 05:18:45,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=915, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 05:18:45,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11739 states. [2019-09-08 05:18:46,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11739 to 11493. [2019-09-08 05:18:46,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11493 states. [2019-09-08 05:18:46,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11493 states to 11493 states and 15383 transitions. [2019-09-08 05:18:46,341 INFO L78 Accepts]: Start accepts. Automaton has 11493 states and 15383 transitions. Word has length 317 [2019-09-08 05:18:46,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:18:46,342 INFO L475 AbstractCegarLoop]: Abstraction has 11493 states and 15383 transitions. [2019-09-08 05:18:46,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 05:18:46,343 INFO L276 IsEmpty]: Start isEmpty. Operand 11493 states and 15383 transitions. [2019-09-08 05:18:46,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-09-08 05:18:46,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:18:46,403 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:18:46,403 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:18:46,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:18:46,404 INFO L82 PathProgramCache]: Analyzing trace with hash 35683902, now seen corresponding path program 1 times [2019-09-08 05:18:46,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:18:46,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:18:46,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:18:46,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:18:46,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:18:46,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:18:46,588 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-09-08 05:18:46,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:18:46,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:18:46,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:18:46,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:18:46,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:18:46,590 INFO L87 Difference]: Start difference. First operand 11493 states and 15383 transitions. Second operand 5 states. [2019-09-08 05:18:47,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:18:47,006 INFO L93 Difference]: Finished difference Result 21158 states and 27922 transitions. [2019-09-08 05:18:47,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 05:18:47,007 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 319 [2019-09-08 05:18:47,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:18:47,075 INFO L225 Difference]: With dead ends: 21158 [2019-09-08 05:18:47,076 INFO L226 Difference]: Without dead ends: 11439 [2019-09-08 05:18:47,106 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:18:47,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11439 states. [2019-09-08 05:18:47,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11439 to 11351. [2019-09-08 05:18:47,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11351 states. [2019-09-08 05:18:47,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11351 states to 11351 states and 15165 transitions. [2019-09-08 05:18:47,674 INFO L78 Accepts]: Start accepts. Automaton has 11351 states and 15165 transitions. Word has length 319 [2019-09-08 05:18:47,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:18:47,676 INFO L475 AbstractCegarLoop]: Abstraction has 11351 states and 15165 transitions. [2019-09-08 05:18:47,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:18:47,676 INFO L276 IsEmpty]: Start isEmpty. Operand 11351 states and 15165 transitions. [2019-09-08 05:18:47,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-09-08 05:18:47,728 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:18:47,729 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:18:47,729 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:18:47,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:18:47,730 INFO L82 PathProgramCache]: Analyzing trace with hash 104046584, now seen corresponding path program 1 times [2019-09-08 05:18:47,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:18:47,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:18:47,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:18:47,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:18:47,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:18:47,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:18:48,092 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-09-08 05:18:48,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:18:48,094 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:18:48,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:18:48,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:18:48,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 3397 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:18:48,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:18:48,741 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-09-08 05:18:48,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:18:48,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2019-09-08 05:18:48,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 05:18:48,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 05:18:48,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-08 05:18:48,752 INFO L87 Difference]: Start difference. First operand 11351 states and 15165 transitions. Second operand 12 states. [2019-09-08 05:18:53,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:18:53,848 INFO L93 Difference]: Finished difference Result 37199 states and 49866 transitions. [2019-09-08 05:18:53,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 05:18:53,848 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 319 [2019-09-08 05:18:53,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:18:53,965 INFO L225 Difference]: With dead ends: 37199 [2019-09-08 05:18:53,966 INFO L226 Difference]: Without dead ends: 25923 [2019-09-08 05:18:54,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2019-09-08 05:18:54,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25923 states. [2019-09-08 05:18:55,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25923 to 23717. [2019-09-08 05:18:55,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23717 states. [2019-09-08 05:18:55,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23717 states to 23717 states and 31697 transitions. [2019-09-08 05:18:55,201 INFO L78 Accepts]: Start accepts. Automaton has 23717 states and 31697 transitions. Word has length 319 [2019-09-08 05:18:55,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:18:55,202 INFO L475 AbstractCegarLoop]: Abstraction has 23717 states and 31697 transitions. [2019-09-08 05:18:55,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 05:18:55,202 INFO L276 IsEmpty]: Start isEmpty. Operand 23717 states and 31697 transitions. [2019-09-08 05:18:55,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-09-08 05:18:55,277 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:18:55,278 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:18:55,278 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:18:55,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:18:55,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1854049375, now seen corresponding path program 1 times [2019-09-08 05:18:55,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:18:55,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:18:55,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:18:55,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:18:55,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:18:55,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:18:55,730 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-09-08 05:18:55,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:18:55,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 05:18:55,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 05:18:55,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 05:18:55,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 05:18:55,732 INFO L87 Difference]: Start difference. First operand 23717 states and 31697 transitions. Second operand 9 states. [2019-09-08 05:19:03,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:19:03,469 INFO L93 Difference]: Finished difference Result 88628 states and 122790 transitions. [2019-09-08 05:19:03,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 05:19:03,469 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 319 [2019-09-08 05:19:03,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:19:03,842 INFO L225 Difference]: With dead ends: 88628 [2019-09-08 05:19:03,842 INFO L226 Difference]: Without dead ends: 68951 [2019-09-08 05:19:03,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2019-09-08 05:19:04,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68951 states. [2019-09-08 05:19:08,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68951 to 64133. [2019-09-08 05:19:08,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64133 states. [2019-09-08 05:19:08,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64133 states to 64133 states and 88697 transitions. [2019-09-08 05:19:08,260 INFO L78 Accepts]: Start accepts. Automaton has 64133 states and 88697 transitions. Word has length 319 [2019-09-08 05:19:08,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:19:08,261 INFO L475 AbstractCegarLoop]: Abstraction has 64133 states and 88697 transitions. [2019-09-08 05:19:08,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 05:19:08,261 INFO L276 IsEmpty]: Start isEmpty. Operand 64133 states and 88697 transitions. [2019-09-08 05:19:08,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-08 05:19:08,388 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:19:08,388 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:19:08,389 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:19:08,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:19:08,389 INFO L82 PathProgramCache]: Analyzing trace with hash 211998360, now seen corresponding path program 1 times [2019-09-08 05:19:08,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:19:08,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:19:08,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:19:08,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:19:08,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:19:08,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:19:08,923 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-09-08 05:19:08,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:19:08,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-08 05:19:08,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 05:19:08,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 05:19:08,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-09-08 05:19:08,926 INFO L87 Difference]: Start difference. First operand 64133 states and 88697 transitions. Second operand 24 states. [2019-09-08 05:19:13,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:19:13,103 INFO L93 Difference]: Finished difference Result 115054 states and 161836 transitions. [2019-09-08 05:19:13,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 05:19:13,103 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 320 [2019-09-08 05:19:13,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:19:13,316 INFO L225 Difference]: With dead ends: 115054 [2019-09-08 05:19:13,316 INFO L226 Difference]: Without dead ends: 50073 [2019-09-08 05:19:13,473 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 05:19:13,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50073 states. [2019-09-08 05:19:15,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50073 to 49461. [2019-09-08 05:19:15,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49461 states. [2019-09-08 05:19:15,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49461 states to 49461 states and 67099 transitions. [2019-09-08 05:19:15,572 INFO L78 Accepts]: Start accepts. Automaton has 49461 states and 67099 transitions. Word has length 320 [2019-09-08 05:19:15,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:19:15,573 INFO L475 AbstractCegarLoop]: Abstraction has 49461 states and 67099 transitions. [2019-09-08 05:19:15,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 05:19:15,574 INFO L276 IsEmpty]: Start isEmpty. Operand 49461 states and 67099 transitions. [2019-09-08 05:19:15,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-08 05:19:15,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:19:15,655 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:19:15,656 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:19:15,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:19:15,656 INFO L82 PathProgramCache]: Analyzing trace with hash -749783451, now seen corresponding path program 1 times [2019-09-08 05:19:15,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:19:15,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:19:15,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:19:15,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:19:15,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:19:15,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:19:15,880 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-09-08 05:19:15,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:19:15,881 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:19:15,905 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:19:16,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:19:16,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 3454 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:19:16,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:19:16,495 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-09-08 05:19:16,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:19:16,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2019-09-08 05:19:16,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 05:19:16,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 05:19:16,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-08 05:19:16,503 INFO L87 Difference]: Start difference. First operand 49461 states and 67099 transitions. Second operand 10 states. [2019-09-08 05:19:18,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:19:18,804 INFO L93 Difference]: Finished difference Result 74106 states and 100198 transitions. [2019-09-08 05:19:18,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 05:19:18,804 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 333 [2019-09-08 05:19:18,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:19:18,909 INFO L225 Difference]: With dead ends: 74106 [2019-09-08 05:19:18,909 INFO L226 Difference]: Without dead ends: 24710 [2019-09-08 05:19:18,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-09-08 05:19:19,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24710 states. [2019-09-08 05:19:19,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24710 to 24103. [2019-09-08 05:19:19,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24103 states. [2019-09-08 05:19:19,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24103 states to 24103 states and 32217 transitions. [2019-09-08 05:19:19,796 INFO L78 Accepts]: Start accepts. Automaton has 24103 states and 32217 transitions. Word has length 333 [2019-09-08 05:19:19,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:19:19,797 INFO L475 AbstractCegarLoop]: Abstraction has 24103 states and 32217 transitions. [2019-09-08 05:19:19,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 05:19:19,797 INFO L276 IsEmpty]: Start isEmpty. Operand 24103 states and 32217 transitions. [2019-09-08 05:19:19,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-08 05:19:19,833 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:19:19,834 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:19:19,834 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:19:19,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:19:19,835 INFO L82 PathProgramCache]: Analyzing trace with hash 324847960, now seen corresponding path program 1 times [2019-09-08 05:19:19,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:19:19,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:19:19,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:19:19,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:19:19,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:19:19,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:19:20,063 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-09-08 05:19:20,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:19:20,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 05:19:20,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 05:19:20,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 05:19:20,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 05:19:20,065 INFO L87 Difference]: Start difference. First operand 24103 states and 32217 transitions. Second operand 10 states. [2019-09-08 05:19:20,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:19:20,702 INFO L93 Difference]: Finished difference Result 33458 states and 44214 transitions. [2019-09-08 05:19:20,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 05:19:20,702 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 324 [2019-09-08 05:19:20,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:19:20,772 INFO L225 Difference]: With dead ends: 33458 [2019-09-08 05:19:20,772 INFO L226 Difference]: Without dead ends: 24223 [2019-09-08 05:19:20,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 05:19:20,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24223 states. [2019-09-08 05:19:22,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24223 to 24103. [2019-09-08 05:19:22,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24103 states. [2019-09-08 05:19:22,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24103 states to 24103 states and 32193 transitions. [2019-09-08 05:19:22,915 INFO L78 Accepts]: Start accepts. Automaton has 24103 states and 32193 transitions. Word has length 324 [2019-09-08 05:19:22,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:19:22,916 INFO L475 AbstractCegarLoop]: Abstraction has 24103 states and 32193 transitions. [2019-09-08 05:19:22,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 05:19:22,916 INFO L276 IsEmpty]: Start isEmpty. Operand 24103 states and 32193 transitions. [2019-09-08 05:19:22,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-09-08 05:19:22,949 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:19:22,950 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:19:22,950 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:19:22,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:19:22,950 INFO L82 PathProgramCache]: Analyzing trace with hash 390849979, now seen corresponding path program 1 times [2019-09-08 05:19:22,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:19:22,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:19:22,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:19:22,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:19:22,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:19:22,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:19:23,203 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-09-08 05:19:23,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:19:23,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 05:19:23,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 05:19:23,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 05:19:23,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-08 05:19:23,205 INFO L87 Difference]: Start difference. First operand 24103 states and 32193 transitions. Second operand 11 states. [2019-09-08 05:19:27,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:19:27,047 INFO L93 Difference]: Finished difference Result 38165 states and 49991 transitions. [2019-09-08 05:19:27,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 05:19:27,047 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 331 [2019-09-08 05:19:27,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:19:27,118 INFO L225 Difference]: With dead ends: 38165 [2019-09-08 05:19:27,119 INFO L226 Difference]: Without dead ends: 26812 [2019-09-08 05:19:27,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 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:19:27,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26812 states. [2019-09-08 05:19:28,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26812 to 19240. [2019-09-08 05:19:28,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19240 states. [2019-09-08 05:19:28,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19240 states to 19240 states and 25419 transitions. [2019-09-08 05:19:28,120 INFO L78 Accepts]: Start accepts. Automaton has 19240 states and 25419 transitions. Word has length 331 [2019-09-08 05:19:28,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:19:28,121 INFO L475 AbstractCegarLoop]: Abstraction has 19240 states and 25419 transitions. [2019-09-08 05:19:28,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 05:19:28,121 INFO L276 IsEmpty]: Start isEmpty. Operand 19240 states and 25419 transitions. [2019-09-08 05:19:28,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2019-09-08 05:19:28,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:19:28,170 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:19:28,170 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:19:28,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:19:28,171 INFO L82 PathProgramCache]: Analyzing trace with hash -659198415, now seen corresponding path program 1 times [2019-09-08 05:19:28,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:19:28,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:19:28,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:19:28,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:19:28,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:19:28,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:19:28,488 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-09-08 05:19:28,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:19:28,490 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) [2019-09-08 05:19:28,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:19:29,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:19:29,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 3871 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:19:29,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:19:29,245 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-09-08 05:19:29,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:19:29,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2019-09-08 05:19:29,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 05:19:29,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 05:19:29,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:19:29,256 INFO L87 Difference]: Start difference. First operand 19240 states and 25419 transitions. Second operand 13 states. [2019-09-08 05:19:37,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:19:37,499 INFO L93 Difference]: Finished difference Result 60915 states and 78686 transitions. [2019-09-08 05:19:37,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 05:19:37,500 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 452 [2019-09-08 05:19:37,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:19:37,644 INFO L225 Difference]: With dead ends: 60915 [2019-09-08 05:19:37,644 INFO L226 Difference]: Without dead ends: 41755 [2019-09-08 05:19:37,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 468 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=812, Unknown=0, NotChecked=0, Total=992 [2019-09-08 05:19:37,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41755 states. [2019-09-08 05:19:38,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41755 to 36039. [2019-09-08 05:19:38,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36039 states. [2019-09-08 05:19:38,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36039 states to 36039 states and 45726 transitions. [2019-09-08 05:19:38,830 INFO L78 Accepts]: Start accepts. Automaton has 36039 states and 45726 transitions. Word has length 452 [2019-09-08 05:19:38,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:19:38,831 INFO L475 AbstractCegarLoop]: Abstraction has 36039 states and 45726 transitions. [2019-09-08 05:19:38,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 05:19:38,831 INFO L276 IsEmpty]: Start isEmpty. Operand 36039 states and 45726 transitions. [2019-09-08 05:19:38,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2019-09-08 05:19:38,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:19:38,895 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:19:38,895 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:19:38,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:19:38,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1275353803, now seen corresponding path program 1 times [2019-09-08 05:19:38,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:19:38,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:19:38,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:19:38,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:19:38,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:19:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:19:39,208 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-09-08 05:19:39,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:19:39,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 05:19:39,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:19:39,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:19:39,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:19:39,210 INFO L87 Difference]: Start difference. First operand 36039 states and 45726 transitions. Second operand 7 states. [2019-09-08 05:19:43,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:19:43,182 INFO L93 Difference]: Finished difference Result 121333 states and 151948 transitions. [2019-09-08 05:19:43,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 05:19:43,182 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 422 [2019-09-08 05:19:43,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:19:43,508 INFO L225 Difference]: With dead ends: 121333 [2019-09-08 05:19:43,508 INFO L226 Difference]: Without dead ends: 96661 [2019-09-08 05:19:43,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-08 05:19:43,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96661 states. [2019-09-08 05:19:47,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96661 to 83066. [2019-09-08 05:19:47,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83066 states. [2019-09-08 05:19:47,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83066 states to 83066 states and 104008 transitions. [2019-09-08 05:19:47,824 INFO L78 Accepts]: Start accepts. Automaton has 83066 states and 104008 transitions. Word has length 422 [2019-09-08 05:19:47,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:19:47,825 INFO L475 AbstractCegarLoop]: Abstraction has 83066 states and 104008 transitions. [2019-09-08 05:19:47,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 05:19:47,826 INFO L276 IsEmpty]: Start isEmpty. Operand 83066 states and 104008 transitions. [2019-09-08 05:19:48,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2019-09-08 05:19:48,019 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:19:48,019 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:19:48,019 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:19:48,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:19:48,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1524084933, now seen corresponding path program 1 times [2019-09-08 05:19:48,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:19:48,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:19:48,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:19:48,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:19:48,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:19:48,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:19:48,873 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-09-08 05:19:48,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:19:48,873 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) [2019-09-08 05:19:48,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:19:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:19:49,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 3785 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 05:19:49,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:19:49,632 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-08 05:19:49,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:19:49,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 4] total 20 [2019-09-08 05:19:49,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 05:19:49,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 05:19:49,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2019-09-08 05:19:49,643 INFO L87 Difference]: Start difference. First operand 83066 states and 104008 transitions. Second operand 20 states. [2019-09-08 05:20:10,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:20:10,923 INFO L93 Difference]: Finished difference Result 132664 states and 166795 transitions. [2019-09-08 05:20:10,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-09-08 05:20:10,924 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 429 [2019-09-08 05:20:10,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:20:11,282 INFO L225 Difference]: With dead ends: 132664 [2019-09-08 05:20:11,283 INFO L226 Difference]: Without dead ends: 88408 [2019-09-08 05:20:11,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 461 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3581 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=831, Invalid=10511, Unknown=0, NotChecked=0, Total=11342 [2019-09-08 05:20:11,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88408 states. [2019-09-08 05:20:14,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88408 to 83618. [2019-09-08 05:20:14,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83618 states. [2019-09-08 05:20:14,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83618 states to 83618 states and 105033 transitions. [2019-09-08 05:20:14,291 INFO L78 Accepts]: Start accepts. Automaton has 83618 states and 105033 transitions. Word has length 429 [2019-09-08 05:20:14,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:20:14,292 INFO L475 AbstractCegarLoop]: Abstraction has 83618 states and 105033 transitions. [2019-09-08 05:20:14,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 05:20:14,292 INFO L276 IsEmpty]: Start isEmpty. Operand 83618 states and 105033 transitions. [2019-09-08 05:20:14,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2019-09-08 05:20:14,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:20:14,496 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:20:14,496 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:20:14,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:20:14,497 INFO L82 PathProgramCache]: Analyzing trace with hash 811861817, now seen corresponding path program 1 times [2019-09-08 05:20:14,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:20:14,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:20:14,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:14,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:20:14,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:20:14,742 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-09-08 05:20:14,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:20:14,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:20:14,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:20:14,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:20:14,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:20:14,745 INFO L87 Difference]: Start difference. First operand 83618 states and 105033 transitions. Second operand 3 states. [2019-09-08 05:20:17,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:20:17,421 INFO L93 Difference]: Finished difference Result 167626 states and 210852 transitions. [2019-09-08 05:20:17,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:20:17,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 438 [2019-09-08 05:20:17,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:20:17,711 INFO L225 Difference]: With dead ends: 167626 [2019-09-08 05:20:17,711 INFO L226 Difference]: Without dead ends: 84112 [2019-09-08 05:20:17,838 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:20:17,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84112 states. [2019-09-08 05:20:23,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84112 to 84106. [2019-09-08 05:20:23,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84106 states. [2019-09-08 05:20:23,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84106 states to 84106 states and 105922 transitions. [2019-09-08 05:20:23,609 INFO L78 Accepts]: Start accepts. Automaton has 84106 states and 105922 transitions. Word has length 438 [2019-09-08 05:20:23,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:20:23,610 INFO L475 AbstractCegarLoop]: Abstraction has 84106 states and 105922 transitions. [2019-09-08 05:20:23,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:20:23,610 INFO L276 IsEmpty]: Start isEmpty. Operand 84106 states and 105922 transitions. [2019-09-08 05:20:23,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2019-09-08 05:20:23,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:20:23,843 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:20:23,843 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:20:23,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:20:23,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1619024876, now seen corresponding path program 1 times [2019-09-08 05:20:23,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:20:23,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:20:23,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:23,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:20:23,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:20:24,107 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-09-08 05:20:24,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:20:24,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:20:24,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:20:24,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:20:24,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:20:24,109 INFO L87 Difference]: Start difference. First operand 84106 states and 105922 transitions. Second operand 6 states. [2019-09-08 05:20:26,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:20:26,266 INFO L93 Difference]: Finished difference Result 168061 states and 211641 transitions. [2019-09-08 05:20:26,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:20:26,266 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 439 [2019-09-08 05:20:26,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:20:26,523 INFO L225 Difference]: With dead ends: 168061 [2019-09-08 05:20:26,524 INFO L226 Difference]: Without dead ends: 84112 [2019-09-08 05:20:26,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:20:26,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84112 states. [2019-09-08 05:20:29,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84112 to 84106. [2019-09-08 05:20:29,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84106 states. [2019-09-08 05:20:29,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84106 states to 84106 states and 105910 transitions. [2019-09-08 05:20:29,489 INFO L78 Accepts]: Start accepts. Automaton has 84106 states and 105910 transitions. Word has length 439 [2019-09-08 05:20:29,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:20:29,489 INFO L475 AbstractCegarLoop]: Abstraction has 84106 states and 105910 transitions. [2019-09-08 05:20:29,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:20:29,489 INFO L276 IsEmpty]: Start isEmpty. Operand 84106 states and 105910 transitions. [2019-09-08 05:20:29,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2019-09-08 05:20:29,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:20:29,659 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:20:29,659 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:20:29,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:20:29,660 INFO L82 PathProgramCache]: Analyzing trace with hash 410030318, now seen corresponding path program 1 times [2019-09-08 05:20:29,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:20:29,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:20:29,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:29,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:20:29,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:29,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:20:29,891 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-09-08 05:20:29,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:20:29,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:20:29,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:20:29,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:20:29,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:20:29,894 INFO L87 Difference]: Start difference. First operand 84106 states and 105910 transitions. Second operand 3 states. [2019-09-08 05:20:33,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:20:33,772 INFO L93 Difference]: Finished difference Result 169022 states and 213378 transitions. [2019-09-08 05:20:33,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:20:33,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 430 [2019-09-08 05:20:33,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:20:34,179 INFO L225 Difference]: With dead ends: 169022 [2019-09-08 05:20:34,179 INFO L226 Difference]: Without dead ends: 85026 [2019-09-08 05:20:34,380 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:20:34,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85026 states. [2019-09-08 05:20:36,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85026 to 85020. [2019-09-08 05:20:36,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85020 states. [2019-09-08 05:20:37,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85020 states to 85020 states and 107567 transitions. [2019-09-08 05:20:37,141 INFO L78 Accepts]: Start accepts. Automaton has 85020 states and 107567 transitions. Word has length 430 [2019-09-08 05:20:37,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:20:37,142 INFO L475 AbstractCegarLoop]: Abstraction has 85020 states and 107567 transitions. [2019-09-08 05:20:37,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:20:37,142 INFO L276 IsEmpty]: Start isEmpty. Operand 85020 states and 107567 transitions. [2019-09-08 05:20:37,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2019-09-08 05:20:37,289 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:20:37,289 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:20:37,290 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:20:37,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:20:37,290 INFO L82 PathProgramCache]: Analyzing trace with hash -2118046256, now seen corresponding path program 1 times [2019-09-08 05:20:37,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:20:37,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:20:37,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:37,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:20:37,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:37,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:20:38,043 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-09-08 05:20:38,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:20:38,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:20:38,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:20:38,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:20:38,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:20:38,044 INFO L87 Difference]: Start difference. First operand 85020 states and 107567 transitions. Second operand 3 states. [2019-09-08 05:20:42,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:20:42,474 INFO L93 Difference]: Finished difference Result 171686 states and 218172 transitions. [2019-09-08 05:20:42,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:20:42,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 433 [2019-09-08 05:20:42,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:20:42,677 INFO L225 Difference]: With dead ends: 171686 [2019-09-08 05:20:42,677 INFO L226 Difference]: Without dead ends: 86784 [2019-09-08 05:20:42,765 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:20:42,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86784 states. [2019-09-08 05:20:45,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86784 to 86778. [2019-09-08 05:20:45,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86778 states. [2019-09-08 05:20:45,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86778 states to 86778 states and 110692 transitions. [2019-09-08 05:20:45,529 INFO L78 Accepts]: Start accepts. Automaton has 86778 states and 110692 transitions. Word has length 433 [2019-09-08 05:20:45,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:20:45,529 INFO L475 AbstractCegarLoop]: Abstraction has 86778 states and 110692 transitions. [2019-09-08 05:20:45,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:20:45,529 INFO L276 IsEmpty]: Start isEmpty. Operand 86778 states and 110692 transitions. [2019-09-08 05:20:45,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2019-09-08 05:20:45,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:20:45,682 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:20:45,682 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:20:45,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:20:45,683 INFO L82 PathProgramCache]: Analyzing trace with hash 92778191, now seen corresponding path program 1 times [2019-09-08 05:20:45,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:20:45,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:20:45,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:45,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:20:45,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:20:45,865 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-09-08 05:20:45,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:20:45,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:20:45,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:20:45,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:20:45,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:20:45,866 INFO L87 Difference]: Start difference. First operand 86778 states and 110692 transitions. Second operand 3 states. [2019-09-08 05:20:48,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:20:48,630 INFO L93 Difference]: Finished difference Result 176798 states and 227238 transitions. [2019-09-08 05:20:48,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:20:48,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 440 [2019-09-08 05:20:48,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:20:48,872 INFO L225 Difference]: With dead ends: 176798 [2019-09-08 05:20:48,872 INFO L226 Difference]: Without dead ends: 90150 [2019-09-08 05:20:48,970 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:20:49,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90150 states. [2019-09-08 05:20:54,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90150 to 90144. [2019-09-08 05:20:54,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90144 states. [2019-09-08 05:20:54,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90144 states to 90144 states and 116601 transitions. [2019-09-08 05:20:54,843 INFO L78 Accepts]: Start accepts. Automaton has 90144 states and 116601 transitions. Word has length 440 [2019-09-08 05:20:54,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:20:54,843 INFO L475 AbstractCegarLoop]: Abstraction has 90144 states and 116601 transitions. [2019-09-08 05:20:54,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:20:54,843 INFO L276 IsEmpty]: Start isEmpty. Operand 90144 states and 116601 transitions. [2019-09-08 05:20:54,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2019-09-08 05:20:54,985 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:20:54,985 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:20:54,985 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:20:54,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:20:54,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1393393311, now seen corresponding path program 1 times [2019-09-08 05:20:54,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:20:54,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:20:54,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:54,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:20:54,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:55,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:20:55,173 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-09-08 05:20:55,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:20:55,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:20:55,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:20:55,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:20:55,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:20:55,175 INFO L87 Difference]: Start difference. First operand 90144 states and 116601 transitions. Second operand 3 states. [2019-09-08 05:20:57,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:20:57,844 INFO L93 Difference]: Finished difference Result 186585 states and 244460 transitions. [2019-09-08 05:20:57,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:20:57,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 433 [2019-09-08 05:20:57,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:20:58,115 INFO L225 Difference]: With dead ends: 186585 [2019-09-08 05:20:58,116 INFO L226 Difference]: Without dead ends: 96584 [2019-09-08 05:20:58,234 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:20:58,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96584 states. [2019-09-08 05:21:01,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96584 to 96578. [2019-09-08 05:21:01,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96578 states. [2019-09-08 05:21:05,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96578 states to 96578 states and 127834 transitions. [2019-09-08 05:21:05,862 INFO L78 Accepts]: Start accepts. Automaton has 96578 states and 127834 transitions. Word has length 433 [2019-09-08 05:21:05,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:21:05,863 INFO L475 AbstractCegarLoop]: Abstraction has 96578 states and 127834 transitions. [2019-09-08 05:21:05,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:21:05,863 INFO L276 IsEmpty]: Start isEmpty. Operand 96578 states and 127834 transitions. [2019-09-08 05:21:06,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2019-09-08 05:21:06,051 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:21:06,052 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:21:06,052 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:21:06,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:21:06,053 INFO L82 PathProgramCache]: Analyzing trace with hash 779631767, now seen corresponding path program 1 times [2019-09-08 05:21:06,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:21:06,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:21:06,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:21:06,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:21:06,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:21:06,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:21:06,342 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-09-08 05:21:06,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:21:06,342 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:21:06,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:21:06,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:21:06,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 3849 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 05:21:06,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:21:07,152 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 05:21:07,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:21:07,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 14 [2019-09-08 05:21:07,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 05:21:07,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 05:21:07,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-09-08 05:21:07,177 INFO L87 Difference]: Start difference. First operand 96578 states and 127834 transitions. Second operand 14 states. [2019-09-08 05:21:10,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:21:10,428 INFO L93 Difference]: Finished difference Result 180617 states and 234360 transitions. [2019-09-08 05:21:10,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 05:21:10,430 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 446 [2019-09-08 05:21:10,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:21:10,720 INFO L225 Difference]: With dead ends: 180617 [2019-09-08 05:21:10,720 INFO L226 Difference]: Without dead ends: 98125 [2019-09-08 05:21:10,844 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 444 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:21:10,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98125 states. [2019-09-08 05:21:14,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98125 to 97705. [2019-09-08 05:21:14,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97705 states. [2019-09-08 05:21:14,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97705 states to 97705 states and 129698 transitions. [2019-09-08 05:21:14,905 INFO L78 Accepts]: Start accepts. Automaton has 97705 states and 129698 transitions. Word has length 446 [2019-09-08 05:21:14,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:21:14,905 INFO L475 AbstractCegarLoop]: Abstraction has 97705 states and 129698 transitions. [2019-09-08 05:21:14,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 05:21:14,906 INFO L276 IsEmpty]: Start isEmpty. Operand 97705 states and 129698 transitions. [2019-09-08 05:21:15,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2019-09-08 05:21:15,098 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:21:15,098 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:21:15,098 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:21:15,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:21:15,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1021891350, now seen corresponding path program 1 times [2019-09-08 05:21:15,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:21:15,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:21:15,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:21:15,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:21:15,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:21:15,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:21:15,802 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-09-08 05:21:15,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:21:15,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:21:15,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:21:15,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:21:15,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:21:15,804 INFO L87 Difference]: Start difference. First operand 97705 states and 129698 transitions. Second operand 3 states. [2019-09-08 05:21:18,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:21:18,934 INFO L93 Difference]: Finished difference Result 207185 states and 280449 transitions. [2019-09-08 05:21:18,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:21:18,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 441 [2019-09-08 05:21:18,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:21:19,197 INFO L225 Difference]: With dead ends: 207185 [2019-09-08 05:21:19,198 INFO L226 Difference]: Without dead ends: 110084 [2019-09-08 05:21:19,311 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:21:19,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110084 states. [2019-09-08 05:21:27,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110084 to 110078. [2019-09-08 05:21:27,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110078 states. [2019-09-08 05:21:28,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110078 states to 110078 states and 151207 transitions. [2019-09-08 05:21:28,125 INFO L78 Accepts]: Start accepts. Automaton has 110078 states and 151207 transitions. Word has length 441 [2019-09-08 05:21:28,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:21:28,126 INFO L475 AbstractCegarLoop]: Abstraction has 110078 states and 151207 transitions. [2019-09-08 05:21:28,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:21:28,126 INFO L276 IsEmpty]: Start isEmpty. Operand 110078 states and 151207 transitions. [2019-09-08 05:21:28,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2019-09-08 05:21:28,404 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:21:28,404 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:21:28,404 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:21:28,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:21:28,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1827484095, now seen corresponding path program 1 times [2019-09-08 05:21:28,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:21:28,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:21:28,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:21:28,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:21:28,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:21:28,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:21:28,594 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-09-08 05:21:28,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:21:28,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:21:28,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:21:28,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:21:28,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:21:28,595 INFO L87 Difference]: Start difference. First operand 110078 states and 151207 transitions. Second operand 3 states. [2019-09-08 05:21:32,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:21:32,785 INFO L93 Difference]: Finished difference Result 244514 states and 345134 transitions. [2019-09-08 05:21:32,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:21:32,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 435 [2019-09-08 05:21:32,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:21:33,200 INFO L225 Difference]: With dead ends: 244514 [2019-09-08 05:21:33,200 INFO L226 Difference]: Without dead ends: 135133 [2019-09-08 05:21:33,380 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:21:33,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135133 states. [2019-09-08 05:21:42,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135133 to 135127. [2019-09-08 05:21:42,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135127 states. [2019-09-08 05:21:43,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135127 states to 135127 states and 194127 transitions. [2019-09-08 05:21:43,093 INFO L78 Accepts]: Start accepts. Automaton has 135127 states and 194127 transitions. Word has length 435 [2019-09-08 05:21:43,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:21:43,094 INFO L475 AbstractCegarLoop]: Abstraction has 135127 states and 194127 transitions. [2019-09-08 05:21:43,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:21:43,094 INFO L276 IsEmpty]: Start isEmpty. Operand 135127 states and 194127 transitions. [2019-09-08 05:21:43,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2019-09-08 05:21:43,513 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:21:43,513 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:21:43,513 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:21:43,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:21:43,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1357920058, now seen corresponding path program 1 times [2019-09-08 05:21:43,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:21:43,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:21:43,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:21:43,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:21:43,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:21:43,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:21:43,743 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-09-08 05:21:43,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:21:43,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:21:43,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:21:43,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:21:43,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:21:43,745 INFO L87 Difference]: Start difference. First operand 135127 states and 194127 transitions. Second operand 3 states. [2019-09-08 05:21:50,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:21:50,891 INFO L93 Difference]: Finished difference Result 315681 states and 466022 transitions. [2019-09-08 05:21:50,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:21:50,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 437 [2019-09-08 05:21:50,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:21:51,401 INFO L225 Difference]: With dead ends: 315681 [2019-09-08 05:21:51,401 INFO L226 Difference]: Without dead ends: 181402 [2019-09-08 05:21:51,574 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:21:51,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181402 states. [2019-09-08 05:22:04,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181402 to 181396. [2019-09-08 05:22:04,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181396 states. [2019-09-08 05:22:05,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181396 states to 181396 states and 271558 transitions. [2019-09-08 05:22:05,095 INFO L78 Accepts]: Start accepts. Automaton has 181396 states and 271558 transitions. Word has length 437 [2019-09-08 05:22:05,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:22:05,095 INFO L475 AbstractCegarLoop]: Abstraction has 181396 states and 271558 transitions. [2019-09-08 05:22:05,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:22:05,095 INFO L276 IsEmpty]: Start isEmpty. Operand 181396 states and 271558 transitions. [2019-09-08 05:22:05,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2019-09-08 05:22:05,663 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:22:05,664 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:22:05,664 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:22:05,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:22:05,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1684197277, now seen corresponding path program 1 times [2019-09-08 05:22:05,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:22:05,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:22:05,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:05,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:22:05,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:05,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:22:06,640 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-09-08 05:22:06,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:22:06,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:22:06,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:22:06,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:22:06,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:22:06,652 INFO L87 Difference]: Start difference. First operand 181396 states and 271558 transitions. Second operand 3 states. [2019-09-08 05:22:21,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:22:21,263 INFO L93 Difference]: Finished difference Result 449358 states and 691444 transitions. [2019-09-08 05:22:21,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:22:21,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 437 [2019-09-08 05:22:21,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:22:22,164 INFO L225 Difference]: With dead ends: 449358 [2019-09-08 05:22:22,165 INFO L226 Difference]: Without dead ends: 269049 [2019-09-08 05:22:23,120 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:22:23,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269049 states. [2019-09-08 05:22:45,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269049 to 269043. [2019-09-08 05:22:45,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269043 states. [2019-09-08 05:22:46,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269043 states to 269043 states and 418349 transitions. [2019-09-08 05:22:46,543 INFO L78 Accepts]: Start accepts. Automaton has 269043 states and 418349 transitions. Word has length 437 [2019-09-08 05:22:46,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:22:46,544 INFO L475 AbstractCegarLoop]: Abstraction has 269043 states and 418349 transitions. [2019-09-08 05:22:46,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:22:46,544 INFO L276 IsEmpty]: Start isEmpty. Operand 269043 states and 418349 transitions. [2019-09-08 05:22:48,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2019-09-08 05:22:48,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:22:48,497 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:22:48,497 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:22:48,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:22:48,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1701223382, now seen corresponding path program 1 times [2019-09-08 05:22:48,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:22:48,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:22:48,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:48,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:22:48,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:48,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:22:48,684 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-09-08 05:22:48,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:22:48,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:22:48,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:22:48,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:22:48,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:22:48,687 INFO L87 Difference]: Start difference. First operand 269043 states and 418349 transitions. Second operand 3 states. [2019-09-08 05:23:06,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:23:06,404 INFO L93 Difference]: Finished difference Result 516085 states and 794473 transitions. [2019-09-08 05:23:06,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:23:06,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 440 [2019-09-08 05:23:06,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:23:07,895 INFO L225 Difference]: With dead ends: 516085 [2019-09-08 05:23:07,896 INFO L226 Difference]: Without dead ends: 433614 [2019-09-08 05:23:08,097 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:23:08,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433614 states. [2019-09-08 05:23:53,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433614 to 433608. [2019-09-08 05:23:53,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433608 states. [2019-09-08 05:23:54,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433608 states to 433608 states and 685007 transitions. [2019-09-08 05:23:54,678 INFO L78 Accepts]: Start accepts. Automaton has 433608 states and 685007 transitions. Word has length 440 [2019-09-08 05:23:54,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:23:54,678 INFO L475 AbstractCegarLoop]: Abstraction has 433608 states and 685007 transitions. [2019-09-08 05:23:54,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:23:54,678 INFO L276 IsEmpty]: Start isEmpty. Operand 433608 states and 685007 transitions. [2019-09-08 05:23:57,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2019-09-08 05:23:57,948 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:23:57,948 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:23:57,948 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:23:57,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:23:57,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1235941126, now seen corresponding path program 1 times [2019-09-08 05:23:57,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:23:57,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:23:57,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:23:57,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:23:57,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:23:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:23:58,226 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2019-09-08 05:23:58,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:23:58,227 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:23:58,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:23:58,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:23:58,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 3835 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-08 05:23:58,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:23:59,597 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 32 proven. 6 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Stream closed [2019-09-08 05:23:59,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:23:59,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2019-09-08 05:23:59,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:23:59,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:23:59,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:23:59,616 INFO L87 Difference]: Start difference. First operand 433608 states and 685007 transitions. Second operand 18 states. [2019-09-08 05:25:20,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:25:20,717 INFO L93 Difference]: Finished difference Result 1219579 states and 1990720 transitions. [2019-09-08 05:25:20,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 05:25:20,718 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 440 [2019-09-08 05:25:20,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:25:25,628 INFO L225 Difference]: With dead ends: 1219579 [2019-09-08 05:25:25,628 INFO L226 Difference]: Without dead ends: 1187090 [2019-09-08 05:25:26,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 442 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=215, Invalid=1765, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 05:25:27,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187090 states. [2019-09-08 05:26:53,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187090 to 842643. [2019-09-08 05:26:53,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 842643 states.