java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/email_spec8_product14.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 13:53:55,197 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 13:53:55,199 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 13:53:55,212 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 13:53:55,212 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 13:53:55,213 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 13:53:55,214 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 13:53:55,216 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 13:53:55,218 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 13:53:55,219 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 13:53:55,220 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 13:53:55,221 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 13:53:55,221 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 13:53:55,222 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 13:53:55,223 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 13:53:55,224 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 13:53:55,225 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 13:53:55,226 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 13:53:55,228 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 13:53:55,230 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 13:53:55,231 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 13:53:55,232 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 13:53:55,233 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 13:53:55,234 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 13:53:55,239 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 13:53:55,239 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 13:53:55,241 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 13:53:55,242 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 13:53:55,242 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 13:53:55,244 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 13:53:55,244 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 13:53:55,245 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 13:53:55,246 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 13:53:55,248 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 13:53:55,249 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 13:53:55,249 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 13:53:55,250 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 13:53:55,252 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 13:53:55,253 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 13:53:55,254 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 13:53:55,254 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 13:53:55,259 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 13:53:55,278 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 13:53:55,278 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 13:53:55,279 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 13:53:55,280 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 13:53:55,280 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 13:53:55,280 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 13:53:55,280 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 13:53:55,281 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 13:53:55,281 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 13:53:55,281 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 13:53:55,281 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 13:53:55,281 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 13:53:55,281 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 13:53:55,282 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 13:53:55,282 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 13:53:55,282 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 13:53:55,282 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 13:53:55,282 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 13:53:55,283 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 13:53:55,283 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 13:53:55,283 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 13:53:55,283 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 13:53:55,283 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 13:53:55,284 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 13:53:55,284 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 13:53:55,284 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 13:53:55,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 13:53:55,284 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 13:53:55,285 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 13:53:55,337 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 13:53:55,352 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 13:53:55,357 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 13:53:55,358 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 13:53:55,359 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 13:53:55,360 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec8_product14.cil.c [2019-10-02 13:53:55,438 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/373fe9208/6f0b25e98b8d448f9f6b15ec69e3878c/FLAG6fdc4ab49 [2019-10-02 13:53:56,091 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 13:53:56,091 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec8_product14.cil.c [2019-10-02 13:53:56,116 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/373fe9208/6f0b25e98b8d448f9f6b15ec69e3878c/FLAG6fdc4ab49 [2019-10-02 13:53:56,293 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/373fe9208/6f0b25e98b8d448f9f6b15ec69e3878c [2019-10-02 13:53:56,305 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 13:53:56,307 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 13:53:56,308 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 13:53:56,308 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 13:53:56,311 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 13:53:56,312 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:53:56" (1/1) ... [2019-10-02 13:53:56,314 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35627d41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:53:56, skipping insertion in model container [2019-10-02 13:53:56,315 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:53:56" (1/1) ... [2019-10-02 13:53:56,321 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 13:53:56,406 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 13:53:57,182 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:53:57,207 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 13:53:57,387 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:53:57,482 INFO L192 MainTranslator]: Completed translation [2019-10-02 13:53:57,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:53:57 WrapperNode [2019-10-02 13:53:57,483 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 13:53:57,484 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 13:53:57,484 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 13:53:57,484 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 13:53:57,496 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:53:57" (1/1) ... [2019-10-02 13:53:57,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:53:57" (1/1) ... [2019-10-02 13:53:57,533 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:53:57" (1/1) ... [2019-10-02 13:53:57,534 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:53:57" (1/1) ... [2019-10-02 13:53:57,617 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:53:57" (1/1) ... [2019-10-02 13:53:57,648 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:53:57" (1/1) ... [2019-10-02 13:53:57,667 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:53:57" (1/1) ... [2019-10-02 13:53:57,703 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 13:53:57,704 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 13:53:57,704 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 13:53:57,709 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 13:53:57,712 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:53:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 13:53:57,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 13:53:57,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 13:53:57,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 13:53:57,802 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 13:53:57,804 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 13:53:57,804 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 13:53:57,804 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 13:53:57,804 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 13:53:57,805 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 13:53:57,805 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 13:53:57,805 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 13:53:57,806 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 13:53:57,807 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2019-10-02 13:53:57,807 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 13:53:57,808 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 13:53:57,809 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AddressBook [2019-10-02 13:53:57,812 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 13:53:57,813 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 13:53:57,813 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 13:53:57,813 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 13:53:57,814 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 13:53:57,814 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 13:53:57,814 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 13:53:57,815 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 13:53:57,815 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 13:53:57,815 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-02 13:53:57,815 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 13:53:57,816 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 13:53:57,816 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 13:53:57,816 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 13:53:57,816 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 13:53:57,817 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 13:53:57,817 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 13:53:57,817 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptAutoResponder_spec__1 [2019-10-02 13:53:57,817 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptAutoResponder_spec__2 [2019-10-02 13:53:57,818 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 13:53:57,818 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 13:53:57,818 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 13:53:57,818 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 13:53:57,819 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 13:53:57,819 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 13:53:57,820 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 13:53:57,820 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 13:53:57,820 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 13:53:57,820 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 13:53:57,821 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 13:53:57,821 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 13:53:57,821 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 13:53:57,821 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 13:53:57,822 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 13:53:57,822 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 13:53:57,822 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 13:53:57,822 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 13:53:57,822 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 13:53:57,822 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 13:53:57,823 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 13:53:57,823 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 13:53:57,823 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 13:53:57,823 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 13:53:57,823 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 13:53:57,823 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 13:53:57,824 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 13:53:57,824 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 13:53:57,824 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 13:53:57,824 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 13:53:57,824 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 13:53:57,825 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 13:53:57,825 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 13:53:57,825 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 13:53:57,826 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 13:53:57,826 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 13:53:57,827 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 13:53:57,827 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 13:53:57,827 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 13:53:57,829 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 13:53:57,829 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 13:53:57,829 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 13:53:57,829 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 13:53:57,830 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 13:53:57,830 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 13:53:57,830 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 13:53:57,831 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 13:53:57,832 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 13:53:57,832 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 13:53:57,832 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 13:53:57,832 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 13:53:57,833 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 13:53:57,834 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 13:53:57,834 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 13:53:57,834 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 13:53:57,835 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 13:53:57,836 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 13:53:57,836 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 13:53:57,836 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 13:53:57,836 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 13:53:57,837 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 13:53:57,837 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 13:53:57,837 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 13:53:57,837 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 13:53:57,838 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 13:53:57,838 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 13:53:57,838 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 13:53:57,838 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 13:53:57,838 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 13:53:57,839 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 13:53:57,839 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-02 13:53:57,839 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 13:53:57,839 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 13:53:57,839 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 13:53:57,840 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 13:53:57,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 13:53:57,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 13:53:57,840 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 13:53:57,840 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 13:53:57,840 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 13:53:57,841 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 13:53:57,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 13:53:57,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 13:53:57,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 13:53:57,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 13:53:57,842 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 13:53:57,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 13:53:57,843 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 13:53:57,843 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 13:53:57,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 13:53:57,845 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 13:53:57,845 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 13:53:57,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 13:53:57,845 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 13:53:57,845 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 13:53:57,845 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 13:53:57,846 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 13:53:57,846 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 13:53:57,846 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 13:53:57,846 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 13:53:57,847 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 13:53:57,847 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 13:53:57,847 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 13:53:57,847 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 13:53:57,848 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 13:53:57,852 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 13:53:57,853 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 13:53:57,853 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 13:53:57,854 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 13:53:57,863 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 13:53:57,864 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 13:53:57,865 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 13:53:57,866 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 13:53:57,866 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 13:53:57,866 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 13:53:57,866 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 13:53:57,866 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 13:53:57,867 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 13:53:57,867 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 13:53:57,867 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 13:53:57,867 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 13:53:57,867 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 13:53:57,868 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 13:53:57,868 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 13:53:57,868 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-02 13:53:57,868 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptAutoResponder_spec__2 [2019-10-02 13:53:57,868 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 13:53:57,868 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2019-10-02 13:53:57,869 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AddressBook [2019-10-02 13:53:57,869 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptAutoResponder_spec__1 [2019-10-02 13:53:57,869 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 13:53:57,869 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 13:53:57,869 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 13:53:57,870 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 13:53:57,870 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 13:53:57,870 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 13:53:57,870 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 13:53:57,870 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 13:53:57,871 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 13:53:57,871 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 13:53:57,871 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 13:53:57,871 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 13:53:57,871 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 13:53:57,872 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 13:53:57,872 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 13:53:57,872 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 13:53:57,872 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 13:53:57,872 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 13:53:57,873 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 13:53:57,873 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 13:53:57,873 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 13:53:57,873 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 13:53:57,873 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 13:53:57,874 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 13:53:57,874 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 13:53:57,874 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-02 13:53:57,874 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 13:53:57,874 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 13:53:57,874 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 13:53:57,875 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 13:53:57,875 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 13:53:57,875 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 13:53:57,875 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 13:53:57,875 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 13:53:57,875 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 13:53:57,876 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 13:53:57,876 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 13:53:57,876 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 13:53:57,876 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 13:53:57,876 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 13:53:57,876 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 13:53:57,876 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 13:53:57,877 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 13:53:57,877 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 13:53:57,877 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 13:53:57,877 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 13:53:57,877 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 13:53:57,877 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 13:53:57,877 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 13:53:57,878 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 13:53:57,878 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 13:53:57,878 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 13:53:57,878 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 13:53:57,878 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 13:53:57,878 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 13:53:57,879 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 13:53:57,879 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 13:53:57,879 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 13:53:57,879 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 13:53:57,879 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 13:53:57,879 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 13:53:57,879 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 13:53:57,880 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 13:53:57,880 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 13:53:57,880 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 13:53:57,880 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 13:53:57,880 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 13:53:57,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 13:53:57,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 13:53:57,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 13:54:00,148 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 13:54:00,149 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 13:54:00,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:54:00 BoogieIcfgContainer [2019-10-02 13:54:00,151 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 13:54:00,152 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 13:54:00,152 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 13:54:00,156 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 13:54:00,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:53:56" (1/3) ... [2019-10-02 13:54:00,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@606f98f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:54:00, skipping insertion in model container [2019-10-02 13:54:00,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:53:57" (2/3) ... [2019-10-02 13:54:00,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@606f98f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:54:00, skipping insertion in model container [2019-10-02 13:54:00,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:54:00" (3/3) ... [2019-10-02 13:54:00,160 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec8_product14.cil.c [2019-10-02 13:54:00,173 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 13:54:00,193 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 13:54:00,212 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 13:54:00,263 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 13:54:00,264 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 13:54:00,264 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 13:54:00,264 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 13:54:00,264 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 13:54:00,265 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 13:54:00,265 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 13:54:00,265 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 13:54:00,265 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 13:54:00,309 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states. [2019-10-02 13:54:00,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-02 13:54:00,345 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:54:00,348 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:54:00,351 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:54:00,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:54:00,359 INFO L82 PathProgramCache]: Analyzing trace with hash 601456659, now seen corresponding path program 1 times [2019-10-02 13:54:00,364 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:54:00,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:54:00,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:00,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:54:00,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:00,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:54:01,123 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 13:54:01,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:54:01,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 13:54:01,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 13:54:01,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 13:54:01,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 13:54:01,152 INFO L87 Difference]: Start difference. First operand 521 states. Second operand 2 states. [2019-10-02 13:54:01,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:54:01,269 INFO L93 Difference]: Finished difference Result 695 states and 958 transitions. [2019-10-02 13:54:01,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 13:54:01,271 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 154 [2019-10-02 13:54:01,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:54:01,293 INFO L225 Difference]: With dead ends: 695 [2019-10-02 13:54:01,293 INFO L226 Difference]: Without dead ends: 470 [2019-10-02 13:54:01,300 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 13:54:01,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-10-02 13:54:01,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2019-10-02 13:54:01,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-10-02 13:54:01,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 651 transitions. [2019-10-02 13:54:01,452 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 651 transitions. Word has length 154 [2019-10-02 13:54:01,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:54:01,456 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 651 transitions. [2019-10-02 13:54:01,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 13:54:01,456 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 651 transitions. [2019-10-02 13:54:01,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-02 13:54:01,469 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:54:01,469 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:54:01,470 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:54:01,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:54:01,471 INFO L82 PathProgramCache]: Analyzing trace with hash -855609359, now seen corresponding path program 1 times [2019-10-02 13:54:01,471 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:54:01,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:54:01,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:01,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:54:01,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:01,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:54:01,664 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 13:54:01,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:54:01,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:54:01,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:54:01,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:54:01,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:54:01,668 INFO L87 Difference]: Start difference. First operand 470 states and 651 transitions. Second operand 3 states. [2019-10-02 13:54:01,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:54:01,722 INFO L93 Difference]: Finished difference Result 678 states and 924 transitions. [2019-10-02 13:54:01,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:54:01,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-10-02 13:54:01,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:54:01,728 INFO L225 Difference]: With dead ends: 678 [2019-10-02 13:54:01,728 INFO L226 Difference]: Without dead ends: 473 [2019-10-02 13:54:01,733 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:54:01,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-10-02 13:54:01,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 472. [2019-10-02 13:54:01,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-10-02 13:54:01,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 653 transitions. [2019-10-02 13:54:01,785 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 653 transitions. Word has length 155 [2019-10-02 13:54:01,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:54:01,786 INFO L475 AbstractCegarLoop]: Abstraction has 472 states and 653 transitions. [2019-10-02 13:54:01,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:54:01,786 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 653 transitions. [2019-10-02 13:54:01,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-02 13:54:01,790 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:54:01,790 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:54:01,791 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:54:01,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:54:01,791 INFO L82 PathProgramCache]: Analyzing trace with hash 85272997, now seen corresponding path program 1 times [2019-10-02 13:54:01,791 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:54:01,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:54:01,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:01,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:54:01,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:01,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:54:01,994 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 13:54:01,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:54:01,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:54:01,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:54:01,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:54:01,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:54:01,996 INFO L87 Difference]: Start difference. First operand 472 states and 653 transitions. Second operand 3 states. [2019-10-02 13:54:02,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:54:02,031 INFO L93 Difference]: Finished difference Result 920 states and 1304 transitions. [2019-10-02 13:54:02,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:54:02,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-10-02 13:54:02,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:54:02,037 INFO L225 Difference]: With dead ends: 920 [2019-10-02 13:54:02,037 INFO L226 Difference]: Without dead ends: 513 [2019-10-02 13:54:02,039 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:54:02,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-10-02 13:54:02,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 512. [2019-10-02 13:54:02,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-10-02 13:54:02,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 722 transitions. [2019-10-02 13:54:02,067 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 722 transitions. Word has length 161 [2019-10-02 13:54:02,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:54:02,067 INFO L475 AbstractCegarLoop]: Abstraction has 512 states and 722 transitions. [2019-10-02 13:54:02,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:54:02,068 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 722 transitions. [2019-10-02 13:54:02,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-02 13:54:02,072 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:54:02,072 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:54:02,072 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:54:02,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:54:02,073 INFO L82 PathProgramCache]: Analyzing trace with hash 549891817, now seen corresponding path program 1 times [2019-10-02 13:54:02,073 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:54:02,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:54:02,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:02,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:54:02,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:54:03,300 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 13:54:03,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:54:03,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-10-02 13:54:03,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-02 13:54:03,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-02 13:54:03,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=858, Unknown=0, NotChecked=0, Total=930 [2019-10-02 13:54:03,304 INFO L87 Difference]: Start difference. First operand 512 states and 722 transitions. Second operand 31 states. [2019-10-02 13:54:08,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:54:08,601 INFO L93 Difference]: Finished difference Result 1474 states and 2120 transitions. [2019-10-02 13:54:08,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-02 13:54:08,601 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 162 [2019-10-02 13:54:08,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:54:08,609 INFO L225 Difference]: With dead ends: 1474 [2019-10-02 13:54:08,610 INFO L226 Difference]: Without dead ends: 998 [2019-10-02 13:54:08,613 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=252, Invalid=3054, Unknown=0, NotChecked=0, Total=3306 [2019-10-02 13:54:08,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2019-10-02 13:54:08,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 768. [2019-10-02 13:54:08,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2019-10-02 13:54:08,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1133 transitions. [2019-10-02 13:54:08,661 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1133 transitions. Word has length 162 [2019-10-02 13:54:08,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:54:08,662 INFO L475 AbstractCegarLoop]: Abstraction has 768 states and 1133 transitions. [2019-10-02 13:54:08,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-02 13:54:08,662 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1133 transitions. [2019-10-02 13:54:08,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-02 13:54:08,668 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:54:08,668 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:54:08,668 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:54:08,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:54:08,669 INFO L82 PathProgramCache]: Analyzing trace with hash 128931203, now seen corresponding path program 1 times [2019-10-02 13:54:08,669 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:54:08,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:54:08,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:08,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:54:08,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:54:09,408 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 13:54:09,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:54:09,408 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:54:09,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:54:09,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:54:09,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 2525 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:54:09,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:54:10,267 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-02 13:54:10,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:54:10,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [31] total 35 [2019-10-02 13:54:10,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-02 13:54:10,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-02 13:54:10,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1102, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 13:54:10,281 INFO L87 Difference]: Start difference. First operand 768 states and 1133 transitions. Second operand 35 states. [2019-10-02 13:54:16,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:54:16,193 INFO L93 Difference]: Finished difference Result 1721 states and 2525 transitions. [2019-10-02 13:54:16,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-02 13:54:16,194 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 163 [2019-10-02 13:54:16,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:54:16,202 INFO L225 Difference]: With dead ends: 1721 [2019-10-02 13:54:16,202 INFO L226 Difference]: Without dead ends: 1004 [2019-10-02 13:54:16,207 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=295, Invalid=3865, Unknown=0, NotChecked=0, Total=4160 [2019-10-02 13:54:16,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2019-10-02 13:54:16,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 772. [2019-10-02 13:54:16,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2019-10-02 13:54:16,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1138 transitions. [2019-10-02 13:54:16,267 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1138 transitions. Word has length 163 [2019-10-02 13:54:16,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:54:16,268 INFO L475 AbstractCegarLoop]: Abstraction has 772 states and 1138 transitions. [2019-10-02 13:54:16,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-02 13:54:16,270 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1138 transitions. [2019-10-02 13:54:16,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-02 13:54:16,274 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:54:16,275 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:54:16,275 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:54:16,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:54:16,275 INFO L82 PathProgramCache]: Analyzing trace with hash -720765904, now seen corresponding path program 1 times [2019-10-02 13:54:16,276 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:54:16,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:54:16,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:16,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:54:16,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:16,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:54:16,841 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 13:54:16,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:54:16,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-10-02 13:54:16,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 13:54:16,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 13:54:16,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2019-10-02 13:54:16,843 INFO L87 Difference]: Start difference. First operand 772 states and 1138 transitions. Second operand 26 states. [2019-10-02 13:54:25,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:54:25,483 INFO L93 Difference]: Finished difference Result 2340 states and 3347 transitions. [2019-10-02 13:54:25,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-10-02 13:54:25,484 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 164 [2019-10-02 13:54:25,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:54:25,501 INFO L225 Difference]: With dead ends: 2340 [2019-10-02 13:54:25,501 INFO L226 Difference]: Without dead ends: 2144 [2019-10-02 13:54:25,508 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1469 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=710, Invalid=5452, Unknown=0, NotChecked=0, Total=6162 [2019-10-02 13:54:25,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2144 states. [2019-10-02 13:54:25,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2144 to 1688. [2019-10-02 13:54:25,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1688 states. [2019-10-02 13:54:25,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1688 states to 1688 states and 2483 transitions. [2019-10-02 13:54:25,641 INFO L78 Accepts]: Start accepts. Automaton has 1688 states and 2483 transitions. Word has length 164 [2019-10-02 13:54:25,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:54:25,642 INFO L475 AbstractCegarLoop]: Abstraction has 1688 states and 2483 transitions. [2019-10-02 13:54:25,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 13:54:25,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1688 states and 2483 transitions. [2019-10-02 13:54:25,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-02 13:54:25,650 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:54:25,650 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:54:25,650 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:54:25,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:54:25,651 INFO L82 PathProgramCache]: Analyzing trace with hash 740705910, now seen corresponding path program 1 times [2019-10-02 13:54:25,651 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:54:25,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:54:25,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:25,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:54:25,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:25,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:54:25,806 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:54:25,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:54:25,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 13:54:25,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 13:54:25,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 13:54:25,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:54:25,808 INFO L87 Difference]: Start difference. First operand 1688 states and 2483 transitions. Second operand 5 states. [2019-10-02 13:54:25,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:54:25,920 INFO L93 Difference]: Finished difference Result 2078 states and 3000 transitions. [2019-10-02 13:54:25,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 13:54:25,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 165 [2019-10-02 13:54:25,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:54:25,935 INFO L225 Difference]: With dead ends: 2078 [2019-10-02 13:54:25,935 INFO L226 Difference]: Without dead ends: 1685 [2019-10-02 13:54:25,939 INFO L640 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-10-02 13:54:25,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1685 states. [2019-10-02 13:54:26,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1685 to 1685. [2019-10-02 13:54:26,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1685 states. [2019-10-02 13:54:26,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1685 states and 2478 transitions. [2019-10-02 13:54:26,051 INFO L78 Accepts]: Start accepts. Automaton has 1685 states and 2478 transitions. Word has length 165 [2019-10-02 13:54:26,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:54:26,052 INFO L475 AbstractCegarLoop]: Abstraction has 1685 states and 2478 transitions. [2019-10-02 13:54:26,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 13:54:26,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1685 states and 2478 transitions. [2019-10-02 13:54:26,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-02 13:54:26,059 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:54:26,059 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:54:26,059 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:54:26,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:54:26,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1032194206, now seen corresponding path program 1 times [2019-10-02 13:54:26,060 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:54:26,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:54:26,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:26,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:54:26,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:26,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:54:26,269 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:54:26,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:54:26,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 13:54:26,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 13:54:26,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 13:54:26,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 13:54:26,271 INFO L87 Difference]: Start difference. First operand 1685 states and 2478 transitions. Second operand 11 states. [2019-10-02 13:54:26,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:54:26,855 INFO L93 Difference]: Finished difference Result 2351 states and 3398 transitions. [2019-10-02 13:54:26,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 13:54:26,856 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 165 [2019-10-02 13:54:26,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:54:26,873 INFO L225 Difference]: With dead ends: 2351 [2019-10-02 13:54:26,873 INFO L226 Difference]: Without dead ends: 1765 [2019-10-02 13:54:26,878 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-10-02 13:54:26,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2019-10-02 13:54:27,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1765. [2019-10-02 13:54:27,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1765 states. [2019-10-02 13:54:27,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 2604 transitions. [2019-10-02 13:54:27,102 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 2604 transitions. Word has length 165 [2019-10-02 13:54:27,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:54:27,103 INFO L475 AbstractCegarLoop]: Abstraction has 1765 states and 2604 transitions. [2019-10-02 13:54:27,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 13:54:27,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 2604 transitions. [2019-10-02 13:54:27,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-02 13:54:27,113 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:54:27,114 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:54:27,114 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:54:27,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:54:27,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1814174100, now seen corresponding path program 1 times [2019-10-02 13:54:27,115 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:54:27,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:54:27,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:27,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:54:27,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:27,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:54:27,283 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:54:27,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:54:27,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 13:54:27,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 13:54:27,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 13:54:27,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:54:27,285 INFO L87 Difference]: Start difference. First operand 1765 states and 2604 transitions. Second operand 5 states. [2019-10-02 13:54:28,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:54:28,298 INFO L93 Difference]: Finished difference Result 4217 states and 6112 transitions. [2019-10-02 13:54:28,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 13:54:28,299 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 165 [2019-10-02 13:54:28,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:54:28,324 INFO L225 Difference]: With dead ends: 4217 [2019-10-02 13:54:28,324 INFO L226 Difference]: Without dead ends: 3584 [2019-10-02 13:54:28,330 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:54:28,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3584 states. [2019-10-02 13:54:28,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3584 to 3324. [2019-10-02 13:54:28,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3324 states. [2019-10-02 13:54:28,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3324 states to 3324 states and 4809 transitions. [2019-10-02 13:54:28,557 INFO L78 Accepts]: Start accepts. Automaton has 3324 states and 4809 transitions. Word has length 165 [2019-10-02 13:54:28,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:54:28,558 INFO L475 AbstractCegarLoop]: Abstraction has 3324 states and 4809 transitions. [2019-10-02 13:54:28,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 13:54:28,558 INFO L276 IsEmpty]: Start isEmpty. Operand 3324 states and 4809 transitions. [2019-10-02 13:54:28,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-02 13:54:28,570 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:54:28,570 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:54:28,570 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:54:28,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:54:28,571 INFO L82 PathProgramCache]: Analyzing trace with hash -195929741, now seen corresponding path program 1 times [2019-10-02 13:54:28,571 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:54:28,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:54:28,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:28,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:54:28,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:28,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:54:28,846 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 13:54:28,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:54:28,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 13:54:28,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 13:54:28,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 13:54:28,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 13:54:28,848 INFO L87 Difference]: Start difference. First operand 3324 states and 4809 transitions. Second operand 9 states. [2019-10-02 13:54:29,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:54:29,327 INFO L93 Difference]: Finished difference Result 3771 states and 5413 transitions. [2019-10-02 13:54:29,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 13:54:29,328 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 165 [2019-10-02 13:54:29,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:54:29,340 INFO L225 Difference]: With dead ends: 3771 [2019-10-02 13:54:29,340 INFO L226 Difference]: Without dead ends: 1258 [2019-10-02 13:54:29,359 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-10-02 13:54:29,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2019-10-02 13:54:29,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1256. [2019-10-02 13:54:29,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2019-10-02 13:54:29,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1797 transitions. [2019-10-02 13:54:29,579 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1797 transitions. Word has length 165 [2019-10-02 13:54:29,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:54:29,579 INFO L475 AbstractCegarLoop]: Abstraction has 1256 states and 1797 transitions. [2019-10-02 13:54:29,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 13:54:29,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1797 transitions. [2019-10-02 13:54:29,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-02 13:54:29,590 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:54:29,591 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:54:29,591 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:54:29,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:54:29,592 INFO L82 PathProgramCache]: Analyzing trace with hash -822700062, now seen corresponding path program 2 times [2019-10-02 13:54:29,592 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:54:29,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:54:29,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:29,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:54:29,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:29,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:54:30,153 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 13:54:30,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:54:30,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-10-02 13:54:30,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 13:54:30,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 13:54:30,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2019-10-02 13:54:30,157 INFO L87 Difference]: Start difference. First operand 1256 states and 1797 transitions. Second operand 24 states. [2019-10-02 13:54:38,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:54:38,630 INFO L93 Difference]: Finished difference Result 5160 states and 7420 transitions. [2019-10-02 13:54:38,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-10-02 13:54:38,636 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 165 [2019-10-02 13:54:38,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:54:38,666 INFO L225 Difference]: With dead ends: 5160 [2019-10-02 13:54:38,666 INFO L226 Difference]: Without dead ends: 4541 [2019-10-02 13:54:38,674 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1608 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=755, Invalid=5565, Unknown=0, NotChecked=0, Total=6320 [2019-10-02 13:54:38,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4541 states. [2019-10-02 13:54:38,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4541 to 3319. [2019-10-02 13:54:38,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3319 states. [2019-10-02 13:54:39,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3319 states to 3319 states and 4801 transitions. [2019-10-02 13:54:39,003 INFO L78 Accepts]: Start accepts. Automaton has 3319 states and 4801 transitions. Word has length 165 [2019-10-02 13:54:39,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:54:39,004 INFO L475 AbstractCegarLoop]: Abstraction has 3319 states and 4801 transitions. [2019-10-02 13:54:39,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 13:54:39,004 INFO L276 IsEmpty]: Start isEmpty. Operand 3319 states and 4801 transitions. [2019-10-02 13:54:39,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-02 13:54:39,014 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:54:39,014 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:54:39,014 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:54:39,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:54:39,015 INFO L82 PathProgramCache]: Analyzing trace with hash 939078657, now seen corresponding path program 2 times [2019-10-02 13:54:39,015 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:54:39,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:54:39,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:39,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 13:54:39,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:39,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:54:39,231 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 13:54:39,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:54:39,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 13:54:39,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 13:54:39,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 13:54:39,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:54:39,232 INFO L87 Difference]: Start difference. First operand 3319 states and 4801 transitions. Second operand 7 states. [2019-10-02 13:54:39,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:54:39,503 INFO L93 Difference]: Finished difference Result 3766 states and 5405 transitions. [2019-10-02 13:54:39,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 13:54:39,504 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 166 [2019-10-02 13:54:39,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:54:39,512 INFO L225 Difference]: With dead ends: 3766 [2019-10-02 13:54:39,513 INFO L226 Difference]: Without dead ends: 1258 [2019-10-02 13:54:39,521 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-02 13:54:39,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2019-10-02 13:54:39,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1256. [2019-10-02 13:54:39,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2019-10-02 13:54:39,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1796 transitions. [2019-10-02 13:54:39,593 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1796 transitions. Word has length 166 [2019-10-02 13:54:39,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:54:39,595 INFO L475 AbstractCegarLoop]: Abstraction has 1256 states and 1796 transitions. [2019-10-02 13:54:39,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 13:54:39,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1796 transitions. [2019-10-02 13:54:39,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-02 13:54:39,602 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:54:39,603 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:54:39,603 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:54:39,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:54:39,604 INFO L82 PathProgramCache]: Analyzing trace with hash 968579435, now seen corresponding path program 3 times [2019-10-02 13:54:39,604 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:54:39,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:54:39,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:39,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 13:54:39,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:39,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:54:40,155 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 13:54:40,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:54:40,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-10-02 13:54:40,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 13:54:40,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 13:54:40,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2019-10-02 13:54:40,158 INFO L87 Difference]: Start difference. First operand 1256 states and 1796 transitions. Second operand 26 states. [2019-10-02 13:54:48,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:54:48,120 INFO L93 Difference]: Finished difference Result 5167 states and 7427 transitions. [2019-10-02 13:54:48,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-10-02 13:54:48,121 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 166 [2019-10-02 13:54:48,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:54:48,149 INFO L225 Difference]: With dead ends: 5167 [2019-10-02 13:54:48,149 INFO L226 Difference]: Without dead ends: 4548 [2019-10-02 13:54:48,157 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1461 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=710, Invalid=5452, Unknown=0, NotChecked=0, Total=6162 [2019-10-02 13:54:48,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4548 states. [2019-10-02 13:54:48,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4548 to 3324. [2019-10-02 13:54:48,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3324 states. [2019-10-02 13:54:48,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3324 states to 3324 states and 4806 transitions. [2019-10-02 13:54:48,411 INFO L78 Accepts]: Start accepts. Automaton has 3324 states and 4806 transitions. Word has length 166 [2019-10-02 13:54:48,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:54:48,411 INFO L475 AbstractCegarLoop]: Abstraction has 3324 states and 4806 transitions. [2019-10-02 13:54:48,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 13:54:48,411 INFO L276 IsEmpty]: Start isEmpty. Operand 3324 states and 4806 transitions. [2019-10-02 13:54:48,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-02 13:54:48,420 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:54:48,420 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:54:48,421 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:54:48,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:54:48,421 INFO L82 PathProgramCache]: Analyzing trace with hash 634168216, now seen corresponding path program 3 times [2019-10-02 13:54:48,421 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:54:48,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:54:48,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:48,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 13:54:48,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:48,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:54:48,587 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 13:54:48,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:54:48,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 13:54:48,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 13:54:48,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 13:54:48,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 13:54:48,590 INFO L87 Difference]: Start difference. First operand 3324 states and 4806 transitions. Second operand 9 states. [2019-10-02 13:54:48,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:54:48,944 INFO L93 Difference]: Finished difference Result 3773 states and 5412 transitions. [2019-10-02 13:54:48,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 13:54:48,945 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 167 [2019-10-02 13:54:48,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:54:48,952 INFO L225 Difference]: With dead ends: 3773 [2019-10-02 13:54:48,953 INFO L226 Difference]: Without dead ends: 1260 [2019-10-02 13:54:48,962 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-10-02 13:54:48,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2019-10-02 13:54:49,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 1256. [2019-10-02 13:54:49,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2019-10-02 13:54:49,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1795 transitions. [2019-10-02 13:54:49,026 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1795 transitions. Word has length 167 [2019-10-02 13:54:49,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:54:49,026 INFO L475 AbstractCegarLoop]: Abstraction has 1256 states and 1795 transitions. [2019-10-02 13:54:49,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 13:54:49,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1795 transitions. [2019-10-02 13:54:49,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-02 13:54:49,031 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:54:49,031 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:54:49,031 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:54:49,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:54:49,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1107777252, now seen corresponding path program 1 times [2019-10-02 13:54:49,032 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:54:49,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:54:49,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:49,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 13:54:49,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:54:49,606 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 13:54:49,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:54:49,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-10-02 13:54:49,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 13:54:49,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 13:54:49,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2019-10-02 13:54:49,608 INFO L87 Difference]: Start difference. First operand 1256 states and 1795 transitions. Second operand 24 states. [2019-10-02 13:54:57,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:54:57,845 INFO L93 Difference]: Finished difference Result 5722 states and 8318 transitions. [2019-10-02 13:54:57,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-10-02 13:54:57,846 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 167 [2019-10-02 13:54:57,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:54:57,869 INFO L225 Difference]: With dead ends: 5722 [2019-10-02 13:54:57,869 INFO L226 Difference]: Without dead ends: 4555 [2019-10-02 13:54:57,878 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1660 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=767, Invalid=5713, Unknown=0, NotChecked=0, Total=6480 [2019-10-02 13:54:57,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4555 states. [2019-10-02 13:54:58,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4555 to 3321. [2019-10-02 13:54:58,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3321 states. [2019-10-02 13:54:58,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3321 states to 3321 states and 4803 transitions. [2019-10-02 13:54:58,169 INFO L78 Accepts]: Start accepts. Automaton has 3321 states and 4803 transitions. Word has length 167 [2019-10-02 13:54:58,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:54:58,169 INFO L475 AbstractCegarLoop]: Abstraction has 3321 states and 4803 transitions. [2019-10-02 13:54:58,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 13:54:58,170 INFO L276 IsEmpty]: Start isEmpty. Operand 3321 states and 4803 transitions. [2019-10-02 13:54:58,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-02 13:54:58,178 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:54:58,179 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:54:58,179 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:54:58,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:54:58,179 INFO L82 PathProgramCache]: Analyzing trace with hash 654333247, now seen corresponding path program 1 times [2019-10-02 13:54:58,179 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:54:58,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:54:58,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:58,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:54:58,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:54:58,342 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 13:54:58,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:54:58,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 13:54:58,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 13:54:58,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 13:54:58,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:54:58,346 INFO L87 Difference]: Start difference. First operand 3321 states and 4803 transitions. Second operand 7 states. [2019-10-02 13:54:58,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:54:58,637 INFO L93 Difference]: Finished difference Result 3772 states and 5412 transitions. [2019-10-02 13:54:58,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 13:54:58,638 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 168 [2019-10-02 13:54:58,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:54:58,644 INFO L225 Difference]: With dead ends: 3772 [2019-10-02 13:54:58,645 INFO L226 Difference]: Without dead ends: 1264 [2019-10-02 13:54:58,654 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-02 13:54:58,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states. [2019-10-02 13:54:58,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 1258. [2019-10-02 13:54:58,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1258 states. [2019-10-02 13:54:58,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1798 transitions. [2019-10-02 13:54:58,723 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1798 transitions. Word has length 168 [2019-10-02 13:54:58,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:54:58,724 INFO L475 AbstractCegarLoop]: Abstraction has 1258 states and 1798 transitions. [2019-10-02 13:54:58,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 13:54:58,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1798 transitions. [2019-10-02 13:54:58,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-02 13:54:58,728 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:54:58,729 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:54:58,729 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:54:58,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:54:58,729 INFO L82 PathProgramCache]: Analyzing trace with hash 127346286, now seen corresponding path program 1 times [2019-10-02 13:54:58,729 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:54:58,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:54:58,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:58,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:54:58,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:58,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:54:59,037 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 13:54:59,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:54:59,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-02 13:54:59,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 13:54:59,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 13:54:59,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:54:59,039 INFO L87 Difference]: Start difference. First operand 1258 states and 1798 transitions. Second operand 18 states. [2019-10-02 13:55:03,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:55:03,375 INFO L93 Difference]: Finished difference Result 3275 states and 4661 transitions. [2019-10-02 13:55:03,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-02 13:55:03,376 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 168 [2019-10-02 13:55:03,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:55:03,402 INFO L225 Difference]: With dead ends: 3275 [2019-10-02 13:55:03,403 INFO L226 Difference]: Without dead ends: 2656 [2019-10-02 13:55:03,408 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=250, Invalid=1472, Unknown=0, NotChecked=0, Total=1722 [2019-10-02 13:55:03,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2656 states. [2019-10-02 13:55:03,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2656 to 2590. [2019-10-02 13:55:03,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2590 states. [2019-10-02 13:55:03,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2590 states to 2590 states and 3701 transitions. [2019-10-02 13:55:03,620 INFO L78 Accepts]: Start accepts. Automaton has 2590 states and 3701 transitions. Word has length 168 [2019-10-02 13:55:03,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:55:03,621 INFO L475 AbstractCegarLoop]: Abstraction has 2590 states and 3701 transitions. [2019-10-02 13:55:03,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 13:55:03,621 INFO L276 IsEmpty]: Start isEmpty. Operand 2590 states and 3701 transitions. [2019-10-02 13:55:03,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-10-02 13:55:03,627 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:55:03,627 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:55:03,628 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:55:03,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:55:03,629 INFO L82 PathProgramCache]: Analyzing trace with hash 325744373, now seen corresponding path program 1 times [2019-10-02 13:55:03,629 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:55:03,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:55:03,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:03,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:55:03,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:03,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:55:03,877 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 13:55:03,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:55:03,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 13:55:03,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 13:55:03,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 13:55:03,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 13:55:03,880 INFO L87 Difference]: Start difference. First operand 2590 states and 3701 transitions. Second operand 9 states. [2019-10-02 13:55:04,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:55:04,394 INFO L93 Difference]: Finished difference Result 5109 states and 7320 transitions. [2019-10-02 13:55:04,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 13:55:04,394 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 169 [2019-10-02 13:55:04,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:55:04,405 INFO L225 Difference]: With dead ends: 5109 [2019-10-02 13:55:04,405 INFO L226 Difference]: Without dead ends: 2594 [2019-10-02 13:55:04,415 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-10-02 13:55:04,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2594 states. [2019-10-02 13:55:04,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2594 to 2590. [2019-10-02 13:55:04,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2590 states. [2019-10-02 13:55:04,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2590 states to 2590 states and 3700 transitions. [2019-10-02 13:55:04,579 INFO L78 Accepts]: Start accepts. Automaton has 2590 states and 3700 transitions. Word has length 169 [2019-10-02 13:55:04,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:55:04,580 INFO L475 AbstractCegarLoop]: Abstraction has 2590 states and 3700 transitions. [2019-10-02 13:55:04,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 13:55:04,580 INFO L276 IsEmpty]: Start isEmpty. Operand 2590 states and 3700 transitions. [2019-10-02 13:55:04,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-10-02 13:55:04,586 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:55:04,586 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:55:04,586 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:55:04,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:55:04,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1632886771, now seen corresponding path program 1 times [2019-10-02 13:55:04,587 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:55:04,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:55:04,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:04,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:55:04,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:04,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:55:04,721 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:55:04,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:55:04,722 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:55:04,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:55:05,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:55:05,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 2530 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 13:55:05,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:55:05,266 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 13:55:05,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:55:05,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-02 13:55:05,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 13:55:05,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 13:55:05,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:55:05,277 INFO L87 Difference]: Start difference. First operand 2590 states and 3700 transitions. Second operand 5 states. [2019-10-02 13:55:05,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:55:05,433 INFO L93 Difference]: Finished difference Result 4427 states and 6228 transitions. [2019-10-02 13:55:05,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 13:55:05,434 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 169 [2019-10-02 13:55:05,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:55:05,444 INFO L225 Difference]: With dead ends: 4427 [2019-10-02 13:55:05,444 INFO L226 Difference]: Without dead ends: 2660 [2019-10-02 13:55:05,451 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:55:05,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2660 states. [2019-10-02 13:55:05,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2660 to 2653. [2019-10-02 13:55:05,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2653 states. [2019-10-02 13:55:05,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2653 states to 2653 states and 3803 transitions. [2019-10-02 13:55:05,620 INFO L78 Accepts]: Start accepts. Automaton has 2653 states and 3803 transitions. Word has length 169 [2019-10-02 13:55:05,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:55:05,621 INFO L475 AbstractCegarLoop]: Abstraction has 2653 states and 3803 transitions. [2019-10-02 13:55:05,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 13:55:05,621 INFO L276 IsEmpty]: Start isEmpty. Operand 2653 states and 3803 transitions. [2019-10-02 13:55:05,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-02 13:55:05,629 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:55:05,629 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:55:05,629 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:55:05,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:55:05,630 INFO L82 PathProgramCache]: Analyzing trace with hash 2080404502, now seen corresponding path program 1 times [2019-10-02 13:55:05,630 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:55:05,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:55:05,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:05,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:55:05,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:05,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:55:05,741 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:55:05,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:55:05,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:55:05,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:55:05,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:55:05,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:55:05,743 INFO L87 Difference]: Start difference. First operand 2653 states and 3803 transitions. Second operand 3 states. [2019-10-02 13:55:05,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:55:05,926 INFO L93 Difference]: Finished difference Result 5450 states and 7937 transitions. [2019-10-02 13:55:05,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:55:05,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-10-02 13:55:05,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:55:05,938 INFO L225 Difference]: With dead ends: 5450 [2019-10-02 13:55:05,938 INFO L226 Difference]: Without dead ends: 2901 [2019-10-02 13:55:05,947 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:55:05,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2019-10-02 13:55:06,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 2898. [2019-10-02 13:55:06,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2898 states. [2019-10-02 13:55:06,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 4245 transitions. [2019-10-02 13:55:06,132 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 4245 transitions. Word has length 175 [2019-10-02 13:55:06,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:55:06,132 INFO L475 AbstractCegarLoop]: Abstraction has 2898 states and 4245 transitions. [2019-10-02 13:55:06,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:55:06,133 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 4245 transitions. [2019-10-02 13:55:06,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-02 13:55:06,142 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:55:06,142 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-10-02 13:55:06,142 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:55:06,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:55:06,143 INFO L82 PathProgramCache]: Analyzing trace with hash -424475495, now seen corresponding path program 2 times [2019-10-02 13:55:06,143 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:55:06,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:55:06,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:06,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:55:06,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:55:06,279 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:55:06,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:55:06,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 13:55:06,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 13:55:06,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 13:55:06,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 13:55:06,281 INFO L87 Difference]: Start difference. First operand 2898 states and 4245 transitions. Second operand 6 states. [2019-10-02 13:55:06,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:55:06,442 INFO L93 Difference]: Finished difference Result 5645 states and 8289 transitions. [2019-10-02 13:55:06,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 13:55:06,442 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2019-10-02 13:55:06,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:55:06,454 INFO L225 Difference]: With dead ends: 5645 [2019-10-02 13:55:06,454 INFO L226 Difference]: Without dead ends: 2901 [2019-10-02 13:55:06,465 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 13:55:06,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2019-10-02 13:55:06,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 2898. [2019-10-02 13:55:06,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2898 states. [2019-10-02 13:55:06,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 4239 transitions. [2019-10-02 13:55:06,651 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 4239 transitions. Word has length 176 [2019-10-02 13:55:06,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:55:06,651 INFO L475 AbstractCegarLoop]: Abstraction has 2898 states and 4239 transitions. [2019-10-02 13:55:06,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 13:55:06,652 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 4239 transitions. [2019-10-02 13:55:06,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-02 13:55:06,659 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:55:06,659 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:55:06,659 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:55:06,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:55:06,660 INFO L82 PathProgramCache]: Analyzing trace with hash -399517656, now seen corresponding path program 1 times [2019-10-02 13:55:06,660 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:55:06,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:55:06,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:06,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 13:55:06,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:06,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:55:06,771 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:55:06,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:55:06,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:55:06,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:55:06,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:55:06,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:55:06,773 INFO L87 Difference]: Start difference. First operand 2898 states and 4239 transitions. Second operand 3 states. [2019-10-02 13:55:06,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:55:06,952 INFO L93 Difference]: Finished difference Result 6147 states and 9188 transitions. [2019-10-02 13:55:06,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:55:06,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-10-02 13:55:06,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:55:06,969 INFO L225 Difference]: With dead ends: 6147 [2019-10-02 13:55:06,970 INFO L226 Difference]: Without dead ends: 3359 [2019-10-02 13:55:06,981 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:55:06,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3359 states. [2019-10-02 13:55:07,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3359 to 3356. [2019-10-02 13:55:07,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3356 states. [2019-10-02 13:55:07,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3356 states to 3356 states and 5062 transitions. [2019-10-02 13:55:07,202 INFO L78 Accepts]: Start accepts. Automaton has 3356 states and 5062 transitions. Word has length 176 [2019-10-02 13:55:07,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:55:07,202 INFO L475 AbstractCegarLoop]: Abstraction has 3356 states and 5062 transitions. [2019-10-02 13:55:07,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:55:07,202 INFO L276 IsEmpty]: Start isEmpty. Operand 3356 states and 5062 transitions. [2019-10-02 13:55:07,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-10-02 13:55:07,212 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:55:07,212 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:55:07,212 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:55:07,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:55:07,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1245093688, now seen corresponding path program 1 times [2019-10-02 13:55:07,213 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:55:07,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:55:07,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:07,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:55:07,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:55:07,315 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:55:07,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:55:07,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:55:07,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:55:07,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:55:07,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:55:07,317 INFO L87 Difference]: Start difference. First operand 3356 states and 5062 transitions. Second operand 3 states. [2019-10-02 13:55:07,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:55:07,538 INFO L93 Difference]: Finished difference Result 7479 states and 11564 transitions. [2019-10-02 13:55:07,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:55:07,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2019-10-02 13:55:07,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:55:07,604 INFO L225 Difference]: With dead ends: 7479 [2019-10-02 13:55:07,604 INFO L226 Difference]: Without dead ends: 4241 [2019-10-02 13:55:07,613 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:55:07,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4241 states. [2019-10-02 13:55:07,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4241 to 4238. [2019-10-02 13:55:07,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4238 states. [2019-10-02 13:55:07,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4238 states to 4238 states and 6615 transitions. [2019-10-02 13:55:07,877 INFO L78 Accepts]: Start accepts. Automaton has 4238 states and 6615 transitions. Word has length 177 [2019-10-02 13:55:07,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:55:07,877 INFO L475 AbstractCegarLoop]: Abstraction has 4238 states and 6615 transitions. [2019-10-02 13:55:07,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:55:07,878 INFO L276 IsEmpty]: Start isEmpty. Operand 4238 states and 6615 transitions. [2019-10-02 13:55:07,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-02 13:55:07,892 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:55:07,892 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:55:07,893 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:55:07,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:55:07,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1498226824, now seen corresponding path program 1 times [2019-10-02 13:55:07,893 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:55:07,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:55:07,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:07,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:55:07,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:07,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:55:07,998 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:55:07,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:55:07,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:55:07,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:55:07,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:55:08,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:55:08,000 INFO L87 Difference]: Start difference. First operand 4238 states and 6615 transitions. Second operand 3 states. [2019-10-02 13:55:08,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:55:08,251 INFO L93 Difference]: Finished difference Result 10035 states and 16058 transitions. [2019-10-02 13:55:08,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:55:08,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-10-02 13:55:08,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:55:08,275 INFO L225 Difference]: With dead ends: 10035 [2019-10-02 13:55:08,275 INFO L226 Difference]: Without dead ends: 5927 [2019-10-02 13:55:08,286 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:55:08,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5927 states. [2019-10-02 13:55:08,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5927 to 5924. [2019-10-02 13:55:08,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5924 states. [2019-10-02 13:55:08,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5924 states to 5924 states and 9548 transitions. [2019-10-02 13:55:08,687 INFO L78 Accepts]: Start accepts. Automaton has 5924 states and 9548 transitions. Word has length 178 [2019-10-02 13:55:08,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:55:08,687 INFO L475 AbstractCegarLoop]: Abstraction has 5924 states and 9548 transitions. [2019-10-02 13:55:08,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:55:08,688 INFO L276 IsEmpty]: Start isEmpty. Operand 5924 states and 9548 transitions. [2019-10-02 13:55:08,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-02 13:55:08,714 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:55:08,716 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:55:08,716 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:55:08,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:55:08,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1989404968, now seen corresponding path program 1 times [2019-10-02 13:55:08,716 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:55:08,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:55:08,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:08,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:55:08,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:08,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:55:08,836 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:55:08,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:55:08,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:55:08,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:55:08,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:55:08,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:55:08,838 INFO L87 Difference]: Start difference. First operand 5924 states and 9548 transitions. Second operand 3 states. [2019-10-02 13:55:09,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:55:09,248 INFO L93 Difference]: Finished difference Result 15123 states and 24935 transitions. [2019-10-02 13:55:09,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:55:09,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 179 [2019-10-02 13:55:09,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:55:09,280 INFO L225 Difference]: With dead ends: 15123 [2019-10-02 13:55:09,280 INFO L226 Difference]: Without dead ends: 9337 [2019-10-02 13:55:09,293 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:55:09,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9337 states. [2019-10-02 13:55:09,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9337 to 9334. [2019-10-02 13:55:09,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9334 states. [2019-10-02 13:55:09,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9334 states to 9334 states and 15453 transitions. [2019-10-02 13:55:09,822 INFO L78 Accepts]: Start accepts. Automaton has 9334 states and 15453 transitions. Word has length 179 [2019-10-02 13:55:09,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:55:09,823 INFO L475 AbstractCegarLoop]: Abstraction has 9334 states and 15453 transitions. [2019-10-02 13:55:09,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:55:09,823 INFO L276 IsEmpty]: Start isEmpty. Operand 9334 states and 15453 transitions. [2019-10-02 13:55:09,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-02 13:55:09,861 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:55:09,861 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:55:09,862 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:55:09,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:55:09,862 INFO L82 PathProgramCache]: Analyzing trace with hash 504785128, now seen corresponding path program 1 times [2019-10-02 13:55:09,862 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:55:09,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:55:09,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:09,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:55:09,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:09,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:55:09,968 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:55:09,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:55:09,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:55:09,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:55:09,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:55:09,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:55:09,970 INFO L87 Difference]: Start difference. First operand 9334 states and 15453 transitions. Second operand 3 states. [2019-10-02 13:55:10,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:55:10,631 INFO L93 Difference]: Finished difference Result 24865 states and 41873 transitions. [2019-10-02 13:55:10,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:55:10,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-10-02 13:55:10,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:55:10,694 INFO L225 Difference]: With dead ends: 24865 [2019-10-02 13:55:10,695 INFO L226 Difference]: Without dead ends: 15675 [2019-10-02 13:55:10,716 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:55:10,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15675 states. [2019-10-02 13:55:11,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15675 to 15672. [2019-10-02 13:55:11,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15672 states. [2019-10-02 13:55:11,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15672 states to 15672 states and 26398 transitions. [2019-10-02 13:55:11,484 INFO L78 Accepts]: Start accepts. Automaton has 15672 states and 26398 transitions. Word has length 180 [2019-10-02 13:55:11,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:55:11,485 INFO L475 AbstractCegarLoop]: Abstraction has 15672 states and 26398 transitions. [2019-10-02 13:55:11,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:55:11,485 INFO L276 IsEmpty]: Start isEmpty. Operand 15672 states and 26398 transitions. [2019-10-02 13:55:11,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-02 13:55:11,522 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:55:11,522 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-10-02 13:55:11,522 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:55:11,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:55:11,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1215101332, now seen corresponding path program 1 times [2019-10-02 13:55:11,523 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:55:11,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:55:11,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:11,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:55:11,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:11,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:55:11,644 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 13:55:11,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:55:11,645 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:55:11,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:55:12,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:55:12,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 2594 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 13:55:12,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:55:13,008 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 13:55:13,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:55:13,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-02 13:55:13,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 13:55:13,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 13:55:13,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-02 13:55:13,018 INFO L87 Difference]: Start difference. First operand 15672 states and 26398 transitions. Second operand 6 states. [2019-10-02 13:55:13,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:55:13,565 INFO L93 Difference]: Finished difference Result 18329 states and 30238 transitions. [2019-10-02 13:55:13,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 13:55:13,566 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 187 [2019-10-02 13:55:13,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:55:13,622 INFO L225 Difference]: With dead ends: 18329 [2019-10-02 13:55:13,622 INFO L226 Difference]: Without dead ends: 16562 [2019-10-02 13:55:13,635 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-02 13:55:13,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16562 states. [2019-10-02 13:55:14,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16562 to 16483. [2019-10-02 13:55:14,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16483 states. [2019-10-02 13:55:14,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16483 states to 16483 states and 27672 transitions. [2019-10-02 13:55:14,691 INFO L78 Accepts]: Start accepts. Automaton has 16483 states and 27672 transitions. Word has length 187 [2019-10-02 13:55:14,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:55:14,691 INFO L475 AbstractCegarLoop]: Abstraction has 16483 states and 27672 transitions. [2019-10-02 13:55:14,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 13:55:14,691 INFO L276 IsEmpty]: Start isEmpty. Operand 16483 states and 27672 transitions. [2019-10-02 13:55:14,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-02 13:55:14,731 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:55:14,731 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:55:14,731 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:55:14,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:55:14,732 INFO L82 PathProgramCache]: Analyzing trace with hash -177487174, now seen corresponding path program 1 times [2019-10-02 13:55:14,732 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:55:14,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:55:14,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:14,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:55:14,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:14,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:55:14,848 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:55:14,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:55:14,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:55:14,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:55:14,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:55:14,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:55:14,850 INFO L87 Difference]: Start difference. First operand 16483 states and 27672 transitions. Second operand 3 states. [2019-10-02 13:55:16,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:55:16,047 INFO L93 Difference]: Finished difference Result 44529 states and 75706 transitions. [2019-10-02 13:55:16,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:55:16,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-10-02 13:55:16,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:55:16,122 INFO L225 Difference]: With dead ends: 44529 [2019-10-02 13:55:16,122 INFO L226 Difference]: Without dead ends: 28664 [2019-10-02 13:55:16,160 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:55:16,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28664 states. [2019-10-02 13:55:17,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28664 to 28661. [2019-10-02 13:55:17,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28661 states. [2019-10-02 13:55:17,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28661 states to 28661 states and 48505 transitions. [2019-10-02 13:55:17,585 INFO L78 Accepts]: Start accepts. Automaton has 28661 states and 48505 transitions. Word has length 181 [2019-10-02 13:55:17,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:55:17,586 INFO L475 AbstractCegarLoop]: Abstraction has 28661 states and 48505 transitions. [2019-10-02 13:55:17,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:55:17,586 INFO L276 IsEmpty]: Start isEmpty. Operand 28661 states and 48505 transitions. [2019-10-02 13:55:17,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-10-02 13:55:17,642 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:55:17,643 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:55:17,643 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:55:17,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:55:17,643 INFO L82 PathProgramCache]: Analyzing trace with hash -50841208, now seen corresponding path program 1 times [2019-10-02 13:55:17,643 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:55:17,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:55:17,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:17,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:55:17,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:55:18,838 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:55:18,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:55:18,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:55:18,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:55:18,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:55:18,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:55:18,840 INFO L87 Difference]: Start difference. First operand 28661 states and 48505 transitions. Second operand 3 states. [2019-10-02 13:55:20,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:55:20,777 INFO L93 Difference]: Finished difference Result 79789 states and 135352 transitions. [2019-10-02 13:55:20,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:55:20,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-10-02 13:55:20,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:55:20,919 INFO L225 Difference]: With dead ends: 79789 [2019-10-02 13:55:20,919 INFO L226 Difference]: Without dead ends: 51878 [2019-10-02 13:55:20,972 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:55:21,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51878 states. [2019-10-02 13:55:23,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51878 to 51875. [2019-10-02 13:55:23,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51875 states. [2019-10-02 13:55:23,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51875 states to 51875 states and 87136 transitions. [2019-10-02 13:55:23,769 INFO L78 Accepts]: Start accepts. Automaton has 51875 states and 87136 transitions. Word has length 182 [2019-10-02 13:55:23,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:55:23,769 INFO L475 AbstractCegarLoop]: Abstraction has 51875 states and 87136 transitions. [2019-10-02 13:55:23,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:55:23,769 INFO L276 IsEmpty]: Start isEmpty. Operand 51875 states and 87136 transitions. [2019-10-02 13:55:23,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-02 13:55:23,834 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:55:23,835 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:55:23,835 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:55:23,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:55:23,835 INFO L82 PathProgramCache]: Analyzing trace with hash 543668762, now seen corresponding path program 1 times [2019-10-02 13:55:23,835 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:55:23,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:55:23,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:23,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:55:23,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:23,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:55:23,958 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:55:23,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:55:23,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:55:23,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:55:23,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:55:23,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:55:23,960 INFO L87 Difference]: Start difference. First operand 51875 states and 87136 transitions. Second operand 3 states. [2019-10-02 13:55:28,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:55:28,324 INFO L93 Difference]: Finished difference Result 146653 states and 247504 transitions. [2019-10-02 13:55:28,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:55:28,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-10-02 13:55:28,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:55:30,940 INFO L225 Difference]: With dead ends: 146653 [2019-10-02 13:55:30,940 INFO L226 Difference]: Without dead ends: 95744 [2019-10-02 13:55:31,026 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:55:31,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95744 states. [2019-10-02 13:55:36,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95744 to 95741. [2019-10-02 13:55:36,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95741 states. [2019-10-02 13:55:36,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95741 states to 95741 states and 160195 transitions. [2019-10-02 13:55:36,389 INFO L78 Accepts]: Start accepts. Automaton has 95741 states and 160195 transitions. Word has length 183 [2019-10-02 13:55:36,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:55:36,389 INFO L475 AbstractCegarLoop]: Abstraction has 95741 states and 160195 transitions. [2019-10-02 13:55:36,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:55:36,389 INFO L276 IsEmpty]: Start isEmpty. Operand 95741 states and 160195 transitions. [2019-10-02 13:55:36,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-10-02 13:55:36,472 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:55:36,472 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:55:36,473 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:55:36,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:55:36,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1500448216, now seen corresponding path program 1 times [2019-10-02 13:55:36,473 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:55:36,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:55:36,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:36,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:55:36,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:36,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:55:36,584 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:55:36,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:55:36,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:55:36,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:55:36,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:55:36,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:55:36,586 INFO L87 Difference]: Start difference. First operand 95741 states and 160195 transitions. Second operand 3 states. [2019-10-02 13:55:45,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:55:45,248 INFO L93 Difference]: Finished difference Result 180611 states and 299536 transitions. [2019-10-02 13:55:45,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:55:45,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-10-02 13:55:45,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:55:45,738 INFO L225 Difference]: With dead ends: 180611 [2019-10-02 13:55:45,738 INFO L226 Difference]: Without dead ends: 178844 [2019-10-02 13:55:45,787 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:55:45,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178844 states. [2019-10-02 13:55:57,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178844 to 178841. [2019-10-02 13:55:57,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178841 states. [2019-10-02 13:55:58,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178841 states to 178841 states and 294027 transitions. [2019-10-02 13:55:58,022 INFO L78 Accepts]: Start accepts. Automaton has 178841 states and 294027 transitions. Word has length 184 [2019-10-02 13:55:58,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:55:58,023 INFO L475 AbstractCegarLoop]: Abstraction has 178841 states and 294027 transitions. [2019-10-02 13:55:58,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:55:58,023 INFO L276 IsEmpty]: Start isEmpty. Operand 178841 states and 294027 transitions. [2019-10-02 13:55:58,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-02 13:55:58,141 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:55:58,142 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:55:58,142 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:55:58,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:55:58,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1796750982, now seen corresponding path program 1 times [2019-10-02 13:55:58,142 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:55:58,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:55:58,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:58,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:55:58,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:58,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:55:58,283 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:55:58,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:55:58,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:55:58,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:55:58,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:55:58,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:55:58,285 INFO L87 Difference]: Start difference. First operand 178841 states and 294027 transitions. Second operand 3 states. [2019-10-02 13:56:08,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:56:08,252 INFO L93 Difference]: Finished difference Result 181189 states and 297261 transitions. [2019-10-02 13:56:08,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:56:08,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-10-02 13:56:08,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:56:08,941 INFO L225 Difference]: With dead ends: 181189 [2019-10-02 13:56:08,941 INFO L226 Difference]: Without dead ends: 179456 [2019-10-02 13:56:08,993 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:56:09,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179456 states. [2019-10-02 13:56:23,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179456 to 179444. [2019-10-02 13:56:23,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179444 states. [2019-10-02 13:56:23,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179444 states to 179444 states and 294834 transitions. [2019-10-02 13:56:23,812 INFO L78 Accepts]: Start accepts. Automaton has 179444 states and 294834 transitions. Word has length 185 [2019-10-02 13:56:23,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:56:23,813 INFO L475 AbstractCegarLoop]: Abstraction has 179444 states and 294834 transitions. [2019-10-02 13:56:23,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:56:23,813 INFO L276 IsEmpty]: Start isEmpty. Operand 179444 states and 294834 transitions. [2019-10-02 13:56:24,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-10-02 13:56:24,424 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:56:24,424 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:56:24,425 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:56:24,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:56:24,425 INFO L82 PathProgramCache]: Analyzing trace with hash -2053446721, now seen corresponding path program 1 times [2019-10-02 13:56:24,425 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:56:24,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:56:24,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:56:24,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:56:24,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:56:24,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:56:24,602 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-10-02 13:56:24,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:56:24,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 13:56:24,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 13:56:24,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 13:56:24,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 13:56:24,605 INFO L87 Difference]: Start difference. First operand 179444 states and 294834 transitions. Second operand 6 states. [2019-10-02 13:56:43,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:56:43,220 INFO L93 Difference]: Finished difference Result 352447 states and 582155 transitions. [2019-10-02 13:56:43,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 13:56:43,221 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 299 [2019-10-02 13:56:43,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:56:45,004 INFO L225 Difference]: With dead ends: 352447 [2019-10-02 13:56:45,004 INFO L226 Difference]: Without dead ends: 350153 [2019-10-02 13:56:45,094 INFO L640 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-10-02 13:56:45,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350153 states. [2019-10-02 13:57:16,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350153 to 350106. [2019-10-02 13:57:16,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350106 states. [2019-10-02 13:57:17,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350106 states to 350106 states and 578977 transitions. [2019-10-02 13:57:17,505 INFO L78 Accepts]: Start accepts. Automaton has 350106 states and 578977 transitions. Word has length 299 [2019-10-02 13:57:17,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:57:17,505 INFO L475 AbstractCegarLoop]: Abstraction has 350106 states and 578977 transitions. [2019-10-02 13:57:17,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 13:57:17,506 INFO L276 IsEmpty]: Start isEmpty. Operand 350106 states and 578977 transitions. [2019-10-02 13:57:18,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-10-02 13:57:18,973 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:57:18,973 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:57:18,973 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:57:18,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:57:18,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1670405569, now seen corresponding path program 1 times [2019-10-02 13:57:18,974 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:57:18,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:57:18,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:57:18,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:57:18,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:57:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:57:20,159 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-10-02 13:57:20,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:57:20,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 13:57:20,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 13:57:20,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 13:57:20,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 13:57:20,161 INFO L87 Difference]: Start difference. First operand 350106 states and 578977 transitions. Second operand 9 states. [2019-10-02 13:57:40,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:57:40,597 INFO L93 Difference]: Finished difference Result 354318 states and 584639 transitions. [2019-10-02 13:57:40,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 13:57:40,597 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 300 [2019-10-02 13:57:40,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:57:41,780 INFO L225 Difference]: With dead ends: 354318 [2019-10-02 13:57:41,780 INFO L226 Difference]: Without dead ends: 349644 [2019-10-02 13:57:41,888 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-10-02 13:57:42,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349644 states. [2019-10-02 13:58:21,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349644 to 349604. [2019-10-02 13:58:21,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349604 states. [2019-10-02 13:58:22,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349604 states to 349604 states and 578235 transitions. [2019-10-02 13:58:22,079 INFO L78 Accepts]: Start accepts. Automaton has 349604 states and 578235 transitions. Word has length 300 [2019-10-02 13:58:22,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:58:22,079 INFO L475 AbstractCegarLoop]: Abstraction has 349604 states and 578235 transitions. [2019-10-02 13:58:22,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 13:58:22,079 INFO L276 IsEmpty]: Start isEmpty. Operand 349604 states and 578235 transitions. [2019-10-02 13:58:24,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-10-02 13:58:24,457 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:58:24,457 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:58:24,458 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:58:24,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:58:24,458 INFO L82 PathProgramCache]: Analyzing trace with hash 893813167, now seen corresponding path program 1 times [2019-10-02 13:58:24,458 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:58:24,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:58:24,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:58:24,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:58:24,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:58:24,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:58:24,647 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-02 13:58:24,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:58:24,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 13:58:24,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 13:58:24,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 13:58:24,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-10-02 13:58:24,649 INFO L87 Difference]: Start difference. First operand 349604 states and 578235 transitions. Second operand 10 states. [2019-10-02 13:58:49,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:58:49,874 INFO L93 Difference]: Finished difference Result 351266 states and 580379 transitions. [2019-10-02 13:58:49,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 13:58:49,875 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 293 [2019-10-02 13:58:49,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:58:51,197 INFO L225 Difference]: With dead ends: 351266 [2019-10-02 13:58:51,197 INFO L226 Difference]: Without dead ends: 347072 [2019-10-02 13:58:51,305 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-10-02 13:58:51,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347072 states. [2019-10-02 13:59:25,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347072 to 343082. [2019-10-02 13:59:25,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343082 states. [2019-10-02 13:59:26,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343082 states to 343082 states and 558129 transitions. [2019-10-02 13:59:26,076 INFO L78 Accepts]: Start accepts. Automaton has 343082 states and 558129 transitions. Word has length 293 [2019-10-02 13:59:26,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:59:26,077 INFO L475 AbstractCegarLoop]: Abstraction has 343082 states and 558129 transitions. [2019-10-02 13:59:26,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 13:59:26,077 INFO L276 IsEmpty]: Start isEmpty. Operand 343082 states and 558129 transitions. [2019-10-02 13:59:29,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-10-02 13:59:29,271 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:59:29,272 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:59:29,272 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:59:29,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:59:29,273 INFO L82 PathProgramCache]: Analyzing trace with hash 950075038, now seen corresponding path program 1 times [2019-10-02 13:59:29,273 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:59:29,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:59:29,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:59:29,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:59:29,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:59:29,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:59:29,510 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-02 13:59:29,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:59:29,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 13:59:29,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 13:59:29,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 13:59:29,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:59:29,513 INFO L87 Difference]: Start difference. First operand 343082 states and 558129 transitions. Second operand 7 states. [2019-10-02 13:59:55,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:59:55,380 INFO L93 Difference]: Finished difference Result 678170 states and 1113272 transitions. [2019-10-02 13:59:55,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 13:59:55,380 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 343 [2019-10-02 13:59:55,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:59:56,624 INFO L225 Difference]: With dead ends: 678170 [2019-10-02 13:59:56,625 INFO L226 Difference]: Without dead ends: 343136 [2019-10-02 13:59:57,198 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:59:57,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343136 states. [2019-10-02 14:00:34,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343136 to 343136. [2019-10-02 14:00:34,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343136 states. [2019-10-02 14:00:36,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343136 states to 343136 states and 558195 transitions. [2019-10-02 14:00:36,400 INFO L78 Accepts]: Start accepts. Automaton has 343136 states and 558195 transitions. Word has length 343 [2019-10-02 14:00:36,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:00:36,401 INFO L475 AbstractCegarLoop]: Abstraction has 343136 states and 558195 transitions. [2019-10-02 14:00:36,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 14:00:36,401 INFO L276 IsEmpty]: Start isEmpty. Operand 343136 states and 558195 transitions. [2019-10-02 14:00:38,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-10-02 14:00:38,049 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:00:38,050 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:00:38,050 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:00:38,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:00:38,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1566235788, now seen corresponding path program 1 times [2019-10-02 14:00:38,050 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:00:38,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:00:38,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:38,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:00:38,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:38,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:00:38,252 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-10-02 14:00:38,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:00:38,252 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:00:38,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:00:38,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:00:38,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 3415 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 14:00:38,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:00:39,028 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-10-02 14:00:39,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:00:39,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2019-10-02 14:00:39,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 14:00:39,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 14:00:39,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:00:39,043 INFO L87 Difference]: Start difference. First operand 343136 states and 558195 transitions. Second operand 11 states. [2019-10-02 14:01:03,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:01:03,881 INFO L93 Difference]: Finished difference Result 355310 states and 576209 transitions. [2019-10-02 14:01:03,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 14:01:03,882 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 344 [2019-10-02 14:01:03,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:01:05,006 INFO L225 Difference]: With dead ends: 355310 [2019-10-02 14:01:05,007 INFO L226 Difference]: Without dead ends: 353571 [2019-10-02 14:01:05,099 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-10-02 14:01:05,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353571 states. [2019-10-02 14:01:35,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353571 to 348791. [2019-10-02 14:01:35,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348791 states. [2019-10-02 14:01:36,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348791 states to 348791 states and 566645 transitions. [2019-10-02 14:01:36,746 INFO L78 Accepts]: Start accepts. Automaton has 348791 states and 566645 transitions. Word has length 344 [2019-10-02 14:01:36,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:01:36,747 INFO L475 AbstractCegarLoop]: Abstraction has 348791 states and 566645 transitions. [2019-10-02 14:01:36,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 14:01:36,747 INFO L276 IsEmpty]: Start isEmpty. Operand 348791 states and 566645 transitions. [2019-10-02 14:01:39,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-10-02 14:01:39,551 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:01:39,551 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:01:39,552 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:01:39,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:01:39,552 INFO L82 PathProgramCache]: Analyzing trace with hash -376865820, now seen corresponding path program 1 times [2019-10-02 14:01:39,552 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:01:39,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:01:39,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:01:39,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:01:39,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:01:39,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:01:39,792 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2019-10-02 14:01:39,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:01:39,792 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:01:39,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:01:40,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:01:40,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 3448 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-02 14:01:40,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:01:41,297 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 77 proven. 16 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-10-02 14:01:41,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:01:41,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 19] total 26 [2019-10-02 14:01:41,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 14:01:41,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 14:01:41,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2019-10-02 14:01:41,317 INFO L87 Difference]: Start difference. First operand 348791 states and 566645 transitions. Second operand 26 states. [2019-10-02 14:02:49,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:02:49,455 INFO L93 Difference]: Finished difference Result 584874 states and 963521 transitions. [2019-10-02 14:02:49,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2019-10-02 14:02:49,456 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 357 [2019-10-02 14:02:49,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:02:51,474 INFO L225 Difference]: With dead ends: 584874 [2019-10-02 14:02:51,475 INFO L226 Difference]: Without dead ends: 580534 [2019-10-02 14:02:51,626 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 405 SyntacticMatches, 1 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10093 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2934, Invalid=22826, Unknown=0, NotChecked=0, Total=25760 [2019-10-02 14:02:51,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580534 states. [2019-10-02 14:03:49,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580534 to 580055. [2019-10-02 14:03:49,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580055 states. [2019-10-02 14:03:52,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580055 states to 580055 states and 957298 transitions. [2019-10-02 14:03:52,177 INFO L78 Accepts]: Start accepts. Automaton has 580055 states and 957298 transitions. Word has length 357 [2019-10-02 14:03:52,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:03:52,177 INFO L475 AbstractCegarLoop]: Abstraction has 580055 states and 957298 transitions. [2019-10-02 14:03:52,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 14:03:52,178 INFO L276 IsEmpty]: Start isEmpty. Operand 580055 states and 957298 transitions. [2019-10-02 14:03:55,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2019-10-02 14:03:55,239 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:03:55,239 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:03:55,239 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:03:55,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:03:55,240 INFO L82 PathProgramCache]: Analyzing trace with hash -2093942565, now seen corresponding path program 1 times [2019-10-02 14:03:55,240 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:03:55,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:03:55,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:03:55,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:03:55,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:03:55,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:03:55,489 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-10-02 14:03:55,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:03:55,490 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:03:55,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:03:56,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:03:56,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 3447 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-02 14:03:56,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:03:56,619 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-10-02 14:03:56,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:03:56,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [9] total 27 [2019-10-02 14:03:56,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-02 14:03:56,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-02 14:03:56,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-10-02 14:03:56,630 INFO L87 Difference]: Start difference. First operand 580055 states and 957298 transitions. Second operand 27 states.