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_spec7_product32.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 05:35:59,062 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 05:35:59,064 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 05:35:59,077 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 05:35:59,078 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 05:35:59,079 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 05:35:59,080 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 05:35:59,082 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 05:35:59,083 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 05:35:59,084 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 05:35:59,085 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 05:35:59,086 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 05:35:59,087 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 05:35:59,087 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 05:35:59,088 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 05:35:59,089 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 05:35:59,090 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 05:35:59,091 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 05:35:59,093 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 05:35:59,095 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 05:35:59,097 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 05:35:59,098 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 05:35:59,099 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 05:35:59,100 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 05:35:59,102 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 05:35:59,102 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 05:35:59,103 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 05:35:59,104 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 05:35:59,104 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 05:35:59,105 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 05:35:59,105 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 05:35:59,106 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 05:35:59,107 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 05:35:59,108 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 05:35:59,109 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 05:35:59,109 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 05:35:59,110 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 05:35:59,110 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 05:35:59,110 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 05:35:59,111 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 05:35:59,112 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 05:35:59,113 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:35:59,132 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 05:35:59,132 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 05:35:59,135 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 05:35:59,135 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 05:35:59,135 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 05:35:59,135 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 05:35:59,136 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 05:35:59,136 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 05:35:59,136 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 05:35:59,136 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 05:35:59,136 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 05:35:59,136 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 05:35:59,137 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 05:35:59,137 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 05:35:59,137 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 05:35:59,137 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 05:35:59,137 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 05:35:59,138 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 05:35:59,138 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 05:35:59,138 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 05:35:59,138 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 05:35:59,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 05:35:59,139 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 05:35:59,139 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 05:35:59,139 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 05:35:59,139 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 05:35:59,139 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 05:35:59,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 05:35:59,140 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 05:35:59,185 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 05:35:59,198 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 05:35:59,202 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 05:35:59,203 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 05:35:59,204 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 05:35:59,204 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec7_product32.cil.c [2019-09-08 05:35:59,269 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b97d61e34/555a271f3ba942efbf180cdaca376dc0/FLAGe862cfe25 [2019-09-08 05:35:59,924 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 05:35:59,926 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec7_product32.cil.c [2019-09-08 05:35:59,947 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b97d61e34/555a271f3ba942efbf180cdaca376dc0/FLAGe862cfe25 [2019-09-08 05:36:00,153 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b97d61e34/555a271f3ba942efbf180cdaca376dc0 [2019-09-08 05:36:00,168 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 05:36:00,169 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 05:36:00,171 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 05:36:00,171 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 05:36:00,175 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 05:36:00,176 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:36:00" (1/1) ... [2019-09-08 05:36:00,179 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38be0d47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:36:00, skipping insertion in model container [2019-09-08 05:36:00,180 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:36:00" (1/1) ... [2019-09-08 05:36:00,188 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 05:36:00,276 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 05:36:01,175 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:36:01,206 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 05:36:01,410 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:36:01,538 INFO L192 MainTranslator]: Completed translation [2019-09-08 05:36:01,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:36:01 WrapperNode [2019-09-08 05:36:01,539 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 05:36:01,540 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 05:36:01,540 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 05:36:01,541 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 05:36:01,557 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:36:01" (1/1) ... [2019-09-08 05:36:01,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:36:01" (1/1) ... [2019-09-08 05:36:01,625 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:36:01" (1/1) ... [2019-09-08 05:36:01,626 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:36:01" (1/1) ... [2019-09-08 05:36:01,712 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:36:01" (1/1) ... [2019-09-08 05:36:01,745 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:36:01" (1/1) ... [2019-09-08 05:36:01,765 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:36:01" (1/1) ... [2019-09-08 05:36:01,794 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 05:36:01,795 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 05:36:01,795 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 05:36:01,795 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 05:36:01,796 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:36:01" (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:36:01,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 05:36:01,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 05:36:01,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 05:36:01,872 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-08 05:36:01,873 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AddressBook [2019-09-08 05:36:01,873 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Sign [2019-09-08 05:36:01,874 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-08 05:36:01,874 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-08 05:36:01,874 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-08 05:36:01,874 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-08 05:36:01,875 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-08 05:36:01,875 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-08 05:36:01,876 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 05:36:01,876 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 05:36:01,877 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 05:36:01,877 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 05:36:01,879 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 05:36:01,879 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-08 05:36:01,880 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-08 05:36:01,880 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-09-08 05:36:01,880 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AddressBook [2019-09-08 05:36:01,880 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-08 05:36:01,880 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-08 05:36:01,881 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-09-08 05:36:01,881 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-09-08 05:36:01,881 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-09-08 05:36:01,881 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-08 05:36:01,881 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-08 05:36:01,882 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-08 05:36:01,882 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-08 05:36:01,882 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-08 05:36:01,882 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-08 05:36:01,882 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-08 05:36:01,882 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-08 05:36:01,883 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-08 05:36:01,883 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-09-08 05:36:01,883 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-09-08 05:36:01,883 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-09-08 05:36:01,883 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-09-08 05:36:01,883 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptVerify_spec__1 [2019-09-08 05:36:01,884 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-08 05:36:01,884 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-08 05:36:01,884 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-08 05:36:01,885 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-08 05:36:01,885 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-08 05:36:01,885 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-08 05:36:01,885 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-08 05:36:01,886 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-08 05:36:01,886 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-08 05:36:01,886 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-08 05:36:01,886 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-08 05:36:01,886 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-08 05:36:01,886 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-08 05:36:01,887 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-08 05:36:01,887 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-08 05:36:01,887 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-08 05:36:01,887 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-08 05:36:01,887 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-08 05:36:01,887 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-08 05:36:01,887 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-08 05:36:01,888 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-08 05:36:01,888 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 05:36:01,888 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 05:36:01,888 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 05:36:01,888 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 05:36:01,888 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 05:36:01,888 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 05:36:01,889 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 05:36:01,889 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-08 05:36:01,889 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-08 05:36:01,889 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-08 05:36:01,890 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-08 05:36:01,890 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-08 05:36:01,890 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-08 05:36:01,891 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-08 05:36:01,891 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-08 05:36:01,891 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-08 05:36:01,891 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-08 05:36:01,891 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-08 05:36:01,891 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-08 05:36:01,892 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-08 05:36:01,892 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-08 05:36:01,892 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-08 05:36:01,893 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-08 05:36:01,893 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-08 05:36:01,893 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-08 05:36:01,893 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-08 05:36:01,894 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-08 05:36:01,894 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-08 05:36:01,894 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-08 05:36:01,895 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-08 05:36:01,895 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-08 05:36:01,895 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-08 05:36:01,895 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-08 05:36:01,895 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-08 05:36:01,896 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-08 05:36:01,896 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-08 05:36:01,896 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-08 05:36:01,896 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-08 05:36:01,896 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-08 05:36:01,896 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-08 05:36:01,896 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-08 05:36:01,897 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-08 05:36:01,897 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-08 05:36:01,897 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-08 05:36:01,897 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 05:36:01,897 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 05:36:01,897 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-08 05:36:01,897 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-08 05:36:01,898 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-08 05:36:01,898 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-08 05:36:01,898 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-08 05:36:01,898 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-08 05:36:01,898 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-08 05:36:01,898 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-08 05:36:01,898 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-08 05:36:01,899 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-09-08 05:36:01,899 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-09-08 05:36:01,899 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 05:36:01,900 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 05:36:01,900 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 05:36:01,900 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-08 05:36:01,900 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-08 05:36:01,901 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-08 05:36:01,902 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-08 05:36:01,902 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-08 05:36:01,902 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-08 05:36:01,902 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-08 05:36:01,902 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-08 05:36:01,902 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-08 05:36:01,903 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-08 05:36:01,903 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-08 05:36:01,903 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-08 05:36:01,903 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-08 05:36:01,904 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-08 05:36:01,907 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-08 05:36:01,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 05:36:01,907 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AddressBook [2019-09-08 05:36:01,908 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Sign [2019-09-08 05:36:01,908 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-08 05:36:01,911 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-08 05:36:01,912 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 05:36:01,912 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 05:36:01,913 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 05:36:01,918 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 05:36:01,919 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 05:36:01,919 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-08 05:36:01,919 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-08 05:36:01,919 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-08 05:36:01,920 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-08 05:36:01,920 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-08 05:36:01,920 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-08 05:36:01,920 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-08 05:36:01,920 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-08 05:36:01,921 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-08 05:36:01,921 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-08 05:36:01,921 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-08 05:36:01,921 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-08 05:36:01,921 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-08 05:36:01,921 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-08 05:36:01,921 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-08 05:36:01,921 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-08 05:36:01,922 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-08 05:36:01,922 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-08 05:36:01,922 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-08 05:36:01,922 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-08 05:36:01,922 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-08 05:36:01,922 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-08 05:36:01,922 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-08 05:36:01,922 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-08 05:36:01,923 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-08 05:36:01,923 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-08 05:36:01,923 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-09-08 05:36:01,923 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-09-08 05:36:01,923 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-09-08 05:36:01,923 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-09-08 05:36:01,923 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-08 05:36:01,924 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-09-08 05:36:01,924 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AddressBook [2019-09-08 05:36:01,924 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-09-08 05:36:01,924 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-09-08 05:36:01,924 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-09-08 05:36:01,924 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptVerify_spec__1 [2019-09-08 05:36:01,924 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-08 05:36:01,924 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-08 05:36:01,925 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-08 05:36:01,925 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-08 05:36:01,925 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-08 05:36:01,925 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-08 05:36:01,925 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 05:36:01,925 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 05:36:01,925 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 05:36:01,925 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 05:36:01,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 05:36:01,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 05:36:01,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 05:36:01,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 05:36:01,926 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 05:36:01,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 05:36:01,926 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 05:36:01,927 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 05:36:01,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 05:36:01,927 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 05:36:01,927 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 05:36:01,927 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 05:36:01,927 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-08 05:36:01,927 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-09-08 05:36:01,927 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-08 05:36:01,928 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-08 05:36:01,928 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-08 05:36:01,928 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-08 05:36:01,928 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-09-08 05:36:01,928 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-08 05:36:01,928 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-08 05:36:01,928 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-08 05:36:01,928 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 05:36:01,929 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-08 05:36:01,929 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-08 05:36:01,929 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-08 05:36:01,929 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-08 05:36:01,929 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-08 05:36:01,929 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-08 05:36:01,929 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-08 05:36:01,929 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-08 05:36:01,930 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-08 05:36:01,930 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-08 05:36:01,930 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-08 05:36:01,930 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-08 05:36:01,930 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-08 05:36:01,930 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-08 05:36:01,930 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-08 05:36:01,931 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-08 05:36:01,931 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-08 05:36:01,931 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-08 05:36:01,931 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-08 05:36:01,931 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-08 05:36:01,931 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-08 05:36:01,932 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-08 05:36:01,932 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-08 05:36:01,932 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-08 05:36:01,932 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-08 05:36:01,932 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 05:36:01,932 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 05:36:01,933 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-08 05:36:01,933 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-08 05:36:01,933 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-08 05:36:01,933 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-08 05:36:01,933 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-08 05:36:01,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 05:36:01,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 05:36:01,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 05:36:04,091 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 05:36:04,091 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 05:36:04,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:36:04 BoogieIcfgContainer [2019-09-08 05:36:04,093 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 05:36:04,095 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 05:36:04,095 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 05:36:04,098 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 05:36:04,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 05:36:00" (1/3) ... [2019-09-08 05:36:04,100 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d89d2f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:36:04, skipping insertion in model container [2019-09-08 05:36:04,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:36:01" (2/3) ... [2019-09-08 05:36:04,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d89d2f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:36:04, skipping insertion in model container [2019-09-08 05:36:04,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:36:04" (3/3) ... [2019-09-08 05:36:04,103 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec7_product32.cil.c [2019-09-08 05:36:04,114 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 05:36:04,128 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 05:36:04,149 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 05:36:04,206 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 05:36:04,207 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 05:36:04,207 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 05:36:04,207 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 05:36:04,208 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 05:36:04,212 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 05:36:04,212 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 05:36:04,212 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 05:36:04,212 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 05:36:04,262 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states. [2019-09-08 05:36:04,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-08 05:36:04,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:04,304 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-08 05:36:04,307 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:04,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:04,314 INFO L82 PathProgramCache]: Analyzing trace with hash -311164788, now seen corresponding path program 1 times [2019-09-08 05:36:04,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:04,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:04,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:04,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:04,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:04,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:05,119 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 05:36:05,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:05,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 05:36:05,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 05:36:05,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 05:36:05,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 05:36:05,145 INFO L87 Difference]: Start difference. First operand 633 states. Second operand 2 states. [2019-09-08 05:36:05,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:05,245 INFO L93 Difference]: Finished difference Result 896 states and 1218 transitions. [2019-09-08 05:36:05,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 05:36:05,247 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 191 [2019-09-08 05:36:05,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:05,287 INFO L225 Difference]: With dead ends: 896 [2019-09-08 05:36:05,288 INFO L226 Difference]: Without dead ends: 576 [2019-09-08 05:36:05,300 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:36:05,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-09-08 05:36:05,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2019-09-08 05:36:05,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-09-08 05:36:05,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 786 transitions. [2019-09-08 05:36:05,460 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 786 transitions. Word has length 191 [2019-09-08 05:36:05,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:05,462 INFO L475 AbstractCegarLoop]: Abstraction has 576 states and 786 transitions. [2019-09-08 05:36:05,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 05:36:05,463 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 786 transitions. [2019-09-08 05:36:05,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-08 05:36:05,469 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:05,469 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-08 05:36:05,469 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:05,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:05,470 INFO L82 PathProgramCache]: Analyzing trace with hash 544104814, now seen corresponding path program 1 times [2019-09-08 05:36:05,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:05,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:05,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:05,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:05,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:05,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:05,759 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 05:36:05,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:05,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:36:05,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:36:05,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:36:05,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:36:05,769 INFO L87 Difference]: Start difference. First operand 576 states and 786 transitions. Second operand 3 states. [2019-09-08 05:36:05,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:05,828 INFO L93 Difference]: Finished difference Result 879 states and 1180 transitions. [2019-09-08 05:36:05,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:36:05,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-09-08 05:36:05,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:05,839 INFO L225 Difference]: With dead ends: 879 [2019-09-08 05:36:05,839 INFO L226 Difference]: Without dead ends: 579 [2019-09-08 05:36:05,841 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:36:05,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-09-08 05:36:05,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 578. [2019-09-08 05:36:05,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-09-08 05:36:05,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 788 transitions. [2019-09-08 05:36:05,880 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 788 transitions. Word has length 192 [2019-09-08 05:36:05,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:05,882 INFO L475 AbstractCegarLoop]: Abstraction has 578 states and 788 transitions. [2019-09-08 05:36:05,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:36:05,883 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 788 transitions. [2019-09-08 05:36:05,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-08 05:36:05,889 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:05,889 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-08 05:36:05,890 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:05,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:05,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1874665950, now seen corresponding path program 1 times [2019-09-08 05:36:05,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:05,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:05,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:05,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:05,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:06,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:06,189 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 05:36:06,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:06,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:36:06,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:36:06,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:36:06,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:36:06,194 INFO L87 Difference]: Start difference. First operand 578 states and 788 transitions. Second operand 3 states. [2019-09-08 05:36:06,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:06,249 INFO L93 Difference]: Finished difference Result 1134 states and 1577 transitions. [2019-09-08 05:36:06,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:36:06,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 202 [2019-09-08 05:36:06,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:06,256 INFO L225 Difference]: With dead ends: 1134 [2019-09-08 05:36:06,256 INFO L226 Difference]: Without dead ends: 621 [2019-09-08 05:36:06,258 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:36:06,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-09-08 05:36:06,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 620. [2019-09-08 05:36:06,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-09-08 05:36:06,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 860 transitions. [2019-09-08 05:36:06,296 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 860 transitions. Word has length 202 [2019-09-08 05:36:06,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:06,298 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 860 transitions. [2019-09-08 05:36:06,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:36:06,299 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 860 transitions. [2019-09-08 05:36:06,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-08 05:36:06,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:06,305 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-08 05:36:06,305 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:06,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:06,307 INFO L82 PathProgramCache]: Analyzing trace with hash -620463334, now seen corresponding path program 1 times [2019-09-08 05:36:06,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:06,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:06,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:06,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:06,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:06,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:06,467 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 05:36:06,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:06,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:36:06,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:36:06,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:36:06,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:36:06,470 INFO L87 Difference]: Start difference. First operand 620 states and 860 transitions. Second operand 3 states. [2019-09-08 05:36:06,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:06,534 INFO L93 Difference]: Finished difference Result 1257 states and 1788 transitions. [2019-09-08 05:36:06,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:36:06,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2019-09-08 05:36:06,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:06,546 INFO L225 Difference]: With dead ends: 1257 [2019-09-08 05:36:06,546 INFO L226 Difference]: Without dead ends: 702 [2019-09-08 05:36:06,549 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:36:06,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2019-09-08 05:36:06,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 701. [2019-09-08 05:36:06,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 701 states. [2019-09-08 05:36:06,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 998 transitions. [2019-09-08 05:36:06,598 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 998 transitions. Word has length 203 [2019-09-08 05:36:06,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:06,600 INFO L475 AbstractCegarLoop]: Abstraction has 701 states and 998 transitions. [2019-09-08 05:36:06,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:36:06,600 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 998 transitions. [2019-09-08 05:36:06,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-08 05:36:06,609 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:06,609 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-08 05:36:06,610 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:06,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:06,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1948319678, now seen corresponding path program 1 times [2019-09-08 05:36:06,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:06,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:06,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:06,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:06,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:06,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:07,027 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 05:36:07,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:07,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:36:07,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:36:07,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:36:07,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:36:07,031 INFO L87 Difference]: Start difference. First operand 701 states and 998 transitions. Second operand 3 states. [2019-09-08 05:36:07,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:07,094 INFO L93 Difference]: Finished difference Result 1494 states and 2192 transitions. [2019-09-08 05:36:07,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:36:07,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-09-08 05:36:07,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:07,103 INFO L225 Difference]: With dead ends: 1494 [2019-09-08 05:36:07,104 INFO L226 Difference]: Without dead ends: 858 [2019-09-08 05:36:07,107 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:36:07,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2019-09-08 05:36:07,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 857. [2019-09-08 05:36:07,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 857 states. [2019-09-08 05:36:07,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1262 transitions. [2019-09-08 05:36:07,170 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1262 transitions. Word has length 204 [2019-09-08 05:36:07,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:07,171 INFO L475 AbstractCegarLoop]: Abstraction has 857 states and 1262 transitions. [2019-09-08 05:36:07,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:36:07,171 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1262 transitions. [2019-09-08 05:36:07,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-08 05:36:07,181 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:07,181 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-08 05:36:07,182 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:07,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:07,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1879306950, now seen corresponding path program 1 times [2019-09-08 05:36:07,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:07,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:07,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:07,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:07,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:07,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:07,393 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 05:36:07,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:07,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:36:07,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:36:07,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:36:07,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:36:07,395 INFO L87 Difference]: Start difference. First operand 857 states and 1262 transitions. Second operand 3 states. [2019-09-08 05:36:07,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:07,511 INFO L93 Difference]: Finished difference Result 1950 states and 2964 transitions. [2019-09-08 05:36:07,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:36:07,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-09-08 05:36:07,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:07,521 INFO L225 Difference]: With dead ends: 1950 [2019-09-08 05:36:07,521 INFO L226 Difference]: Without dead ends: 1158 [2019-09-08 05:36:07,528 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:36:07,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2019-09-08 05:36:07,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1157. [2019-09-08 05:36:07,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1157 states. [2019-09-08 05:36:07,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1766 transitions. [2019-09-08 05:36:07,587 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1766 transitions. Word has length 205 [2019-09-08 05:36:07,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:07,591 INFO L475 AbstractCegarLoop]: Abstraction has 1157 states and 1766 transitions. [2019-09-08 05:36:07,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:36:07,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1766 transitions. [2019-09-08 05:36:07,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-09-08 05:36:07,598 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:07,599 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-08 05:36:07,599 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:07,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:07,600 INFO L82 PathProgramCache]: Analyzing trace with hash -59408994, now seen corresponding path program 1 times [2019-09-08 05:36:07,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:07,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:07,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:07,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:07,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:07,771 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 05:36:07,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:07,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:36:07,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:36:07,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:36:07,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:36:07,772 INFO L87 Difference]: Start difference. First operand 1157 states and 1766 transitions. Second operand 3 states. [2019-09-08 05:36:07,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:07,862 INFO L93 Difference]: Finished difference Result 2826 states and 4436 transitions. [2019-09-08 05:36:07,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:36:07,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2019-09-08 05:36:07,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:07,878 INFO L225 Difference]: With dead ends: 2826 [2019-09-08 05:36:07,879 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 05:36:07,884 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:36:07,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 05:36:07,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1733. [2019-09-08 05:36:07,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1733 states. [2019-09-08 05:36:07,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2726 transitions. [2019-09-08 05:36:07,982 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2726 transitions. Word has length 206 [2019-09-08 05:36:07,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:07,983 INFO L475 AbstractCegarLoop]: Abstraction has 1733 states and 2726 transitions. [2019-09-08 05:36:07,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:36:07,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2726 transitions. [2019-09-08 05:36:07,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-08 05:36:07,998 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:07,998 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-08 05:36:07,999 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:07,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:08,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1504076601, now seen corresponding path program 1 times [2019-09-08 05:36:08,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:08,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:08,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:08,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:08,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:08,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:08,499 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 05:36:08,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:08,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 05:36:08,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 05:36:08,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 05:36:08,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-09-08 05:36:08,503 INFO L87 Difference]: Start difference. First operand 1733 states and 2726 transitions. Second operand 19 states. [2019-09-08 05:36:14,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:14,604 INFO L93 Difference]: Finished difference Result 4360 states and 6828 transitions. [2019-09-08 05:36:14,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-08 05:36:14,605 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 208 [2019-09-08 05:36:14,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:14,636 INFO L225 Difference]: With dead ends: 4360 [2019-09-08 05:36:14,636 INFO L226 Difference]: Without dead ends: 4073 [2019-09-08 05:36:14,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=287, Invalid=2683, Unknown=0, NotChecked=0, Total=2970 [2019-09-08 05:36:14,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4073 states. [2019-09-08 05:36:14,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4073 to 4036. [2019-09-08 05:36:14,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4036 states. [2019-09-08 05:36:14,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4036 states to 4036 states and 6377 transitions. [2019-09-08 05:36:14,897 INFO L78 Accepts]: Start accepts. Automaton has 4036 states and 6377 transitions. Word has length 208 [2019-09-08 05:36:14,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:14,900 INFO L475 AbstractCegarLoop]: Abstraction has 4036 states and 6377 transitions. [2019-09-08 05:36:14,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 05:36:14,901 INFO L276 IsEmpty]: Start isEmpty. Operand 4036 states and 6377 transitions. [2019-09-08 05:36:14,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-08 05:36:14,944 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:14,945 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-08 05:36:14,945 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:14,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:14,945 INFO L82 PathProgramCache]: Analyzing trace with hash 499285188, now seen corresponding path program 1 times [2019-09-08 05:36:14,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:14,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:14,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:14,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:14,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:15,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:15,308 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:36:15,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:15,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 05:36:15,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 05:36:15,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 05:36:15,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:36:15,312 INFO L87 Difference]: Start difference. First operand 4036 states and 6377 transitions. Second operand 13 states. [2019-09-08 05:36:16,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:16,107 INFO L93 Difference]: Finished difference Result 5385 states and 8273 transitions. [2019-09-08 05:36:16,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 05:36:16,108 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 209 [2019-09-08 05:36:16,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:16,140 INFO L225 Difference]: With dead ends: 5385 [2019-09-08 05:36:16,140 INFO L226 Difference]: Without dead ends: 4170 [2019-09-08 05:36:16,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2019-09-08 05:36:16,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4170 states. [2019-09-08 05:36:16,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4170 to 4170. [2019-09-08 05:36:16,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4170 states. [2019-09-08 05:36:16,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4170 states to 4170 states and 6594 transitions. [2019-09-08 05:36:16,427 INFO L78 Accepts]: Start accepts. Automaton has 4170 states and 6594 transitions. Word has length 209 [2019-09-08 05:36:16,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:16,428 INFO L475 AbstractCegarLoop]: Abstraction has 4170 states and 6594 transitions. [2019-09-08 05:36:16,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 05:36:16,428 INFO L276 IsEmpty]: Start isEmpty. Operand 4170 states and 6594 transitions. [2019-09-08 05:36:16,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-08 05:36:16,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:16,449 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-08 05:36:16,449 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:16,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:16,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1211410007, now seen corresponding path program 1 times [2019-09-08 05:36:16,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:16,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:16,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:16,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:16,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:16,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:16,759 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 05:36:16,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:16,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 05:36:16,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 05:36:16,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 05:36:16,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-09-08 05:36:16,762 INFO L87 Difference]: Start difference. First operand 4170 states and 6594 transitions. Second operand 15 states. [2019-09-08 05:36:20,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:20,695 INFO L93 Difference]: Finished difference Result 5557 states and 8565 transitions. [2019-09-08 05:36:20,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-08 05:36:20,695 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 209 [2019-09-08 05:36:20,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:20,725 INFO L225 Difference]: With dead ends: 5557 [2019-09-08 05:36:20,725 INFO L226 Difference]: Without dead ends: 4288 [2019-09-08 05:36:20,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=229, Invalid=1933, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 05:36:20,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4288 states. [2019-09-08 05:36:21,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4288 to 4251. [2019-09-08 05:36:21,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4251 states. [2019-09-08 05:36:21,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4251 states to 4251 states and 6732 transitions. [2019-09-08 05:36:21,053 INFO L78 Accepts]: Start accepts. Automaton has 4251 states and 6732 transitions. Word has length 209 [2019-09-08 05:36:21,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:21,053 INFO L475 AbstractCegarLoop]: Abstraction has 4251 states and 6732 transitions. [2019-09-08 05:36:21,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 05:36:21,054 INFO L276 IsEmpty]: Start isEmpty. Operand 4251 states and 6732 transitions. [2019-09-08 05:36:21,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-08 05:36:21,079 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:21,080 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-08 05:36:21,080 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:21,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:21,081 INFO L82 PathProgramCache]: Analyzing trace with hash 493886152, now seen corresponding path program 1 times [2019-09-08 05:36:21,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:21,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:21,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:21,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:21,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:21,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:21,440 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 05:36:21,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:21,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 05:36:21,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:36:21,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:36:21,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:36:21,442 INFO L87 Difference]: Start difference. First operand 4251 states and 6732 transitions. Second operand 18 states. [2019-09-08 05:36:22,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:22,155 INFO L93 Difference]: Finished difference Result 5668 states and 8728 transitions. [2019-09-08 05:36:22,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 05:36:22,155 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 209 [2019-09-08 05:36:22,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:22,189 INFO L225 Difference]: With dead ends: 5668 [2019-09-08 05:36:22,189 INFO L226 Difference]: Without dead ends: 4298 [2019-09-08 05:36:22,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 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:36:22,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4298 states. [2019-09-08 05:36:22,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4298 to 4296. [2019-09-08 05:36:22,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4296 states. [2019-09-08 05:36:22,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4296 states to 4296 states and 6771 transitions. [2019-09-08 05:36:22,459 INFO L78 Accepts]: Start accepts. Automaton has 4296 states and 6771 transitions. Word has length 209 [2019-09-08 05:36:22,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:22,463 INFO L475 AbstractCegarLoop]: Abstraction has 4296 states and 6771 transitions. [2019-09-08 05:36:22,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 05:36:22,463 INFO L276 IsEmpty]: Start isEmpty. Operand 4296 states and 6771 transitions. [2019-09-08 05:36:22,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-08 05:36:22,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:22,487 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-08 05:36:22,487 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:22,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:22,488 INFO L82 PathProgramCache]: Analyzing trace with hash -216412755, now seen corresponding path program 1 times [2019-09-08 05:36:22,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:22,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:22,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:22,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:22,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:22,705 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:36:22,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:22,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:36:22,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:36:22,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:36:22,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:36:22,708 INFO L87 Difference]: Start difference. First operand 4296 states and 6771 transitions. Second operand 5 states. [2019-09-08 05:36:24,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:24,288 INFO L93 Difference]: Finished difference Result 8545 states and 13391 transitions. [2019-09-08 05:36:24,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 05:36:24,289 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 209 [2019-09-08 05:36:24,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:24,342 INFO L225 Difference]: With dead ends: 8545 [2019-09-08 05:36:24,342 INFO L226 Difference]: Without dead ends: 7834 [2019-09-08 05:36:24,351 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:36:24,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7834 states. [2019-09-08 05:36:24,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7834 to 7820. [2019-09-08 05:36:24,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7820 states. [2019-09-08 05:36:24,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7820 states to 7820 states and 12337 transitions. [2019-09-08 05:36:24,758 INFO L78 Accepts]: Start accepts. Automaton has 7820 states and 12337 transitions. Word has length 209 [2019-09-08 05:36:24,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:24,759 INFO L475 AbstractCegarLoop]: Abstraction has 7820 states and 12337 transitions. [2019-09-08 05:36:24,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:36:24,759 INFO L276 IsEmpty]: Start isEmpty. Operand 7820 states and 12337 transitions. [2019-09-08 05:36:24,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-08 05:36:24,795 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:24,796 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-08 05:36:24,796 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:24,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:24,797 INFO L82 PathProgramCache]: Analyzing trace with hash -196075380, now seen corresponding path program 1 times [2019-09-08 05:36:24,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:24,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:24,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:24,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:24,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:24,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:24,994 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:36:24,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:24,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 05:36:24,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:36:24,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:36:24,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:36:24,996 INFO L87 Difference]: Start difference. First operand 7820 states and 12337 transitions. Second operand 7 states. [2019-09-08 05:36:28,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:28,187 INFO L93 Difference]: Finished difference Result 18483 states and 29904 transitions. [2019-09-08 05:36:28,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 05:36:28,188 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 209 [2019-09-08 05:36:28,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:28,293 INFO L225 Difference]: With dead ends: 18483 [2019-09-08 05:36:28,293 INFO L226 Difference]: Without dead ends: 14982 [2019-09-08 05:36:28,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:36:28,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14982 states. [2019-09-08 05:36:29,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14982 to 14976. [2019-09-08 05:36:29,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14976 states. [2019-09-08 05:36:29,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14976 states to 14976 states and 24039 transitions. [2019-09-08 05:36:29,334 INFO L78 Accepts]: Start accepts. Automaton has 14976 states and 24039 transitions. Word has length 209 [2019-09-08 05:36:29,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:29,335 INFO L475 AbstractCegarLoop]: Abstraction has 14976 states and 24039 transitions. [2019-09-08 05:36:29,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 05:36:29,335 INFO L276 IsEmpty]: Start isEmpty. Operand 14976 states and 24039 transitions. [2019-09-08 05:36:29,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-08 05:36:29,371 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:29,371 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-08 05:36:29,371 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:29,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:29,372 INFO L82 PathProgramCache]: Analyzing trace with hash -428249634, now seen corresponding path program 1 times [2019-09-08 05:36:29,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:29,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:29,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:29,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:29,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:29,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:30,036 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:36:30,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:30,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-09-08 05:36:30,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-08 05:36:30,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-08 05:36:30,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-09-08 05:36:30,039 INFO L87 Difference]: Start difference. First operand 14976 states and 24039 transitions. Second operand 28 states. [2019-09-08 05:36:31,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:31,633 INFO L93 Difference]: Finished difference Result 26074 states and 42246 transitions. [2019-09-08 05:36:31,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 05:36:31,634 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 210 [2019-09-08 05:36:31,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:31,749 INFO L225 Difference]: With dead ends: 26074 [2019-09-08 05:36:31,749 INFO L226 Difference]: Without dead ends: 15417 [2019-09-08 05:36:31,819 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=1459, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 05:36:31,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15417 states. [2019-09-08 05:36:32,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15417 to 15384. [2019-09-08 05:36:32,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15384 states. [2019-09-08 05:36:32,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15384 states to 15384 states and 24558 transitions. [2019-09-08 05:36:32,685 INFO L78 Accepts]: Start accepts. Automaton has 15384 states and 24558 transitions. Word has length 210 [2019-09-08 05:36:32,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:32,687 INFO L475 AbstractCegarLoop]: Abstraction has 15384 states and 24558 transitions. [2019-09-08 05:36:32,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-08 05:36:32,687 INFO L276 IsEmpty]: Start isEmpty. Operand 15384 states and 24558 transitions. [2019-09-08 05:36:32,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-09-08 05:36:32,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:32,728 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-08 05:36:32,728 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:32,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:32,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1086081098, now seen corresponding path program 1 times [2019-09-08 05:36:32,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:32,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:32,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:32,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:32,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:32,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:33,041 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:36:33,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:33,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 05:36:33,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 05:36:33,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 05:36:33,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 05:36:33,044 INFO L87 Difference]: Start difference. First operand 15384 states and 24558 transitions. Second operand 10 states. [2019-09-08 05:36:33,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:33,772 INFO L93 Difference]: Finished difference Result 15507 states and 24760 transitions. [2019-09-08 05:36:33,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 05:36:33,773 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 214 [2019-09-08 05:36:33,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:33,845 INFO L225 Difference]: With dead ends: 15507 [2019-09-08 05:36:33,846 INFO L226 Difference]: Without dead ends: 15504 [2019-09-08 05:36:33,861 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 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:36:33,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15504 states. [2019-09-08 05:36:34,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15504 to 15504. [2019-09-08 05:36:34,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15504 states. [2019-09-08 05:36:34,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15504 states to 15504 states and 24718 transitions. [2019-09-08 05:36:34,605 INFO L78 Accepts]: Start accepts. Automaton has 15504 states and 24718 transitions. Word has length 214 [2019-09-08 05:36:34,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:34,605 INFO L475 AbstractCegarLoop]: Abstraction has 15504 states and 24718 transitions. [2019-09-08 05:36:34,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 05:36:34,606 INFO L276 IsEmpty]: Start isEmpty. Operand 15504 states and 24718 transitions. [2019-09-08 05:36:34,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-08 05:36:34,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:34,632 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:36:34,633 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:34,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:34,633 INFO L82 PathProgramCache]: Analyzing trace with hash -268832971, now seen corresponding path program 1 times [2019-09-08 05:36:34,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:34,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:34,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:34,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:34,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:34,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:34,793 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:36:34,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:34,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:36:34,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:36:34,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:36:34,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:36:34,795 INFO L87 Difference]: Start difference. First operand 15504 states and 24718 transitions. Second operand 5 states. [2019-09-08 05:36:35,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:35,416 INFO L93 Difference]: Finished difference Result 26968 states and 43122 transitions. [2019-09-08 05:36:35,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 05:36:35,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 219 [2019-09-08 05:36:35,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:35,499 INFO L225 Difference]: With dead ends: 26968 [2019-09-08 05:36:35,500 INFO L226 Difference]: Without dead ends: 15831 [2019-09-08 05:36:35,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:36:35,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15831 states. [2019-09-08 05:36:36,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15831 to 15650. [2019-09-08 05:36:36,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15650 states. [2019-09-08 05:36:36,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15650 states to 15650 states and 24899 transitions. [2019-09-08 05:36:36,417 INFO L78 Accepts]: Start accepts. Automaton has 15650 states and 24899 transitions. Word has length 219 [2019-09-08 05:36:36,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:36,418 INFO L475 AbstractCegarLoop]: Abstraction has 15650 states and 24899 transitions. [2019-09-08 05:36:36,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:36:36,418 INFO L276 IsEmpty]: Start isEmpty. Operand 15650 states and 24899 transitions. [2019-09-08 05:36:36,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-09-08 05:36:36,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:36,467 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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:36:36,467 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:36,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:36,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1872611483, now seen corresponding path program 1 times [2019-09-08 05:36:36,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:36,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:36,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:36,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:36,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:36,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:36,607 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:36:36,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:36,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:36:36,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:36:36,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:36:36,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:36:36,609 INFO L87 Difference]: Start difference. First operand 15650 states and 24899 transitions. Second operand 5 states. [2019-09-08 05:36:37,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:37,026 INFO L93 Difference]: Finished difference Result 24630 states and 38480 transitions. [2019-09-08 05:36:37,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 05:36:37,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 221 [2019-09-08 05:36:37,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:37,091 INFO L225 Difference]: With dead ends: 24630 [2019-09-08 05:36:37,091 INFO L226 Difference]: Without dead ends: 13230 [2019-09-08 05:36:37,126 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:36:37,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13230 states. [2019-09-08 05:36:37,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13230 to 13220. [2019-09-08 05:36:37,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13220 states. [2019-09-08 05:36:37,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13220 states to 13220 states and 20925 transitions. [2019-09-08 05:36:37,927 INFO L78 Accepts]: Start accepts. Automaton has 13220 states and 20925 transitions. Word has length 221 [2019-09-08 05:36:37,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:37,927 INFO L475 AbstractCegarLoop]: Abstraction has 13220 states and 20925 transitions. [2019-09-08 05:36:37,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:36:37,927 INFO L276 IsEmpty]: Start isEmpty. Operand 13220 states and 20925 transitions. [2019-09-08 05:36:37,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-08 05:36:37,954 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:37,955 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:36:37,955 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:37,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:37,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1699876820, now seen corresponding path program 1 times [2019-09-08 05:36:37,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:37,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:37,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:37,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:37,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:38,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:38,123 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:36:38,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:38,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:36:38,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:36:38,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:36:38,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:36:38,126 INFO L87 Difference]: Start difference. First operand 13220 states and 20925 transitions. Second operand 6 states. [2019-09-08 05:36:39,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:39,155 INFO L93 Difference]: Finished difference Result 35516 states and 56957 transitions. [2019-09-08 05:36:39,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 05:36:39,156 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 220 [2019-09-08 05:36:39,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:39,313 INFO L225 Difference]: With dead ends: 35516 [2019-09-08 05:36:39,313 INFO L226 Difference]: Without dead ends: 26559 [2019-09-08 05:36:39,354 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 05:36:39,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26559 states. [2019-09-08 05:36:40,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26559 to 26229. [2019-09-08 05:36:40,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26229 states. [2019-09-08 05:36:40,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26229 states to 26229 states and 42130 transitions. [2019-09-08 05:36:40,714 INFO L78 Accepts]: Start accepts. Automaton has 26229 states and 42130 transitions. Word has length 220 [2019-09-08 05:36:40,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:40,714 INFO L475 AbstractCegarLoop]: Abstraction has 26229 states and 42130 transitions. [2019-09-08 05:36:40,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:36:40,714 INFO L276 IsEmpty]: Start isEmpty. Operand 26229 states and 42130 transitions. [2019-09-08 05:36:40,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-08 05:36:40,755 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:40,755 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 05:36:40,756 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:40,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:40,756 INFO L82 PathProgramCache]: Analyzing trace with hash -367726315, now seen corresponding path program 1 times [2019-09-08 05:36:40,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:40,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:40,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:40,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:40,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:40,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:40,950 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 05:36:40,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:40,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:36:40,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:36:40,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:36:40,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:36:40,952 INFO L87 Difference]: Start difference. First operand 26229 states and 42130 transitions. Second operand 8 states. [2019-09-08 05:36:47,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:47,525 INFO L93 Difference]: Finished difference Result 79301 states and 135592 transitions. [2019-09-08 05:36:47,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 05:36:47,526 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 256 [2019-09-08 05:36:47,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:48,089 INFO L225 Difference]: With dead ends: 79301 [2019-09-08 05:36:48,089 INFO L226 Difference]: Without dead ends: 53137 [2019-09-08 05:36:48,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-08 05:36:48,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53137 states. [2019-09-08 05:36:49,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53137 to 35061. [2019-09-08 05:36:49,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35061 states. [2019-09-08 05:36:50,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35061 states to 35061 states and 62176 transitions. [2019-09-08 05:36:50,115 INFO L78 Accepts]: Start accepts. Automaton has 35061 states and 62176 transitions. Word has length 256 [2019-09-08 05:36:50,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:50,116 INFO L475 AbstractCegarLoop]: Abstraction has 35061 states and 62176 transitions. [2019-09-08 05:36:50,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:36:50,116 INFO L276 IsEmpty]: Start isEmpty. Operand 35061 states and 62176 transitions. [2019-09-08 05:36:50,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-08 05:36:50,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:50,213 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:36:50,213 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:50,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:50,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1716034950, now seen corresponding path program 1 times [2019-09-08 05:36:50,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:50,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:50,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:50,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:50,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:50,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:50,433 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 05:36:50,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:50,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:36:50,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:36:50,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:36:50,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:36:50,435 INFO L87 Difference]: Start difference. First operand 35061 states and 62176 transitions. Second operand 8 states. [2019-09-08 05:36:57,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:57,871 INFO L93 Difference]: Finished difference Result 106601 states and 205246 transitions. [2019-09-08 05:36:57,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 05:36:57,872 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 242 [2019-09-08 05:36:57,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:58,280 INFO L225 Difference]: With dead ends: 106601 [2019-09-08 05:36:58,282 INFO L226 Difference]: Without dead ends: 71605 [2019-09-08 05:36:58,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-08 05:36:58,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71605 states. [2019-09-08 05:37:01,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71605 to 52905. [2019-09-08 05:37:01,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52905 states. [2019-09-08 05:37:01,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52905 states to 52905 states and 106600 transitions. [2019-09-08 05:37:01,630 INFO L78 Accepts]: Start accepts. Automaton has 52905 states and 106600 transitions. Word has length 242 [2019-09-08 05:37:01,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:37:01,630 INFO L475 AbstractCegarLoop]: Abstraction has 52905 states and 106600 transitions. [2019-09-08 05:37:01,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:37:01,630 INFO L276 IsEmpty]: Start isEmpty. Operand 52905 states and 106600 transitions. [2019-09-08 05:37:01,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-09-08 05:37:01,869 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:37:01,869 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:37:01,870 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:37:01,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:37:01,870 INFO L82 PathProgramCache]: Analyzing trace with hash 660550356, now seen corresponding path program 1 times [2019-09-08 05:37:01,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:37:01,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:37:01,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:01,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:37:01,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:01,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:37:02,073 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 05:37:02,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:37:02,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:37:02,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:37:02,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:37:02,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:37:02,075 INFO L87 Difference]: Start difference. First operand 52905 states and 106600 transitions. Second operand 8 states. [2019-09-08 05:37:11,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:37:11,186 INFO L93 Difference]: Finished difference Result 161609 states and 357484 transitions. [2019-09-08 05:37:11,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 05:37:11,187 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 243 [2019-09-08 05:37:11,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:37:12,021 INFO L225 Difference]: With dead ends: 161609 [2019-09-08 05:37:12,022 INFO L226 Difference]: Without dead ends: 108769 [2019-09-08 05:37:12,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-08 05:37:12,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108769 states. [2019-09-08 05:37:20,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108769 to 88785. [2019-09-08 05:37:20,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88785 states. [2019-09-08 05:37:21,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88785 states to 88785 states and 203902 transitions. [2019-09-08 05:37:21,096 INFO L78 Accepts]: Start accepts. Automaton has 88785 states and 203902 transitions. Word has length 243 [2019-09-08 05:37:21,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:37:21,096 INFO L475 AbstractCegarLoop]: Abstraction has 88785 states and 203902 transitions. [2019-09-08 05:37:21,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:37:21,097 INFO L276 IsEmpty]: Start isEmpty. Operand 88785 states and 203902 transitions. [2019-09-08 05:37:21,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-08 05:37:21,536 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:37:21,536 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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:37:21,537 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:37:21,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:37:21,537 INFO L82 PathProgramCache]: Analyzing trace with hash 340432954, now seen corresponding path program 1 times [2019-09-08 05:37:21,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:37:21,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:37:21,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:21,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:37:21,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:21,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:37:21,737 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 05:37:21,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:37:21,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:37:21,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:37:21,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:37:21,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:37:21,739 INFO L87 Difference]: Start difference. First operand 88785 states and 203902 transitions. Second operand 8 states. [2019-09-08 05:37:30,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:37:30,732 INFO L93 Difference]: Finished difference Result 197022 states and 444573 transitions. [2019-09-08 05:37:30,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 05:37:30,733 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 239 [2019-09-08 05:37:30,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:37:32,514 INFO L225 Difference]: With dead ends: 197022 [2019-09-08 05:37:32,514 INFO L226 Difference]: Without dead ends: 179170 [2019-09-08 05:37:32,619 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:37:32,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179170 states. [2019-09-08 05:37:45,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179170 to 179019. [2019-09-08 05:37:45,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179019 states. [2019-09-08 05:37:46,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179019 states to 179019 states and 414841 transitions. [2019-09-08 05:37:46,628 INFO L78 Accepts]: Start accepts. Automaton has 179019 states and 414841 transitions. Word has length 239 [2019-09-08 05:37:46,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:37:46,629 INFO L475 AbstractCegarLoop]: Abstraction has 179019 states and 414841 transitions. [2019-09-08 05:37:46,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:37:46,629 INFO L276 IsEmpty]: Start isEmpty. Operand 179019 states and 414841 transitions. [2019-09-08 05:37:47,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 05:37:47,692 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:37:47,692 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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:37:47,692 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:37:47,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:37:47,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1337773327, now seen corresponding path program 1 times [2019-09-08 05:37:47,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:37:47,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:37:47,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:47,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:37:47,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:47,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:37:47,953 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-08 05:37:47,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:37:47,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 05:37:47,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 05:37:47,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 05:37:47,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-09-08 05:37:47,955 INFO L87 Difference]: Start difference. First operand 179019 states and 414841 transitions. Second operand 15 states. [2019-09-08 05:38:01,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:38:01,530 INFO L93 Difference]: Finished difference Result 207303 states and 461666 transitions. [2019-09-08 05:38:01,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 05:38:01,530 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 240 [2019-09-08 05:38:01,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:38:02,324 INFO L225 Difference]: With dead ends: 207303 [2019-09-08 05:38:02,324 INFO L226 Difference]: Without dead ends: 178788 [2019-09-08 05:38:02,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=1166, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 05:38:02,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178788 states. [2019-09-08 05:38:13,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178788 to 178114. [2019-09-08 05:38:13,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178114 states. [2019-09-08 05:38:21,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178114 states to 178114 states and 412730 transitions. [2019-09-08 05:38:21,691 INFO L78 Accepts]: Start accepts. Automaton has 178114 states and 412730 transitions. Word has length 240 [2019-09-08 05:38:21,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:38:21,692 INFO L475 AbstractCegarLoop]: Abstraction has 178114 states and 412730 transitions. [2019-09-08 05:38:21,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 05:38:21,692 INFO L276 IsEmpty]: Start isEmpty. Operand 178114 states and 412730 transitions. [2019-09-08 05:38:22,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 05:38:22,724 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:38:22,725 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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:38:22,725 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:38:22,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:38:22,725 INFO L82 PathProgramCache]: Analyzing trace with hash -225115086, now seen corresponding path program 1 times [2019-09-08 05:38:22,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:38:22,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:38:22,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:38:22,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:38:22,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:38:22,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:38:22,922 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-08 05:38:22,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:38:22,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 05:38:22,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:38:22,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:38:22,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:38:22,925 INFO L87 Difference]: Start difference. First operand 178114 states and 412730 transitions. Second operand 7 states. [2019-09-08 05:39:00,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:39:00,082 INFO L93 Difference]: Finished difference Result 508828 states and 1223577 transitions. [2019-09-08 05:39:00,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 05:39:00,082 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 240 [2019-09-08 05:39:00,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:39:02,611 INFO L225 Difference]: With dead ends: 508828 [2019-09-08 05:39:02,611 INFO L226 Difference]: Without dead ends: 472792 [2019-09-08 05:39:02,877 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 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:39:03,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472792 states. [2019-09-08 05:39:37,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472792 to 356975. [2019-09-08 05:39:37,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356975 states. [2019-09-08 05:39:53,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356975 states to 356975 states and 841205 transitions. [2019-09-08 05:39:53,349 INFO L78 Accepts]: Start accepts. Automaton has 356975 states and 841205 transitions. Word has length 240 [2019-09-08 05:39:53,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:39:53,350 INFO L475 AbstractCegarLoop]: Abstraction has 356975 states and 841205 transitions. [2019-09-08 05:39:53,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 05:39:53,350 INFO L276 IsEmpty]: Start isEmpty. Operand 356975 states and 841205 transitions. [2019-09-08 05:39:58,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 05:39:58,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:39:58,074 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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:39:58,074 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:39:58,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:39:58,075 INFO L82 PathProgramCache]: Analyzing trace with hash -2050933252, now seen corresponding path program 2 times [2019-09-08 05:39:58,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:39:58,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:39:58,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:58,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:39:58,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:58,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:39:58,287 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-08 05:39:58,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:39:58,287 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:39:58,300 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 05:39:58,909 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 05:39:58,910 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 05:39:58,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 3191 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:39:58,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:39:59,255 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 05:39:59,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:39:59,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2019-09-08 05:39:59,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:39:59,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:39:59,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:39:59,280 INFO L87 Difference]: Start difference. First operand 356975 states and 841205 transitions. Second operand 18 states. [2019-09-08 05:40:35,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:40:35,453 INFO L93 Difference]: Finished difference Result 714594 states and 1683560 transitions. [2019-09-08 05:40:35,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 05:40:35,454 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 240 [2019-09-08 05:40:35,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:40:37,924 INFO L225 Difference]: With dead ends: 714594 [2019-09-08 05:40:37,924 INFO L226 Difference]: Without dead ends: 357671 [2019-09-08 05:40:39,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 237 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:40:40,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357671 states. [2019-09-08 05:41:25,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357671 to 357253. [2019-09-08 05:41:25,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357253 states. [2019-09-08 05:41:41,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357253 states to 357253 states and 841577 transitions. [2019-09-08 05:41:41,923 INFO L78 Accepts]: Start accepts. Automaton has 357253 states and 841577 transitions. Word has length 240 [2019-09-08 05:41:41,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:41:41,924 INFO L475 AbstractCegarLoop]: Abstraction has 357253 states and 841577 transitions. [2019-09-08 05:41:41,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 05:41:41,924 INFO L276 IsEmpty]: Start isEmpty. Operand 357253 states and 841577 transitions. [2019-09-08 05:41:46,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-09-08 05:41:46,622 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:41:46,622 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:41:46,622 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:41:46,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:41:46,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1225297730, now seen corresponding path program 1 times [2019-09-08 05:41:46,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:41:46,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:41:46,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:46,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 05:41:46,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:46,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:41:46,807 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:41:46,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:41:46,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:41:46,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:41:46,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:41:46,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:41:46,809 INFO L87 Difference]: Start difference. First operand 357253 states and 841577 transitions. Second operand 6 states. [2019-09-08 05:42:15,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:42:15,605 INFO L93 Difference]: Finished difference Result 714695 states and 1686370 transitions. [2019-09-08 05:42:15,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:42:15,605 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 263 [2019-09-08 05:42:15,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:42:17,629 INFO L225 Difference]: With dead ends: 714695 [2019-09-08 05:42:17,629 INFO L226 Difference]: Without dead ends: 357253 [2019-09-08 05:42:20,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:42:20,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357253 states. [2019-09-08 05:43:10,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357253 to 357253. [2019-09-08 05:43:10,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357253 states. [2019-09-08 05:43:14,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357253 states to 357253 states and 841385 transitions. [2019-09-08 05:43:15,013 INFO L78 Accepts]: Start accepts. Automaton has 357253 states and 841385 transitions. Word has length 263 [2019-09-08 05:43:15,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:43:15,013 INFO L475 AbstractCegarLoop]: Abstraction has 357253 states and 841385 transitions. [2019-09-08 05:43:15,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:43:15,013 INFO L276 IsEmpty]: Start isEmpty. Operand 357253 states and 841385 transitions. [2019-09-08 05:43:19,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-09-08 05:43:19,107 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:43:19,107 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:43:19,107 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:43:19,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:43:19,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1954623103, now seen corresponding path program 1 times [2019-09-08 05:43:19,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:43:19,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:43:19,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:43:19,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:43:19,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:43:19,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:43:19,273 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 05:43:19,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:43:19,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:43:19,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:43:19,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:43:19,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:43:19,275 INFO L87 Difference]: Start difference. First operand 357253 states and 841385 transitions. Second operand 6 states. [2019-09-08 05:43:47,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:43:47,769 INFO L93 Difference]: Finished difference Result 715031 states and 1703914 transitions. [2019-09-08 05:43:47,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:43:47,770 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 264 [2019-09-08 05:43:47,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:43:51,294 INFO L225 Difference]: With dead ends: 715031 [2019-09-08 05:43:51,295 INFO L226 Difference]: Without dead ends: 357973 [2019-09-08 05:43:53,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:43:54,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357973 states. [2019-09-08 05:44:31,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357973 to 357973. [2019-09-08 05:44:31,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357973 states. [2019-09-08 05:44:36,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357973 states to 357973 states and 824609 transitions. [2019-09-08 05:44:36,500 INFO L78 Accepts]: Start accepts. Automaton has 357973 states and 824609 transitions. Word has length 264 [2019-09-08 05:44:36,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:44:36,501 INFO L475 AbstractCegarLoop]: Abstraction has 357973 states and 824609 transitions. [2019-09-08 05:44:36,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:44:36,501 INFO L276 IsEmpty]: Start isEmpty. Operand 357973 states and 824609 transitions. [2019-09-08 05:44:54,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-09-08 05:44:54,697 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:44:54,698 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:44:54,698 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:44:54,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:44:54,698 INFO L82 PathProgramCache]: Analyzing trace with hash -530757770, now seen corresponding path program 1 times [2019-09-08 05:44:54,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:44:54,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:44:54,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:44:54,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:44:54,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:44:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:44:54,886 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-08 05:44:54,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:44:54,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:44:54,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:44:54,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:44:54,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:44:54,889 INFO L87 Difference]: Start difference. First operand 357973 states and 824609 transitions. Second operand 6 states. [2019-09-08 05:45:16,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:45:16,141 INFO L93 Difference]: Finished difference Result 715799 states and 1741192 transitions. [2019-09-08 05:45:16,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:45:16,142 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 268 [2019-09-08 05:45:16,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:45:18,006 INFO L225 Difference]: With dead ends: 715799 [2019-09-08 05:45:18,007 INFO L226 Difference]: Without dead ends: 358015