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_spec1_product20.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 04:39:10,179 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 04:39:10,182 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 04:39:10,201 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 04:39:10,202 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 04:39:10,203 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 04:39:10,206 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 04:39:10,219 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 04:39:10,220 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 04:39:10,222 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 04:39:10,225 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 04:39:10,227 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 04:39:10,227 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 04:39:10,229 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 04:39:10,232 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 04:39:10,233 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 04:39:10,233 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 04:39:10,237 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 04:39:10,238 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 04:39:10,243 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 04:39:10,245 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 04:39:10,247 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 04:39:10,248 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 04:39:10,249 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 04:39:10,252 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 04:39:10,252 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 04:39:10,252 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 04:39:10,255 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 04:39:10,257 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 04:39:10,258 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 04:39:10,258 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 04:39:10,260 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 04:39:10,261 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 04:39:10,261 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 04:39:10,266 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 04:39:10,266 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 04:39:10,267 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 04:39:10,267 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 04:39:10,267 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 04:39:10,268 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 04:39:10,269 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 04:39:10,269 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 04:39:10,283 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 04:39:10,284 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 04:39:10,285 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 04:39:10,285 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 04:39:10,285 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 04:39:10,286 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 04:39:10,286 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 04:39:10,286 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 04:39:10,286 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 04:39:10,287 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 04:39:10,287 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 04:39:10,287 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 04:39:10,287 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 04:39:10,287 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 04:39:10,287 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 04:39:10,288 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 04:39:10,288 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 04:39:10,288 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 04:39:10,288 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 04:39:10,289 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 04:39:10,289 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 04:39:10,289 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:39:10,289 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 04:39:10,289 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 04:39:10,290 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 04:39:10,290 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 04:39:10,290 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 04:39:10,290 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 04:39:10,290 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 04:39:10,320 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 04:39:10,337 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 04:39:10,346 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 04:39:10,348 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 04:39:10,348 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 04:39:10,351 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec1_product20.cil.c [2019-09-08 04:39:10,432 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/560f475e1/74884fed66134bdda0b924d9a7eb2701/FLAG54f7618b2 [2019-09-08 04:39:11,110 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 04:39:11,112 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec1_product20.cil.c [2019-09-08 04:39:11,142 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/560f475e1/74884fed66134bdda0b924d9a7eb2701/FLAG54f7618b2 [2019-09-08 04:39:11,333 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/560f475e1/74884fed66134bdda0b924d9a7eb2701 [2019-09-08 04:39:11,344 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 04:39:11,346 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 04:39:11,347 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 04:39:11,347 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 04:39:11,351 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 04:39:11,352 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:39:11" (1/1) ... [2019-09-08 04:39:11,355 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34a4e2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:39:11, skipping insertion in model container [2019-09-08 04:39:11,355 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:39:11" (1/1) ... [2019-09-08 04:39:11,363 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 04:39:11,441 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 04:39:12,209 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:39:12,237 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 04:39:12,341 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:39:12,423 INFO L192 MainTranslator]: Completed translation [2019-09-08 04:39:12,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:39:12 WrapperNode [2019-09-08 04:39:12,424 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 04:39:12,425 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 04:39:12,425 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 04:39:12,425 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 04:39:12,440 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:39:12" (1/1) ... [2019-09-08 04:39:12,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:39:12" (1/1) ... [2019-09-08 04:39:12,474 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:39:12" (1/1) ... [2019-09-08 04:39:12,475 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:39:12" (1/1) ... [2019-09-08 04:39:12,535 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:39:12" (1/1) ... [2019-09-08 04:39:12,576 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:39:12" (1/1) ... [2019-09-08 04:39:12,600 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:39:12" (1/1) ... [2019-09-08 04:39:12,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 04:39:12,625 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 04:39:12,625 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 04:39:12,625 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 04:39:12,627 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:39:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:39:12,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 04:39:12,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 04:39:12,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 04:39:12,701 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-08 04:39:12,702 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-08 04:39:12,702 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-08 04:39:12,703 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-08 04:39:12,703 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-08 04:39:12,703 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-08 04:39:12,703 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-08 04:39:12,703 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-08 04:39:12,704 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-08 04:39:12,704 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-08 04:39:12,705 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-08 04:39:12,705 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-08 04:39:12,706 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-08 04:39:12,708 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-08 04:39:12,708 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-08 04:39:12,708 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-08 04:39:12,709 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-08 04:39:12,709 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-08 04:39:12,709 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-08 04:39:12,709 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-08 04:39:12,709 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-08 04:39:12,710 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-08 04:39:12,710 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-08 04:39:12,710 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-09-08 04:39:12,710 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-08 04:39:12,710 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-08 04:39:12,711 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-09-08 04:39:12,711 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AddressBook [2019-09-08 04:39:12,711 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-08 04:39:12,711 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-08 04:39:12,711 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-08 04:39:12,712 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-08 04:39:12,712 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-08 04:39:12,712 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-08 04:39:12,712 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-08 04:39:12,712 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-08 04:39:12,713 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-08 04:39:12,713 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-09-08 04:39:12,713 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-09-08 04:39:12,713 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-08 04:39:12,714 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-08 04:39:12,714 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-08 04:39:12,714 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-08 04:39:12,714 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-08 04:39:12,714 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-08 04:39:12,715 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 04:39:12,715 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-08 04:39:12,715 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-08 04:39:12,715 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-08 04:39:12,715 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-08 04:39:12,715 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-08 04:39:12,716 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-08 04:39:12,716 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-08 04:39:12,716 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-08 04:39:12,716 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 04:39:12,716 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 04:39:12,716 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-08 04:39:12,717 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-08 04:39:12,717 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-08 04:39:12,717 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-08 04:39:12,717 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-08 04:39:12,717 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-08 04:39:12,717 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-08 04:39:12,718 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-08 04:39:12,718 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-08 04:39:12,718 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-09-08 04:39:12,718 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-09-08 04:39:12,719 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 04:39:12,719 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-08 04:39:12,719 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-08 04:39:12,719 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-08 04:39:12,720 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-08 04:39:12,720 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-08 04:39:12,720 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-08 04:39:12,720 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-08 04:39:12,720 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-08 04:39:12,721 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-08 04:39:12,721 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-08 04:39:12,721 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-08 04:39:12,722 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-08 04:39:12,722 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-08 04:39:12,722 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-08 04:39:12,722 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-08 04:39:12,722 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-08 04:39:12,723 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-08 04:39:12,723 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-08 04:39:12,723 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-08 04:39:12,723 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-08 04:39:12,724 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-08 04:39:12,724 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-08 04:39:12,725 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-08 04:39:12,725 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-08 04:39:12,725 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-08 04:39:12,725 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-08 04:39:12,725 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-08 04:39:12,726 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-08 04:39:12,727 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-08 04:39:12,727 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__AddressBookEncrypt_spec__1 [2019-09-08 04:39:12,727 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 04:39:12,728 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 04:39:12,728 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 04:39:12,729 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 04:39:12,729 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 04:39:12,729 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 04:39:12,729 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 04:39:12,729 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 04:39:12,730 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 04:39:12,730 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 04:39:12,730 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-08 04:39:12,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 04:39:12,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 04:39:12,731 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-08 04:39:12,731 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-08 04:39:12,731 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-08 04:39:12,732 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-08 04:39:12,732 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-08 04:39:12,732 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-08 04:39:12,733 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-08 04:39:12,733 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-08 04:39:12,733 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-08 04:39:12,734 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-08 04:39:12,735 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-08 04:39:12,735 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-08 04:39:12,735 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-08 04:39:12,736 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-08 04:39:12,736 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-08 04:39:12,736 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-08 04:39:12,736 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-08 04:39:12,737 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-08 04:39:12,738 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-08 04:39:12,738 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-08 04:39:12,738 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-08 04:39:12,738 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 04:39:12,739 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-08 04:39:12,739 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-08 04:39:12,740 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-08 04:39:12,741 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-08 04:39:12,745 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-08 04:39:12,746 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-08 04:39:12,746 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-08 04:39:12,746 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-08 04:39:12,752 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-08 04:39:12,752 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-08 04:39:12,752 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-08 04:39:12,752 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-08 04:39:12,752 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-08 04:39:12,753 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-08 04:39:12,753 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-08 04:39:12,753 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-08 04:39:12,753 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-08 04:39:12,753 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-08 04:39:12,753 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-08 04:39:12,753 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-08 04:39:12,754 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-08 04:39:12,754 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-08 04:39:12,754 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-09-08 04:39:12,754 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-09-08 04:39:12,754 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__AddressBookEncrypt_spec__1 [2019-09-08 04:39:12,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 04:39:12,755 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-08 04:39:12,755 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-09-08 04:39:12,755 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-09-08 04:39:12,755 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AddressBook [2019-09-08 04:39:12,756 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-08 04:39:12,756 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-08 04:39:12,756 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-08 04:39:12,756 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-08 04:39:12,756 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-08 04:39:12,756 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 04:39:12,756 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-08 04:39:12,756 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-08 04:39:12,757 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-08 04:39:12,757 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-08 04:39:12,757 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-08 04:39:12,757 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-08 04:39:12,757 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-08 04:39:12,757 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-08 04:39:12,757 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-08 04:39:12,757 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-08 04:39:12,758 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 04:39:12,758 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 04:39:12,758 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 04:39:12,758 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-08 04:39:12,758 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-08 04:39:12,758 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-08 04:39:12,758 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-08 04:39:12,758 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-08 04:39:12,759 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 04:39:12,759 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 04:39:12,759 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 04:39:12,759 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-08 04:39:12,759 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-08 04:39:12,759 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-08 04:39:12,759 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-08 04:39:12,759 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-08 04:39:12,760 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-08 04:39:12,760 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-08 04:39:12,760 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-08 04:39:12,760 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-08 04:39:12,760 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-09-08 04:39:12,760 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-09-08 04:39:12,760 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-08 04:39:12,760 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-08 04:39:12,761 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-08 04:39:12,761 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-08 04:39:12,761 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-08 04:39:12,761 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-08 04:39:12,761 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-08 04:39:12,761 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-08 04:39:12,761 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-08 04:39:12,761 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-08 04:39:12,762 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-08 04:39:12,762 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-08 04:39:12,762 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-08 04:39:12,762 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-08 04:39:12,762 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 04:39:12,762 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 04:39:12,762 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 04:39:12,762 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 04:39:12,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 04:39:12,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 04:39:12,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 04:39:12,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 04:39:12,763 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 04:39:12,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 04:39:12,763 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 04:39:12,763 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 04:39:12,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 04:39:12,764 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 04:39:12,764 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 04:39:12,764 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 04:39:12,764 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 04:39:12,764 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-08 04:39:12,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 04:39:12,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 04:39:12,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 04:39:14,825 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 04:39:14,826 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 04:39:14,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:39:14 BoogieIcfgContainer [2019-09-08 04:39:14,828 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 04:39:14,829 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 04:39:14,829 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 04:39:14,832 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 04:39:14,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 04:39:11" (1/3) ... [2019-09-08 04:39:14,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44fa3f34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:39:14, skipping insertion in model container [2019-09-08 04:39:14,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:39:12" (2/3) ... [2019-09-08 04:39:14,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44fa3f34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:39:14, skipping insertion in model container [2019-09-08 04:39:14,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:39:14" (3/3) ... [2019-09-08 04:39:14,836 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec1_product20.cil.c [2019-09-08 04:39:14,846 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 04:39:14,859 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 04:39:14,878 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 04:39:14,932 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 04:39:14,933 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 04:39:14,933 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 04:39:14,933 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 04:39:14,933 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 04:39:14,933 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 04:39:14,933 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 04:39:14,934 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 04:39:14,934 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 04:39:14,971 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states. [2019-09-08 04:39:14,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-08 04:39:14,993 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:14,995 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:39:14,997 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:15,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:15,003 INFO L82 PathProgramCache]: Analyzing trace with hash -165489832, now seen corresponding path program 1 times [2019-09-08 04:39:15,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:15,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:15,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:15,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:15,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:15,565 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 04:39:15,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:15,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 04:39:15,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 04:39:15,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 04:39:15,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 04:39:15,590 INFO L87 Difference]: Start difference. First operand 559 states. Second operand 2 states. [2019-09-08 04:39:15,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:15,722 INFO L93 Difference]: Finished difference Result 756 states and 1036 transitions. [2019-09-08 04:39:15,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 04:39:15,725 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 154 [2019-09-08 04:39:15,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:15,759 INFO L225 Difference]: With dead ends: 756 [2019-09-08 04:39:15,760 INFO L226 Difference]: Without dead ends: 506 [2019-09-08 04:39:15,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 04:39:15,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-09-08 04:39:15,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2019-09-08 04:39:15,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2019-09-08 04:39:15,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 697 transitions. [2019-09-08 04:39:15,977 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 697 transitions. Word has length 154 [2019-09-08 04:39:15,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:15,980 INFO L475 AbstractCegarLoop]: Abstraction has 506 states and 697 transitions. [2019-09-08 04:39:15,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 04:39:15,980 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 697 transitions. [2019-09-08 04:39:15,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-08 04:39:15,991 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:15,991 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:39:15,992 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:15,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:15,993 INFO L82 PathProgramCache]: Analyzing trace with hash 251195075, now seen corresponding path program 1 times [2019-09-08 04:39:15,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:15,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:15,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:15,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:15,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:16,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:16,294 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 04:39:16,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:16,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:39:16,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:39:16,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:39:16,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:39:16,303 INFO L87 Difference]: Start difference. First operand 506 states and 697 transitions. Second operand 3 states. [2019-09-08 04:39:16,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:16,350 INFO L93 Difference]: Finished difference Result 739 states and 1002 transitions. [2019-09-08 04:39:16,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:39:16,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-09-08 04:39:16,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:16,355 INFO L225 Difference]: With dead ends: 739 [2019-09-08 04:39:16,355 INFO L226 Difference]: Without dead ends: 509 [2019-09-08 04:39:16,357 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:39:16,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2019-09-08 04:39:16,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 508. [2019-09-08 04:39:16,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2019-09-08 04:39:16,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 699 transitions. [2019-09-08 04:39:16,388 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 699 transitions. Word has length 155 [2019-09-08 04:39:16,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:16,388 INFO L475 AbstractCegarLoop]: Abstraction has 508 states and 699 transitions. [2019-09-08 04:39:16,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:39:16,389 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 699 transitions. [2019-09-08 04:39:16,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 04:39:16,392 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:16,392 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:39:16,393 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:16,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:16,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1211628493, now seen corresponding path program 1 times [2019-09-08 04:39:16,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:16,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:16,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:16,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:16,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:16,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:16,533 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 04:39:16,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:16,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:39:16,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:39:16,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:39:16,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:39:16,539 INFO L87 Difference]: Start difference. First operand 508 states and 699 transitions. Second operand 3 states. [2019-09-08 04:39:16,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:16,586 INFO L93 Difference]: Finished difference Result 994 states and 1399 transitions. [2019-09-08 04:39:16,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:39:16,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-09-08 04:39:16,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:16,591 INFO L225 Difference]: With dead ends: 994 [2019-09-08 04:39:16,591 INFO L226 Difference]: Without dead ends: 551 [2019-09-08 04:39:16,593 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:39:16,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-09-08 04:39:16,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 550. [2019-09-08 04:39:16,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2019-09-08 04:39:16,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 771 transitions. [2019-09-08 04:39:16,620 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 771 transitions. Word has length 165 [2019-09-08 04:39:16,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:16,621 INFO L475 AbstractCegarLoop]: Abstraction has 550 states and 771 transitions. [2019-09-08 04:39:16,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:39:16,621 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 771 transitions. [2019-09-08 04:39:16,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 04:39:16,625 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:16,625 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:39:16,625 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:16,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:16,626 INFO L82 PathProgramCache]: Analyzing trace with hash 964514250, now seen corresponding path program 1 times [2019-09-08 04:39:16,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:16,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:16,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:16,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:16,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:16,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:16,803 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 04:39:16,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:16,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:39:16,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:39:16,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:39:16,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:39:16,807 INFO L87 Difference]: Start difference. First operand 550 states and 771 transitions. Second operand 3 states. [2019-09-08 04:39:16,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:16,855 INFO L93 Difference]: Finished difference Result 1117 states and 1610 transitions. [2019-09-08 04:39:16,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:39:16,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-09-08 04:39:16,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:16,866 INFO L225 Difference]: With dead ends: 1117 [2019-09-08 04:39:16,866 INFO L226 Difference]: Without dead ends: 632 [2019-09-08 04:39:16,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:39:16,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-09-08 04:39:16,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 631. [2019-09-08 04:39:16,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-09-08 04:39:16,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 909 transitions. [2019-09-08 04:39:16,908 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 909 transitions. Word has length 166 [2019-09-08 04:39:16,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:16,909 INFO L475 AbstractCegarLoop]: Abstraction has 631 states and 909 transitions. [2019-09-08 04:39:16,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:39:16,909 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 909 transitions. [2019-09-08 04:39:16,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 04:39:16,915 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:16,915 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:39:16,916 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:16,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:16,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1255605427, now seen corresponding path program 1 times [2019-09-08 04:39:16,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:16,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:16,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:16,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:16,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:16,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:17,092 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 04:39:17,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:17,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:39:17,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:39:17,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:39:17,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:39:17,094 INFO L87 Difference]: Start difference. First operand 631 states and 909 transitions. Second operand 3 states. [2019-09-08 04:39:17,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:17,143 INFO L93 Difference]: Finished difference Result 1354 states and 2014 transitions. [2019-09-08 04:39:17,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:39:17,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-09-08 04:39:17,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:17,150 INFO L225 Difference]: With dead ends: 1354 [2019-09-08 04:39:17,150 INFO L226 Difference]: Without dead ends: 788 [2019-09-08 04:39:17,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:39:17,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2019-09-08 04:39:17,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 787. [2019-09-08 04:39:17,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2019-09-08 04:39:17,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1173 transitions. [2019-09-08 04:39:17,200 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1173 transitions. Word has length 167 [2019-09-08 04:39:17,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:17,201 INFO L475 AbstractCegarLoop]: Abstraction has 787 states and 1173 transitions. [2019-09-08 04:39:17,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:39:17,201 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1173 transitions. [2019-09-08 04:39:17,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 04:39:17,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:17,206 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:39:17,207 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:17,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:17,207 INFO L82 PathProgramCache]: Analyzing trace with hash 631123274, now seen corresponding path program 1 times [2019-09-08 04:39:17,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:17,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:17,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:17,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:17,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:17,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:17,396 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 04:39:17,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:17,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:39:17,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:39:17,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:39:17,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:39:17,399 INFO L87 Difference]: Start difference. First operand 787 states and 1173 transitions. Second operand 3 states. [2019-09-08 04:39:17,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:17,508 INFO L93 Difference]: Finished difference Result 1810 states and 2786 transitions. [2019-09-08 04:39:17,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:39:17,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-09-08 04:39:17,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:17,515 INFO L225 Difference]: With dead ends: 1810 [2019-09-08 04:39:17,515 INFO L226 Difference]: Without dead ends: 1088 [2019-09-08 04:39:17,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:39:17,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-08 04:39:17,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 1087. [2019-09-08 04:39:17,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1087 states. [2019-09-08 04:39:17,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1677 transitions. [2019-09-08 04:39:17,575 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1677 transitions. Word has length 168 [2019-09-08 04:39:17,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:17,577 INFO L475 AbstractCegarLoop]: Abstraction has 1087 states and 1677 transitions. [2019-09-08 04:39:17,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:39:17,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1677 transitions. [2019-09-08 04:39:17,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-08 04:39:17,585 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:17,585 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:39:17,586 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:17,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:17,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1431519593, now seen corresponding path program 1 times [2019-09-08 04:39:17,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:17,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:17,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:17,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:17,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:17,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:17,790 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 04:39:17,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:17,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:39:17,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:39:17,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:39:17,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:39:17,793 INFO L87 Difference]: Start difference. First operand 1087 states and 1677 transitions. Second operand 6 states. [2019-09-08 04:39:18,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:18,621 INFO L93 Difference]: Finished difference Result 2123 states and 3307 transitions. [2019-09-08 04:39:18,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:39:18,622 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 171 [2019-09-08 04:39:18,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:18,631 INFO L225 Difference]: With dead ends: 2123 [2019-09-08 04:39:18,631 INFO L226 Difference]: Without dead ends: 1099 [2019-09-08 04:39:18,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:39:18,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2019-09-08 04:39:18,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1099. [2019-09-08 04:39:18,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1099 states. [2019-09-08 04:39:18,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1692 transitions. [2019-09-08 04:39:18,706 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1692 transitions. Word has length 171 [2019-09-08 04:39:18,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:18,707 INFO L475 AbstractCegarLoop]: Abstraction has 1099 states and 1692 transitions. [2019-09-08 04:39:18,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:39:18,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1692 transitions. [2019-09-08 04:39:18,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-08 04:39:18,720 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:18,720 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:39:18,720 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:18,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:18,721 INFO L82 PathProgramCache]: Analyzing trace with hash 911756595, now seen corresponding path program 1 times [2019-09-08 04:39:18,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:18,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:18,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:18,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:18,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:18,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:18,968 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 04:39:18,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:18,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:39:18,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:39:18,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:39:18,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:39:18,969 INFO L87 Difference]: Start difference. First operand 1099 states and 1692 transitions. Second operand 3 states. [2019-09-08 04:39:19,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:19,062 INFO L93 Difference]: Finished difference Result 2698 states and 4272 transitions. [2019-09-08 04:39:19,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:39:19,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2019-09-08 04:39:19,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:19,074 INFO L225 Difference]: With dead ends: 2698 [2019-09-08 04:39:19,074 INFO L226 Difference]: Without dead ends: 1676 [2019-09-08 04:39:19,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:39:19,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2019-09-08 04:39:19,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1675. [2019-09-08 04:39:19,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1675 states. [2019-09-08 04:39:19,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1675 states and 2652 transitions. [2019-09-08 04:39:19,183 INFO L78 Accepts]: Start accepts. Automaton has 1675 states and 2652 transitions. Word has length 169 [2019-09-08 04:39:19,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:19,184 INFO L475 AbstractCegarLoop]: Abstraction has 1675 states and 2652 transitions. [2019-09-08 04:39:19,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:39:19,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 2652 transitions. [2019-09-08 04:39:19,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-08 04:39:19,195 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:19,196 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:39:19,196 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:19,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:19,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1249840830, now seen corresponding path program 1 times [2019-09-08 04:39:19,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:19,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:19,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:19,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:19,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:19,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:19,379 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 04:39:19,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:39:19,379 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 04:39:19,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:39:19,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:19,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 2682 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 04:39:19,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:39:20,203 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 04:39:20,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:39:20,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 13 [2019-09-08 04:39:20,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 04:39:20,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 04:39:20,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:39:20,226 INFO L87 Difference]: Start difference. First operand 1675 states and 2652 transitions. Second operand 13 states. [2019-09-08 04:39:21,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:21,743 INFO L93 Difference]: Finished difference Result 3308 states and 5276 transitions. [2019-09-08 04:39:21,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 04:39:21,743 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 172 [2019-09-08 04:39:21,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:21,760 INFO L225 Difference]: With dead ends: 3308 [2019-09-08 04:39:21,760 INFO L226 Difference]: Without dead ends: 1681 [2019-09-08 04:39:21,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2019-09-08 04:39:21,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states. [2019-09-08 04:39:21,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 1679. [2019-09-08 04:39:21,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1679 states. [2019-09-08 04:39:21,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679 states to 1679 states and 2657 transitions. [2019-09-08 04:39:21,879 INFO L78 Accepts]: Start accepts. Automaton has 1679 states and 2657 transitions. Word has length 172 [2019-09-08 04:39:21,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:21,880 INFO L475 AbstractCegarLoop]: Abstraction has 1679 states and 2657 transitions. [2019-09-08 04:39:21,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 04:39:21,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 2657 transitions. [2019-09-08 04:39:21,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-08 04:39:21,893 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:21,894 INFO L399 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, 1, 1, 1, 1, 1] [2019-09-08 04:39:21,894 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:21,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:21,895 INFO L82 PathProgramCache]: Analyzing trace with hash 109986769, now seen corresponding path program 1 times [2019-09-08 04:39:21,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:21,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:21,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:21,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:21,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:21,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:22,165 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 04:39:22,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:22,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:39:22,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:39:22,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:39:22,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:39:22,168 INFO L87 Difference]: Start difference. First operand 1679 states and 2657 transitions. Second operand 7 states. [2019-09-08 04:39:22,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:22,515 INFO L93 Difference]: Finished difference Result 3306 states and 5251 transitions. [2019-09-08 04:39:22,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:39:22,516 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 174 [2019-09-08 04:39:22,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:22,535 INFO L225 Difference]: With dead ends: 3306 [2019-09-08 04:39:22,535 INFO L226 Difference]: Without dead ends: 1693 [2019-09-08 04:39:22,544 INFO L628 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-09-08 04:39:22,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1693 states. [2019-09-08 04:39:22,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1693 to 1689. [2019-09-08 04:39:22,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1689 states. [2019-09-08 04:39:22,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1689 states to 1689 states and 2668 transitions. [2019-09-08 04:39:22,648 INFO L78 Accepts]: Start accepts. Automaton has 1689 states and 2668 transitions. Word has length 174 [2019-09-08 04:39:22,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:22,649 INFO L475 AbstractCegarLoop]: Abstraction has 1689 states and 2668 transitions. [2019-09-08 04:39:22,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:39:22,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1689 states and 2668 transitions. [2019-09-08 04:39:22,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 04:39:22,662 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:22,662 INFO L399 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:39:22,662 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:22,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:22,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1241025660, now seen corresponding path program 2 times [2019-09-08 04:39:22,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:22,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:22,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:22,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:22,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:22,865 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 04:39:22,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:22,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:39:22,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:39:22,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:39:22,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:39:22,869 INFO L87 Difference]: Start difference. First operand 1689 states and 2668 transitions. Second operand 7 states. [2019-09-08 04:39:23,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:23,221 INFO L93 Difference]: Finished difference Result 3304 states and 5250 transitions. [2019-09-08 04:39:23,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:39:23,222 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 175 [2019-09-08 04:39:23,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:23,239 INFO L225 Difference]: With dead ends: 3304 [2019-09-08 04:39:23,240 INFO L226 Difference]: Without dead ends: 1695 [2019-09-08 04:39:23,247 INFO L628 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-09-08 04:39:23,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2019-09-08 04:39:23,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1691. [2019-09-08 04:39:23,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1691 states. [2019-09-08 04:39:23,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 2671 transitions. [2019-09-08 04:39:23,346 INFO L78 Accepts]: Start accepts. Automaton has 1691 states and 2671 transitions. Word has length 175 [2019-09-08 04:39:23,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:23,346 INFO L475 AbstractCegarLoop]: Abstraction has 1691 states and 2671 transitions. [2019-09-08 04:39:23,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:39:23,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 2671 transitions. [2019-09-08 04:39:23,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 04:39:23,361 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:23,362 INFO L399 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:39:23,362 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:23,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:23,363 INFO L82 PathProgramCache]: Analyzing trace with hash 823120566, now seen corresponding path program 1 times [2019-09-08 04:39:23,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:23,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:23,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:23,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 04:39:23,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:23,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:23,636 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 04:39:23,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:23,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:39:23,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:39:23,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:39:23,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:39:23,639 INFO L87 Difference]: Start difference. First operand 1691 states and 2671 transitions. Second operand 9 states. [2019-09-08 04:39:24,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:24,173 INFO L93 Difference]: Finished difference Result 3309 states and 5256 transitions. [2019-09-08 04:39:24,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:39:24,173 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 176 [2019-09-08 04:39:24,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:24,185 INFO L225 Difference]: With dead ends: 3309 [2019-09-08 04:39:24,185 INFO L226 Difference]: Without dead ends: 1693 [2019-09-08 04:39:24,194 INFO L628 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-09-08 04:39:24,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1693 states. [2019-09-08 04:39:24,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1693 to 1691. [2019-09-08 04:39:24,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1691 states. [2019-09-08 04:39:24,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 2670 transitions. [2019-09-08 04:39:24,290 INFO L78 Accepts]: Start accepts. Automaton has 1691 states and 2670 transitions. Word has length 176 [2019-09-08 04:39:24,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:24,291 INFO L475 AbstractCegarLoop]: Abstraction has 1691 states and 2670 transitions. [2019-09-08 04:39:24,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:39:24,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 2670 transitions. [2019-09-08 04:39:24,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-08 04:39:24,300 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:24,300 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:39:24,300 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:24,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:24,301 INFO L82 PathProgramCache]: Analyzing trace with hash -2002757926, now seen corresponding path program 2 times [2019-09-08 04:39:24,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:24,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:24,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:24,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:24,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:24,485 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 04:39:24,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:24,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:39:24,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:39:24,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:39:24,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:39:24,488 INFO L87 Difference]: Start difference. First operand 1691 states and 2670 transitions. Second operand 9 states. [2019-09-08 04:39:24,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:24,846 INFO L93 Difference]: Finished difference Result 3311 states and 5257 transitions. [2019-09-08 04:39:24,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:39:24,847 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 177 [2019-09-08 04:39:24,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:24,861 INFO L225 Difference]: With dead ends: 3311 [2019-09-08 04:39:24,862 INFO L226 Difference]: Without dead ends: 1695 [2019-09-08 04:39:24,872 INFO L628 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-09-08 04:39:24,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2019-09-08 04:39:24,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1691. [2019-09-08 04:39:24,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1691 states. [2019-09-08 04:39:25,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 2669 transitions. [2019-09-08 04:39:25,012 INFO L78 Accepts]: Start accepts. Automaton has 1691 states and 2669 transitions. Word has length 177 [2019-09-08 04:39:25,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:25,013 INFO L475 AbstractCegarLoop]: Abstraction has 1691 states and 2669 transitions. [2019-09-08 04:39:25,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:39:25,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 2669 transitions. [2019-09-08 04:39:25,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 04:39:25,028 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:25,029 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:39:25,029 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:25,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:25,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1703396177, now seen corresponding path program 1 times [2019-09-08 04:39:25,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:25,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:25,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:25,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 04:39:25,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:25,612 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 04:39:25,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:25,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 04:39:25,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 04:39:25,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 04:39:25,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-09-08 04:39:25,615 INFO L87 Difference]: Start difference. First operand 1691 states and 2669 transitions. Second operand 18 states. [2019-09-08 04:39:30,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:30,496 INFO L93 Difference]: Finished difference Result 3762 states and 5998 transitions. [2019-09-08 04:39:30,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 04:39:30,497 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 178 [2019-09-08 04:39:30,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:30,523 INFO L225 Difference]: With dead ends: 3762 [2019-09-08 04:39:30,524 INFO L226 Difference]: Without dead ends: 3545 [2019-09-08 04:39:30,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=257, Invalid=1549, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 04:39:30,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3545 states. [2019-09-08 04:39:30,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3545 to 3522. [2019-09-08 04:39:30,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3522 states. [2019-09-08 04:39:30,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3522 states to 3522 states and 5677 transitions. [2019-09-08 04:39:30,821 INFO L78 Accepts]: Start accepts. Automaton has 3522 states and 5677 transitions. Word has length 178 [2019-09-08 04:39:30,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:30,824 INFO L475 AbstractCegarLoop]: Abstraction has 3522 states and 5677 transitions. [2019-09-08 04:39:30,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 04:39:30,824 INFO L276 IsEmpty]: Start isEmpty. Operand 3522 states and 5677 transitions. [2019-09-08 04:39:30,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 04:39:30,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:30,845 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:39:30,845 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:30,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:30,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1319084218, now seen corresponding path program 1 times [2019-09-08 04:39:30,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:30,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:30,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:30,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:30,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:30,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:31,079 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 04:39:31,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:31,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 04:39:31,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:39:31,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:39:31,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:39:31,081 INFO L87 Difference]: Start difference. First operand 3522 states and 5677 transitions. Second operand 12 states. [2019-09-08 04:39:31,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:31,416 INFO L93 Difference]: Finished difference Result 4278 states and 6740 transitions. [2019-09-08 04:39:31,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 04:39:31,417 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 179 [2019-09-08 04:39:31,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:31,443 INFO L225 Difference]: With dead ends: 4278 [2019-09-08 04:39:31,443 INFO L226 Difference]: Without dead ends: 3612 [2019-09-08 04:39:31,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-09-08 04:39:31,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3612 states. [2019-09-08 04:39:31,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3612 to 3612. [2019-09-08 04:39:31,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3612 states. [2019-09-08 04:39:31,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3612 states to 3612 states and 5816 transitions. [2019-09-08 04:39:31,639 INFO L78 Accepts]: Start accepts. Automaton has 3612 states and 5816 transitions. Word has length 179 [2019-09-08 04:39:31,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:31,640 INFO L475 AbstractCegarLoop]: Abstraction has 3612 states and 5816 transitions. [2019-09-08 04:39:31,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:39:31,640 INFO L276 IsEmpty]: Start isEmpty. Operand 3612 states and 5816 transitions. [2019-09-08 04:39:31,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 04:39:31,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:31,660 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:39:31,660 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:31,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:31,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1966820760, now seen corresponding path program 1 times [2019-09-08 04:39:31,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:31,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:31,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:31,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:31,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:31,914 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 04:39:31,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:31,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 04:39:31,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 04:39:31,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 04:39:31,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:39:31,918 INFO L87 Difference]: Start difference. First operand 3612 states and 5816 transitions. Second operand 11 states. [2019-09-08 04:39:32,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:32,505 INFO L93 Difference]: Finished difference Result 4329 states and 6803 transitions. [2019-09-08 04:39:32,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:39:32,506 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 179 [2019-09-08 04:39:32,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:32,619 INFO L225 Difference]: With dead ends: 4329 [2019-09-08 04:39:32,619 INFO L226 Difference]: Without dead ends: 3618 [2019-09-08 04:39:32,630 INFO L628 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-09-08 04:39:32,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3618 states. [2019-09-08 04:39:32,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3618 to 3618. [2019-09-08 04:39:32,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3618 states. [2019-09-08 04:39:32,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3618 states to 3618 states and 5823 transitions. [2019-09-08 04:39:32,837 INFO L78 Accepts]: Start accepts. Automaton has 3618 states and 5823 transitions. Word has length 179 [2019-09-08 04:39:32,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:32,838 INFO L475 AbstractCegarLoop]: Abstraction has 3618 states and 5823 transitions. [2019-09-08 04:39:32,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 04:39:32,838 INFO L276 IsEmpty]: Start isEmpty. Operand 3618 states and 5823 transitions. [2019-09-08 04:39:32,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 04:39:32,856 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:32,857 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:39:32,857 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:32,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:32,857 INFO L82 PathProgramCache]: Analyzing trace with hash 518221770, now seen corresponding path program 1 times [2019-09-08 04:39:32,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:32,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:32,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:32,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:32,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:32,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:33,039 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 04:39:33,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:33,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:39:33,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:39:33,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:39:33,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:39:33,041 INFO L87 Difference]: Start difference. First operand 3618 states and 5823 transitions. Second operand 5 states. [2019-09-08 04:39:34,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:34,234 INFO L93 Difference]: Finished difference Result 6729 states and 10740 transitions. [2019-09-08 04:39:34,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:39:34,234 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 179 [2019-09-08 04:39:34,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:34,287 INFO L225 Difference]: With dead ends: 6729 [2019-09-08 04:39:34,288 INFO L226 Difference]: Without dead ends: 6245 [2019-09-08 04:39:34,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:39:34,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6245 states. [2019-09-08 04:39:34,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6245 to 6231. [2019-09-08 04:39:34,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6231 states. [2019-09-08 04:39:34,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6231 states to 6231 states and 10043 transitions. [2019-09-08 04:39:34,639 INFO L78 Accepts]: Start accepts. Automaton has 6231 states and 10043 transitions. Word has length 179 [2019-09-08 04:39:34,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:34,640 INFO L475 AbstractCegarLoop]: Abstraction has 6231 states and 10043 transitions. [2019-09-08 04:39:34,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:39:34,640 INFO L276 IsEmpty]: Start isEmpty. Operand 6231 states and 10043 transitions. [2019-09-08 04:39:34,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 04:39:34,671 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:34,671 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:39:34,672 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:34,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:34,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1491882071, now seen corresponding path program 1 times [2019-09-08 04:39:34,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:34,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:34,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:34,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:34,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:34,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:34,987 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:39:34,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:39:34,988 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 04:39:35,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:39:35,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:35,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 2688 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 04:39:35,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:39:35,594 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:39:35,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 04:39:35,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-08 04:39:35,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:39:35,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:39:35,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:39:35,605 INFO L87 Difference]: Start difference. First operand 6231 states and 10043 transitions. Second operand 5 states. [2019-09-08 04:39:35,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:35,868 INFO L93 Difference]: Finished difference Result 8357 states and 12989 transitions. [2019-09-08 04:39:35,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:39:35,869 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 179 [2019-09-08 04:39:35,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:35,902 INFO L225 Difference]: With dead ends: 8357 [2019-09-08 04:39:35,902 INFO L226 Difference]: Without dead ends: 6327 [2019-09-08 04:39:35,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 179 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-09-08 04:39:35,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6327 states. [2019-09-08 04:39:36,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6327 to 6312. [2019-09-08 04:39:36,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6312 states. [2019-09-08 04:39:36,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6312 states to 6312 states and 10161 transitions. [2019-09-08 04:39:36,265 INFO L78 Accepts]: Start accepts. Automaton has 6312 states and 10161 transitions. Word has length 179 [2019-09-08 04:39:36,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:36,265 INFO L475 AbstractCegarLoop]: Abstraction has 6312 states and 10161 transitions. [2019-09-08 04:39:36,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:39:36,265 INFO L276 IsEmpty]: Start isEmpty. Operand 6312 states and 10161 transitions. [2019-09-08 04:39:36,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 04:39:36,294 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:36,295 INFO L399 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-09-08 04:39:36,295 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:36,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:36,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1295018112, now seen corresponding path program 1 times [2019-09-08 04:39:36,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:36,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:36,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:36,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:36,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:36,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:36,422 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:39:36,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:36,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:39:36,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:39:36,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:39:36,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:39:36,425 INFO L87 Difference]: Start difference. First operand 6312 states and 10161 transitions. Second operand 3 states. [2019-09-08 04:39:36,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:36,830 INFO L93 Difference]: Finished difference Result 15993 states and 26349 transitions. [2019-09-08 04:39:36,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:39:36,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 179 [2019-09-08 04:39:36,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:36,883 INFO L225 Difference]: With dead ends: 15993 [2019-09-08 04:39:36,883 INFO L226 Difference]: Without dead ends: 9821 [2019-09-08 04:39:36,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:39:36,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9821 states. [2019-09-08 04:39:37,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9821 to 9818. [2019-09-08 04:39:37,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9818 states. [2019-09-08 04:39:37,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9818 states to 9818 states and 16258 transitions. [2019-09-08 04:39:37,404 INFO L78 Accepts]: Start accepts. Automaton has 9818 states and 16258 transitions. Word has length 179 [2019-09-08 04:39:37,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:37,404 INFO L475 AbstractCegarLoop]: Abstraction has 9818 states and 16258 transitions. [2019-09-08 04:39:37,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:39:37,405 INFO L276 IsEmpty]: Start isEmpty. Operand 9818 states and 16258 transitions. [2019-09-08 04:39:37,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 04:39:37,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:37,448 INFO L399 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-09-08 04:39:37,448 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:37,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:37,448 INFO L82 PathProgramCache]: Analyzing trace with hash -467664779, now seen corresponding path program 1 times [2019-09-08 04:39:37,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:37,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:37,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:37,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:37,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:37,572 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:39:37,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:37,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:39:37,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:39:37,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:39:37,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:39:37,575 INFO L87 Difference]: Start difference. First operand 9818 states and 16258 transitions. Second operand 3 states. [2019-09-08 04:39:38,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:38,223 INFO L93 Difference]: Finished difference Result 26023 states and 43863 transitions. [2019-09-08 04:39:38,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:39:38,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-08 04:39:38,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:38,305 INFO L225 Difference]: With dead ends: 26023 [2019-09-08 04:39:38,305 INFO L226 Difference]: Without dead ends: 16351 [2019-09-08 04:39:38,349 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:39:38,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16351 states. [2019-09-08 04:39:39,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16351 to 16348. [2019-09-08 04:39:39,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16348 states. [2019-09-08 04:39:39,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16348 states to 16348 states and 27587 transitions. [2019-09-08 04:39:39,166 INFO L78 Accepts]: Start accepts. Automaton has 16348 states and 27587 transitions. Word has length 180 [2019-09-08 04:39:39,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:39,167 INFO L475 AbstractCegarLoop]: Abstraction has 16348 states and 27587 transitions. [2019-09-08 04:39:39,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:39:39,167 INFO L276 IsEmpty]: Start isEmpty. Operand 16348 states and 27587 transitions. [2019-09-08 04:39:39,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 04:39:39,230 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:39,231 INFO L399 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-09-08 04:39:39,231 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:39,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:39,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1282269182, now seen corresponding path program 1 times [2019-09-08 04:39:39,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:39,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:39,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:39,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:39,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:39,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:39,370 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:39:39,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:39,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:39:39,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:39:39,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:39:39,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:39:39,372 INFO L87 Difference]: Start difference. First operand 16348 states and 27587 transitions. Second operand 3 states. [2019-09-08 04:39:40,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:40,942 INFO L93 Difference]: Finished difference Result 45029 states and 76881 transitions. [2019-09-08 04:39:40,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:39:40,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-09-08 04:39:40,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:41,107 INFO L225 Difference]: With dead ends: 45029 [2019-09-08 04:39:41,107 INFO L226 Difference]: Without dead ends: 28833 [2019-09-08 04:39:41,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:39:41,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28833 states. [2019-09-08 04:39:42,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28833 to 28830. [2019-09-08 04:39:42,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28830 states. [2019-09-08 04:39:42,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28830 states to 28830 states and 49092 transitions. [2019-09-08 04:39:42,938 INFO L78 Accepts]: Start accepts. Automaton has 28830 states and 49092 transitions. Word has length 181 [2019-09-08 04:39:42,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:42,939 INFO L475 AbstractCegarLoop]: Abstraction has 28830 states and 49092 transitions. [2019-09-08 04:39:42,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:39:42,939 INFO L276 IsEmpty]: Start isEmpty. Operand 28830 states and 49092 transitions. [2019-09-08 04:39:43,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-08 04:39:43,006 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:43,006 INFO L399 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-09-08 04:39:43,007 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:43,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:43,007 INFO L82 PathProgramCache]: Analyzing trace with hash -962951051, now seen corresponding path program 1 times [2019-09-08 04:39:43,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:43,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:43,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:43,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:43,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:43,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:43,135 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:39:43,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:43,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:39:43,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:39:43,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:39:43,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:39:43,137 INFO L87 Difference]: Start difference. First operand 28830 states and 49092 transitions. Second operand 3 states. [2019-09-08 04:39:45,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:45,316 INFO L93 Difference]: Finished difference Result 81317 states and 138699 transitions. [2019-09-08 04:39:45,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:39:45,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-09-08 04:39:45,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:45,586 INFO L225 Difference]: With dead ends: 81317 [2019-09-08 04:39:45,586 INFO L226 Difference]: Without dead ends: 52647 [2019-09-08 04:39:45,675 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:39:45,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52647 states. [2019-09-08 04:39:48,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52647 to 52644. [2019-09-08 04:39:48,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52644 states. [2019-09-08 04:39:48,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52644 states to 52644 states and 89033 transitions. [2019-09-08 04:39:48,500 INFO L78 Accepts]: Start accepts. Automaton has 52644 states and 89033 transitions. Word has length 182 [2019-09-08 04:39:48,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:48,501 INFO L475 AbstractCegarLoop]: Abstraction has 52644 states and 89033 transitions. [2019-09-08 04:39:48,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:39:48,501 INFO L276 IsEmpty]: Start isEmpty. Operand 52644 states and 89033 transitions. [2019-09-08 04:39:48,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-08 04:39:48,556 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:48,557 INFO L399 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-09-08 04:39:48,557 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:48,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:48,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1309428738, now seen corresponding path program 1 times [2019-09-08 04:39:48,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:48,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:48,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:48,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:48,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:48,706 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:39:48,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:48,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:39:48,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:39:48,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:39:48,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:39:48,710 INFO L87 Difference]: Start difference. First operand 52644 states and 89033 transitions. Second operand 3 states. [2019-09-08 04:39:52,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:52,400 INFO L93 Difference]: Finished difference Result 150435 states and 255429 transitions. [2019-09-08 04:39:52,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:39:52,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-09-08 04:39:52,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:52,830 INFO L225 Difference]: With dead ends: 150435 [2019-09-08 04:39:52,830 INFO L226 Difference]: Without dead ends: 97961 [2019-09-08 04:39:52,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:39:53,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97961 states. [2019-09-08 04:39:58,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97961 to 97958. [2019-09-08 04:39:58,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97958 states. [2019-09-08 04:39:59,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97958 states to 97958 states and 165066 transitions. [2019-09-08 04:39:59,170 INFO L78 Accepts]: Start accepts. Automaton has 97958 states and 165066 transitions. Word has length 183 [2019-09-08 04:39:59,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:59,171 INFO L475 AbstractCegarLoop]: Abstraction has 97958 states and 165066 transitions. [2019-09-08 04:39:59,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:39:59,171 INFO L276 IsEmpty]: Start isEmpty. Operand 97958 states and 165066 transitions. [2019-09-08 04:39:59,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-08 04:39:59,238 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:59,238 INFO L399 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-09-08 04:39:59,239 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:59,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:59,239 INFO L82 PathProgramCache]: Analyzing trace with hash -260331403, now seen corresponding path program 1 times [2019-09-08 04:39:59,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:59,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:59,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:59,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:59,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:59,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:59,356 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:39:59,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:59,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:39:59,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:39:59,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:39:59,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:39:59,359 INFO L87 Difference]: Start difference. First operand 97958 states and 165066 transitions. Second operand 3 states. [2019-09-08 04:40:06,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:40:06,697 INFO L93 Difference]: Finished difference Result 185995 states and 310701 transitions. [2019-09-08 04:40:06,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:40:06,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-09-08 04:40:06,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:40:07,420 INFO L225 Difference]: With dead ends: 185995 [2019-09-08 04:40:07,420 INFO L226 Difference]: Without dead ends: 183965 [2019-09-08 04:40:07,520 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:40:07,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183965 states. [2019-09-08 04:40:15,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183965 to 183962. [2019-09-08 04:40:15,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183962 states. [2019-09-08 04:40:15,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183962 states to 183962 states and 304826 transitions. [2019-09-08 04:40:15,571 INFO L78 Accepts]: Start accepts. Automaton has 183962 states and 304826 transitions. Word has length 184 [2019-09-08 04:40:15,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:40:15,572 INFO L475 AbstractCegarLoop]: Abstraction has 183962 states and 304826 transitions. [2019-09-08 04:40:15,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:40:15,572 INFO L276 IsEmpty]: Start isEmpty. Operand 183962 states and 304826 transitions. [2019-09-08 04:40:15,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-08 04:40:15,670 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:40:15,670 INFO L399 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-09-08 04:40:15,670 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:40:15,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:40:15,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1263525890, now seen corresponding path program 1 times [2019-09-08 04:40:15,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:40:15,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:40:15,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:15,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:40:15,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:16,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:40:16,157 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:40:16,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:40:16,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:40:16,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:40:16,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:40:16,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:40:16,160 INFO L87 Difference]: Start difference. First operand 183962 states and 304826 transitions. Second operand 3 states. [2019-09-08 04:40:24,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:40:24,632 INFO L93 Difference]: Finished difference Result 186482 states and 308333 transitions. [2019-09-08 04:40:24,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:40:24,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-09-08 04:40:24,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:40:25,377 INFO L225 Difference]: With dead ends: 186482 [2019-09-08 04:40:25,377 INFO L226 Difference]: Without dead ends: 184507 [2019-09-08 04:40:25,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:40:25,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184507 states. [2019-09-08 04:40:35,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184507 to 184507. [2019-09-08 04:40:35,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184507 states. [2019-09-08 04:40:36,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184507 states to 184507 states and 305558 transitions. [2019-09-08 04:40:36,170 INFO L78 Accepts]: Start accepts. Automaton has 184507 states and 305558 transitions. Word has length 185 [2019-09-08 04:40:36,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:40:36,170 INFO L475 AbstractCegarLoop]: Abstraction has 184507 states and 305558 transitions. [2019-09-08 04:40:36,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:40:36,170 INFO L276 IsEmpty]: Start isEmpty. Operand 184507 states and 305558 transitions. [2019-09-08 04:40:37,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-08 04:40:37,849 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:40:37,849 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:40:37,850 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:40:37,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:40:37,850 INFO L82 PathProgramCache]: Analyzing trace with hash 2146841885, now seen corresponding path program 1 times [2019-09-08 04:40:37,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:40:37,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:40:37,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:37,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:40:37,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:37,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:40:38,116 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-08 04:40:38,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:40:38,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:40:38,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:40:38,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:40:38,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:40:38,119 INFO L87 Difference]: Start difference. First operand 184507 states and 305558 transitions. Second operand 6 states. [2019-09-08 04:40:51,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:40:51,834 INFO L93 Difference]: Finished difference Result 363554 states and 604828 transitions. [2019-09-08 04:40:51,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:40:51,834 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 306 [2019-09-08 04:40:51,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:40:53,299 INFO L225 Difference]: With dead ends: 363554 [2019-09-08 04:40:53,300 INFO L226 Difference]: Without dead ends: 361083 [2019-09-08 04:40:53,432 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:40:53,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361083 states. [2019-09-08 04:41:20,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361083 to 361020. [2019-09-08 04:41:20,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361020 states. [2019-09-08 04:41:22,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361020 states to 361020 states and 601358 transitions. [2019-09-08 04:41:22,007 INFO L78 Accepts]: Start accepts. Automaton has 361020 states and 601358 transitions. Word has length 306 [2019-09-08 04:41:22,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:41:22,007 INFO L475 AbstractCegarLoop]: Abstraction has 361020 states and 601358 transitions. [2019-09-08 04:41:22,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:41:22,007 INFO L276 IsEmpty]: Start isEmpty. Operand 361020 states and 601358 transitions. [2019-09-08 04:41:23,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-09-08 04:41:23,759 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:41:23,760 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:41:23,760 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:41:23,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:41:23,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1800568307, now seen corresponding path program 1 times [2019-09-08 04:41:23,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:41:23,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:41:23,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:41:23,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:41:23,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:41:23,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:41:23,988 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-08 04:41:23,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:41:23,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:41:23,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:41:23,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:41:23,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:41:23,990 INFO L87 Difference]: Start difference. First operand 361020 states and 601358 transitions. Second operand 9 states. [2019-09-08 04:41:41,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:41:41,755 INFO L93 Difference]: Finished difference Result 365829 states and 607849 transitions. [2019-09-08 04:41:41,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:41:41,756 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 307 [2019-09-08 04:41:41,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:41:43,515 INFO L225 Difference]: With dead ends: 365829 [2019-09-08 04:41:43,516 INFO L226 Difference]: Without dead ends: 360768 [2019-09-08 04:41:43,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-09-08 04:41:43,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360768 states. [2019-09-08 04:42:08,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360768 to 360712. [2019-09-08 04:42:08,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360712 states. [2019-09-08 04:42:10,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360712 states to 360712 states and 600823 transitions. [2019-09-08 04:42:10,747 INFO L78 Accepts]: Start accepts. Automaton has 360712 states and 600823 transitions. Word has length 307 [2019-09-08 04:42:10,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:42:10,747 INFO L475 AbstractCegarLoop]: Abstraction has 360712 states and 600823 transitions. [2019-09-08 04:42:10,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:42:10,747 INFO L276 IsEmpty]: Start isEmpty. Operand 360712 states and 600823 transitions. [2019-09-08 04:42:12,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-09-08 04:42:12,380 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:42:12,380 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:42:12,381 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:42:12,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:42:12,381 INFO L82 PathProgramCache]: Analyzing trace with hash 2061701257, now seen corresponding path program 1 times [2019-09-08 04:42:12,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:42:12,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:42:12,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:42:12,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:42:12,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:42:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:42:12,575 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-09-08 04:42:12,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:42:12,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:42:12,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:42:12,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:42:12,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:42:12,578 INFO L87 Difference]: Start difference. First operand 360712 states and 600823 transitions. Second operand 5 states. [2019-09-08 04:42:29,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:42:29,791 INFO L93 Difference]: Finished difference Result 363448 states and 604453 transitions. [2019-09-08 04:42:29,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:42:29,791 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 299 [2019-09-08 04:42:29,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:42:30,923 INFO L225 Difference]: With dead ends: 363448 [2019-09-08 04:42:30,923 INFO L226 Difference]: Without dead ends: 360472 [2019-09-08 04:42:31,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:42:31,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360472 states. [2019-09-08 04:42:56,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360472 to 359958. [2019-09-08 04:42:56,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359958 states. [2019-09-08 04:42:57,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359958 states to 359958 states and 599798 transitions. [2019-09-08 04:42:57,890 INFO L78 Accepts]: Start accepts. Automaton has 359958 states and 599798 transitions. Word has length 299 [2019-09-08 04:42:57,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:42:57,890 INFO L475 AbstractCegarLoop]: Abstraction has 359958 states and 599798 transitions. [2019-09-08 04:42:57,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:42:57,890 INFO L276 IsEmpty]: Start isEmpty. Operand 359958 states and 599798 transitions. [2019-09-08 04:43:07,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-08 04:43:07,662 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:43:07,662 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:43:07,663 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:43:07,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:43:07,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1306108986, now seen corresponding path program 1 times [2019-09-08 04:43:07,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:43:07,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:43:07,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:43:07,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:43:07,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:43:07,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:43:08,022 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-08 04:43:08,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:43:08,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 04:43:08,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 04:43:08,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 04:43:08,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:43:08,025 INFO L87 Difference]: Start difference. First operand 359958 states and 599798 transitions. Second operand 11 states. [2019-09-08 04:43:27,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:43:27,065 INFO L93 Difference]: Finished difference Result 365153 states and 606851 transitions. [2019-09-08 04:43:27,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 04:43:27,066 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 300 [2019-09-08 04:43:27,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:43:28,485 INFO L225 Difference]: With dead ends: 365153 [2019-09-08 04:43:28,485 INFO L226 Difference]: Without dead ends: 361935 [2019-09-08 04:43:28,595 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2019-09-08 04:43:28,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361935 states. [2019-09-08 04:43:53,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361935 to 361826. [2019-09-08 04:43:53,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361826 states. [2019-09-08 04:43:56,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361826 states to 361826 states and 602322 transitions. [2019-09-08 04:43:56,637 INFO L78 Accepts]: Start accepts. Automaton has 361826 states and 602322 transitions. Word has length 300 [2019-09-08 04:43:56,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:43:56,637 INFO L475 AbstractCegarLoop]: Abstraction has 361826 states and 602322 transitions. [2019-09-08 04:43:56,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 04:43:56,638 INFO L276 IsEmpty]: Start isEmpty. Operand 361826 states and 602322 transitions. [2019-09-08 04:43:58,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2019-09-08 04:43:58,358 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:43:58,358 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:43:58,358 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:43:58,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:43:58,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1054479894, now seen corresponding path program 1 times [2019-09-08 04:43:58,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:43:58,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:43:58,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:43:58,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:43:58,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:43:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:43:58,559 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-09-08 04:43:58,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:43:58,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:43:58,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:43:58,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:43:58,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:43:58,561 INFO L87 Difference]: Start difference. First operand 361826 states and 602322 transitions. Second operand 7 states. [2019-09-08 04:44:21,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:44:21,734 INFO L93 Difference]: Finished difference Result 715665 states and 1201076 transitions. [2019-09-08 04:44:21,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:44:21,734 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 345 [2019-09-08 04:44:21,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:44:22,991 INFO L225 Difference]: With dead ends: 715665 [2019-09-08 04:44:22,991 INFO L226 Difference]: Without dead ends: 361880 [2019-09-08 04:44:23,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:44:23,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361880 states. [2019-09-08 04:44:51,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361880 to 361880. [2019-09-08 04:44:51,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361880 states. [2019-09-08 04:44:52,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361880 states to 361880 states and 602388 transitions. [2019-09-08 04:44:53,005 INFO L78 Accepts]: Start accepts. Automaton has 361880 states and 602388 transitions. Word has length 345 [2019-09-08 04:44:53,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:44:53,006 INFO L475 AbstractCegarLoop]: Abstraction has 361880 states and 602388 transitions. [2019-09-08 04:44:53,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:44:53,006 INFO L276 IsEmpty]: Start isEmpty. Operand 361880 states and 602388 transitions. [2019-09-08 04:44:54,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2019-09-08 04:44:54,826 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:44:54,826 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:44:54,826 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:44:54,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:44:54,827 INFO L82 PathProgramCache]: Analyzing trace with hash 615056809, now seen corresponding path program 1 times [2019-09-08 04:44:54,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:44:54,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:44:54,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:44:54,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:44:54,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:44:54,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:45:02,549 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-09-08 04:45:02,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:45:02,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:45:02,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:45:02,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:45:02,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:45:02,553 INFO L87 Difference]: Start difference. First operand 361880 states and 602388 transitions. Second operand 6 states. [2019-09-08 04:45:18,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:45:18,588 INFO L93 Difference]: Finished difference Result 723552 states and 1204509 transitions. [2019-09-08 04:45:18,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:45:18,588 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 347 [2019-09-08 04:45:18,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:45:20,203 INFO L225 Difference]: With dead ends: 723552 [2019-09-08 04:45:20,203 INFO L226 Difference]: Without dead ends: 361886 [2019-09-08 04:45:20,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:45:21,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361886 states. [2019-09-08 04:45:48,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361886 to 361880. [2019-09-08 04:45:48,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361880 states. [2019-09-08 04:45:49,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361880 states to 361880 states and 596436 transitions. [2019-09-08 04:45:49,707 INFO L78 Accepts]: Start accepts. Automaton has 361880 states and 596436 transitions. Word has length 347 [2019-09-08 04:45:49,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:45:49,708 INFO L475 AbstractCegarLoop]: Abstraction has 361880 states and 596436 transitions. [2019-09-08 04:45:49,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:45:49,708 INFO L276 IsEmpty]: Start isEmpty. Operand 361880 states and 596436 transitions. [2019-09-08 04:45:51,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-09-08 04:45:51,644 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:45:51,645 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:45:51,645 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:45:51,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:45:51,645 INFO L82 PathProgramCache]: Analyzing trace with hash -541737837, now seen corresponding path program 1 times [2019-09-08 04:45:51,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:45:51,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:45:51,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:45:51,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:45:51,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:45:51,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:45:53,165 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-09-08 04:45:53,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:45:53,166 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:45:53,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:45:53,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:45:53,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 3638 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 04:45:53,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:45:53,922 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-09-08 04:45:53,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 04:45:53,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-09-08 04:45:53,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 04:45:53,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 04:45:53,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:45:53,935 INFO L87 Difference]: Start difference. First operand 361880 states and 596436 transitions. Second operand 10 states. [2019-09-08 04:46:12,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:46:12,428 INFO L93 Difference]: Finished difference Result 369684 states and 607274 transitions. [2019-09-08 04:46:12,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:46:12,429 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 348 [2019-09-08 04:46:12,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:46:14,374 INFO L225 Difference]: With dead ends: 369684 [2019-09-08 04:46:14,374 INFO L226 Difference]: Without dead ends: 363673 [2019-09-08 04:46:14,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:46:14,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363673 states. [2019-09-08 04:46:42,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363673 to 363470. [2019-09-08 04:46:42,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363470 states. [2019-09-08 04:46:43,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363470 states to 363470 states and 598656 transitions. [2019-09-08 04:46:43,842 INFO L78 Accepts]: Start accepts. Automaton has 363470 states and 598656 transitions. Word has length 348 [2019-09-08 04:46:43,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:46:43,843 INFO L475 AbstractCegarLoop]: Abstraction has 363470 states and 598656 transitions. [2019-09-08 04:46:43,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 04:46:43,843 INFO L276 IsEmpty]: Start isEmpty. Operand 363470 states and 598656 transitions. [2019-09-08 04:46:45,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2019-09-08 04:46:45,537 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:46:45,537 INFO L399 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:46:45,538 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:46:45,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:46:45,538 INFO L82 PathProgramCache]: Analyzing trace with hash -2058333026, now seen corresponding path program 1 times [2019-09-08 04:46:45,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:46:45,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:46:45,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:46:45,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:46:45,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:46:45,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:46:45,794 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-09-08 04:46:45,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:46:45,795 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 04:46:45,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:46:46,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:46:46,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 3675 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 04:46:46,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:46:47,231 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 04:46:47,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 04:46:47,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2019-09-08 04:46:47,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 04:46:47,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 04:46:47,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:46:47,252 INFO L87 Difference]: Start difference. First operand 363470 states and 598656 transitions. Second operand 13 states. [2019-09-08 04:47:01,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:47:01,677 INFO L93 Difference]: Finished difference Result 379607 states and 622817 transitions. [2019-09-08 04:47:01,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 04:47:01,677 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 361 [2019-09-08 04:47:01,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:47:02,662 INFO L225 Difference]: With dead ends: 379607 [2019-09-08 04:47:02,662 INFO L226 Difference]: Without dead ends: 373446 [2019-09-08 04:47:02,751 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2019-09-08 04:47:02,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373446 states. [2019-09-08 04:47:30,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373446 to 373395. [2019-09-08 04:47:30,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373395 states. [2019-09-08 04:47:31,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373395 states to 373395 states and 613644 transitions. [2019-09-08 04:47:31,583 INFO L78 Accepts]: Start accepts. Automaton has 373395 states and 613644 transitions. Word has length 361 [2019-09-08 04:47:31,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:47:31,583 INFO L475 AbstractCegarLoop]: Abstraction has 373395 states and 613644 transitions. [2019-09-08 04:47:31,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 04:47:31,583 INFO L276 IsEmpty]: Start isEmpty. Operand 373395 states and 613644 transitions. [2019-09-08 04:47:35,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-08 04:47:35,264 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:47:35,265 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:47:35,265 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:47:35,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:47:35,265 INFO L82 PathProgramCache]: Analyzing trace with hash -226513184, now seen corresponding path program 1 times [2019-09-08 04:47:35,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:47:35,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:47:35,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:47:35,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:47:35,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:47:35,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:47:35,461 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-09-08 04:47:35,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:47:35,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:47:35,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:47:35,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:47:35,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:47:35,463 INFO L87 Difference]: Start difference. First operand 373395 states and 613644 transitions. Second operand 7 states. [2019-09-08 04:47:57,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:47:57,920 INFO L93 Difference]: Finished difference Result 377307 states and 619119 transitions. [2019-09-08 04:47:57,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:47:57,920 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 318 [2019-09-08 04:47:57,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:47:58,984 INFO L225 Difference]: With dead ends: 377307 [2019-09-08 04:47:58,985 INFO L226 Difference]: Without dead ends: 373483 [2019-09-08 04:47:59,089 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:47:59,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373483 states. [2019-09-08 04:48:29,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373483 to 373483. [2019-09-08 04:48:29,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373483 states. [2019-09-08 04:48:30,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373483 states to 373483 states and 613728 transitions. [2019-09-08 04:48:30,451 INFO L78 Accepts]: Start accepts. Automaton has 373483 states and 613728 transitions. Word has length 318 [2019-09-08 04:48:30,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:48:30,451 INFO L475 AbstractCegarLoop]: Abstraction has 373483 states and 613728 transitions. [2019-09-08 04:48:30,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:48:30,451 INFO L276 IsEmpty]: Start isEmpty. Operand 373483 states and 613728 transitions. [2019-09-08 04:48:32,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-09-08 04:48:32,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:48:32,180 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:48:32,180 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:48:32,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:48:32,181 INFO L82 PathProgramCache]: Analyzing trace with hash 426863563, now seen corresponding path program 1 times [2019-09-08 04:48:32,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:48:32,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:48:32,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:48:32,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:48:32,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:48:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:48:32,423 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-09-08 04:48:32,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:48:32,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:48:32,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:48:32,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:48:32,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:48:32,434 INFO L87 Difference]: Start difference. First operand 373483 states and 613728 transitions. Second operand 9 states. [2019-09-08 04:48:48,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:48:48,131 INFO L93 Difference]: Finished difference Result 378925 states and 621396 transitions. [2019-09-08 04:48:48,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:48:48,132 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 319 [2019-09-08 04:48:48,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:48:49,358 INFO L225 Difference]: With dead ends: 378925 [2019-09-08 04:48:49,359 INFO L226 Difference]: Without dead ends: 373901 [2019-09-08 04:48:49,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:48:49,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373901 states.