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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/product-lines/email_spec0_product21.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:37:05,307 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:37:05,310 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:37:05,323 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:37:05,324 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:37:05,325 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:37:05,326 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:37:05,338 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:37:05,341 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:37:05,344 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:37:05,345 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:37:05,346 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:37:05,347 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:37:05,351 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:37:05,352 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:37:05,353 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:37:05,354 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:37:05,357 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:37:05,359 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:37:05,365 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:37:05,369 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:37:05,370 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:37:05,371 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:37:05,372 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:37:05,374 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:37:05,374 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:37:05,375 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:37:05,375 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:37:05,376 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:37:05,377 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:37:05,377 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:37:05,377 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:37:05,378 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:37:05,379 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:37:05,380 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:37:05,380 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:37:05,381 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:37:05,381 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:37:05,381 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:37:05,382 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:37:05,383 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:37:05,384 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 02:37:05,413 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:37:05,413 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:37:05,414 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:37:05,415 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:37:05,415 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:37:05,416 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:37:05,416 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:37:05,416 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:37:05,416 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:37:05,416 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:37:05,419 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:37:05,419 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:37:05,419 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:37:05,420 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:37:05,420 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:37:05,420 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:37:05,421 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:37:05,421 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:37:05,421 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:37:05,421 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:37:05,422 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:37:05,422 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:37:05,422 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:37:05,422 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:37:05,423 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:37:05,423 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:37:05,423 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:37:05,423 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:37:05,423 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:37:05,424 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:37:05,465 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:37:05,478 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:37:05,481 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:37:05,482 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:37:05,483 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:37:05,484 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec0_product21.cil.c [2019-09-10 02:37:05,545 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeed2e10b/4acbdab01a034ce195e4164c708806e7/FLAG95b6e0ad3 [2019-09-10 02:37:06,171 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:37:06,171 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec0_product21.cil.c [2019-09-10 02:37:06,196 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeed2e10b/4acbdab01a034ce195e4164c708806e7/FLAG95b6e0ad3 [2019-09-10 02:37:06,383 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeed2e10b/4acbdab01a034ce195e4164c708806e7 [2019-09-10 02:37:06,391 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:37:06,392 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:37:06,393 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:37:06,393 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:37:06,397 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:37:06,398 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:37:06" (1/1) ... [2019-09-10 02:37:06,400 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@706649c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:37:06, skipping insertion in model container [2019-09-10 02:37:06,401 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:37:06" (1/1) ... [2019-09-10 02:37:06,408 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:37:06,476 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:37:07,206 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:37:07,232 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:37:07,382 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:37:07,475 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:37:07,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:37:07 WrapperNode [2019-09-10 02:37:07,476 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:37:07,477 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:37:07,477 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:37:07,477 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:37:07,499 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:37:07" (1/1) ... [2019-09-10 02:37:07,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:37:07" (1/1) ... [2019-09-10 02:37:07,531 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:37:07" (1/1) ... [2019-09-10 02:37:07,532 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:37:07" (1/1) ... [2019-09-10 02:37:07,600 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:37:07" (1/1) ... [2019-09-10 02:37:07,634 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:37:07" (1/1) ... [2019-09-10 02:37:07,664 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:37:07" (1/1) ... [2019-09-10 02:37:07,683 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:37:07,684 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:37:07,684 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:37:07,684 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:37:07,685 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:37:07" (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-10 02:37:07,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:37:07,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:37:07,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-10 02:37:07,777 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-10 02:37:07,777 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-10 02:37:07,777 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-10 02:37:07,777 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-10 02:37:07,778 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-10 02:37:07,778 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-10 02:37:07,778 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-10 02:37:07,778 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-10 02:37:07,779 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-10 02:37:07,779 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-10 02:37:07,779 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-10 02:37:07,779 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-10 02:37:07,780 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-10 02:37:07,780 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-10 02:37:07,780 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-10 02:37:07,780 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-10 02:37:07,780 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-10 02:37:07,781 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-10 02:37:07,781 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-10 02:37:07,781 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-10 02:37:07,781 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-10 02:37:07,782 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-10 02:37:07,782 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-10 02:37:07,782 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-10 02:37:07,782 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-10 02:37:07,782 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-10 02:37:07,783 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-10 02:37:07,783 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-10 02:37:07,783 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-10 02:37:07,783 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-10 02:37:07,783 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-10 02:37:07,783 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-10 02:37:07,784 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-10 02:37:07,784 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-10 02:37:07,784 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-10 02:37:07,784 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-10 02:37:07,784 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-10 02:37:07,784 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-10 02:37:07,785 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-10 02:37:07,785 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-10 02:37:07,785 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-10 02:37:07,785 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-10 02:37:07,785 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-10 02:37:07,785 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-10 02:37:07,785 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-10 02:37:07,786 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-10 02:37:07,786 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-10 02:37:07,786 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-10 02:37:07,786 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-10 02:37:07,786 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-10 02:37:07,786 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-10 02:37:07,787 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-10 02:37:07,787 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-10 02:37:07,787 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-10 02:37:07,787 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-10 02:37:07,787 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-10 02:37:07,787 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-10 02:37:07,787 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-10 02:37:07,788 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-10 02:37:07,788 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-10 02:37:07,788 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-10 02:37:07,788 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-10 02:37:07,788 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-10 02:37:07,788 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__DecryptForward_spec__1 [2019-09-10 02:37:07,788 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-10 02:37:07,789 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-10 02:37:07,789 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-10 02:37:07,789 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-10 02:37:07,789 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-10 02:37:07,789 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-10 02:37:07,789 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-10 02:37:07,790 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-10 02:37:07,790 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-10 02:37:07,790 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:37:07,790 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-10 02:37:07,790 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-10 02:37:07,790 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-10 02:37:07,791 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-10 02:37:07,791 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-10 02:37:07,791 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-10 02:37:07,791 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-10 02:37:07,791 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-10 02:37:07,791 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-10 02:37:07,792 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-09-10 02:37:07,792 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-09-10 02:37:07,792 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-10 02:37:07,792 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-10 02:37:07,792 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2019-09-10 02:37:07,792 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-10 02:37:07,792 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-10 02:37:07,793 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AddressBook [2019-09-10 02:37:07,793 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-09-10 02:37:07,793 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-10 02:37:07,793 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-10 02:37:07,793 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-10 02:37:07,793 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-10 02:37:07,793 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-10 02:37:07,794 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-10 02:37:07,794 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-10 02:37:07,794 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-10 02:37:07,794 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-10 02:37:07,794 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-09-10 02:37:07,794 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-09-10 02:37:07,795 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-10 02:37:07,795 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-10 02:37:07,795 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-10 02:37:07,795 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-10 02:37:07,795 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-10 02:37:07,795 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-10 02:37:07,795 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:37:07,796 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:37:07,796 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-10 02:37:07,796 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-10 02:37:07,796 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-10 02:37:07,796 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-10 02:37:07,796 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-10 02:37:07,796 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-10 02:37:07,797 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-10 02:37:07,797 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-10 02:37:07,797 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-10 02:37:07,797 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-10 02:37:07,797 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-10 02:37:07,797 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-10 02:37:07,798 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-10 02:37:07,798 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-10 02:37:07,798 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-10 02:37:07,798 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-10 02:37:07,798 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-10 02:37:07,798 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-10 02:37:07,799 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-10 02:37:07,799 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-10 02:37:07,799 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-10 02:37:07,799 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-10 02:37:07,799 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-10 02:37:07,799 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-10 02:37:07,799 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-10 02:37:07,800 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-10 02:37:07,800 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-10 02:37:07,800 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-10 02:37:07,800 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-10 02:37:07,800 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-10 02:37:07,800 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-10 02:37:07,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 02:37:07,801 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-10 02:37:07,801 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-10 02:37:07,801 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-10 02:37:07,801 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-10 02:37:07,801 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-10 02:37:07,801 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-10 02:37:07,802 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-10 02:37:07,802 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-10 02:37:07,802 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-10 02:37:07,802 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-10 02:37:07,802 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-10 02:37:07,802 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-10 02:37:07,802 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-10 02:37:07,803 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-10 02:37:07,803 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-10 02:37:07,803 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-10 02:37:07,803 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-10 02:37:07,803 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-10 02:37:07,803 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-10 02:37:07,803 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-10 02:37:07,803 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-10 02:37:07,804 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-10 02:37:07,804 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-10 02:37:07,804 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-10 02:37:07,804 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-10 02:37:07,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-10 02:37:07,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-10 02:37:07,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 02:37:07,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-10 02:37:07,805 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-10 02:37:07,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 02:37:07,805 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-10 02:37:07,805 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-10 02:37:07,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 02:37:07,805 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-10 02:37:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-10 02:37:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-10 02:37:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-10 02:37:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-10 02:37:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-10 02:37:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-10 02:37:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-10 02:37:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-10 02:37:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-10 02:37:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-10 02:37:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-10 02:37:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-09-10 02:37:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-10 02:37:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-09-10 02:37:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-10 02:37:07,808 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-10 02:37:07,808 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-10 02:37:07,808 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-10 02:37:07,808 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-10 02:37:07,808 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-10 02:37:07,808 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__DecryptForward_spec__1 [2019-09-10 02:37:07,808 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-10 02:37:07,808 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-10 02:37:07,809 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-10 02:37:07,809 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-10 02:37:07,809 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-10 02:37:07,809 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-10 02:37:07,809 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-10 02:37:07,809 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-10 02:37:07,809 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-10 02:37:07,810 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-10 02:37:07,810 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-10 02:37:07,810 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:37:07,810 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-10 02:37:07,810 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-10 02:37:07,811 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-10 02:37:07,811 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-10 02:37:07,811 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-10 02:37:07,811 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-10 02:37:07,811 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-10 02:37:07,812 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-10 02:37:07,812 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-10 02:37:07,812 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-10 02:37:07,812 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-10 02:37:07,812 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-10 02:37:07,812 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-10 02:37:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-09-10 02:37:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-09-10 02:37:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-10 02:37:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2019-09-10 02:37:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AddressBook [2019-09-10 02:37:07,814 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-09-10 02:37:07,814 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-10 02:37:07,814 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-10 02:37:07,814 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-10 02:37:07,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:37:07,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-10 02:37:07,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:37:09,975 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:37:09,975 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-10 02:37:09,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:37:09 BoogieIcfgContainer [2019-09-10 02:37:09,977 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:37:09,978 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:37:09,978 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:37:09,982 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:37:09,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:37:06" (1/3) ... [2019-09-10 02:37:09,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34b88d2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:37:09, skipping insertion in model container [2019-09-10 02:37:09,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:37:07" (2/3) ... [2019-09-10 02:37:09,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34b88d2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:37:09, skipping insertion in model container [2019-09-10 02:37:09,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:37:09" (3/3) ... [2019-09-10 02:37:09,985 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec0_product21.cil.c [2019-09-10 02:37:09,997 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:37:10,008 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:37:10,029 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:37:10,072 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:37:10,072 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:37:10,072 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:37:10,072 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:37:10,072 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:37:10,072 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:37:10,073 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:37:10,073 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:37:10,112 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states. [2019-09-10 02:37:10,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-10 02:37:10,160 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:10,165 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:37:10,170 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:10,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:10,178 INFO L82 PathProgramCache]: Analyzing trace with hash -2004789445, now seen corresponding path program 1 times [2019-09-10 02:37:10,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:10,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:10,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:10,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:10,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:10,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:10,961 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:37:10,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:10,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-10 02:37:10,964 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:10,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:37:10,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:37:10,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:37:10,990 INFO L87 Difference]: Start difference. First operand 566 states. Second operand 2 states. [2019-09-10 02:37:11,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:11,064 INFO L93 Difference]: Finished difference Result 546 states and 744 transitions. [2019-09-10 02:37:11,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:37:11,066 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 198 [2019-09-10 02:37:11,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:11,087 INFO L225 Difference]: With dead ends: 546 [2019-09-10 02:37:11,087 INFO L226 Difference]: Without dead ends: 537 [2019-09-10 02:37:11,089 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-10 02:37:11,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-09-10 02:37:11,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2019-09-10 02:37:11,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-09-10 02:37:11,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 733 transitions. [2019-09-10 02:37:11,197 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 733 transitions. Word has length 198 [2019-09-10 02:37:11,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:11,199 INFO L475 AbstractCegarLoop]: Abstraction has 537 states and 733 transitions. [2019-09-10 02:37:11,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:37:11,199 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 733 transitions. [2019-09-10 02:37:11,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-10 02:37:11,209 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:11,209 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:37:11,210 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:11,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:11,211 INFO L82 PathProgramCache]: Analyzing trace with hash -24862393, now seen corresponding path program 1 times [2019-09-10 02:37:11,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:11,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:11,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:11,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:11,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:11,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:11,450 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:37:11,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:11,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:37:11,451 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:11,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:37:11,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:37:11,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:37:11,458 INFO L87 Difference]: Start difference. First operand 537 states and 733 transitions. Second operand 3 states. [2019-09-10 02:37:11,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:11,522 INFO L93 Difference]: Finished difference Result 540 states and 736 transitions. [2019-09-10 02:37:11,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:37:11,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2019-09-10 02:37:11,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:11,534 INFO L225 Difference]: With dead ends: 540 [2019-09-10 02:37:11,534 INFO L226 Difference]: Without dead ends: 540 [2019-09-10 02:37:11,535 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-10 02:37:11,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-09-10 02:37:11,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 539. [2019-09-10 02:37:11,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2019-09-10 02:37:11,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 735 transitions. [2019-09-10 02:37:11,588 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 735 transitions. Word has length 199 [2019-09-10 02:37:11,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:11,589 INFO L475 AbstractCegarLoop]: Abstraction has 539 states and 735 transitions. [2019-09-10 02:37:11,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:37:11,590 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 735 transitions. [2019-09-10 02:37:11,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-10 02:37:11,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:11,596 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:37:11,597 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:11,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:11,597 INFO L82 PathProgramCache]: Analyzing trace with hash 712401851, now seen corresponding path program 1 times [2019-09-10 02:37:11,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:11,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:11,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:11,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:11,599 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:11,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:11,827 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:37:11,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:11,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:37:11,828 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:11,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:37:11,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:37:11,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:37:11,833 INFO L87 Difference]: Start difference. First operand 539 states and 735 transitions. Second operand 3 states. [2019-09-10 02:37:11,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:11,866 INFO L93 Difference]: Finished difference Result 582 states and 808 transitions. [2019-09-10 02:37:11,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:37:11,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-09-10 02:37:11,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:11,872 INFO L225 Difference]: With dead ends: 582 [2019-09-10 02:37:11,872 INFO L226 Difference]: Without dead ends: 582 [2019-09-10 02:37:11,873 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-10 02:37:11,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-09-10 02:37:11,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 581. [2019-09-10 02:37:11,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 581 states. [2019-09-10 02:37:11,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 807 transitions. [2019-09-10 02:37:11,898 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 807 transitions. Word has length 205 [2019-09-10 02:37:11,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:11,899 INFO L475 AbstractCegarLoop]: Abstraction has 581 states and 807 transitions. [2019-09-10 02:37:11,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:37:11,899 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 807 transitions. [2019-09-10 02:37:11,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-09-10 02:37:11,904 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:11,904 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:37:11,905 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:11,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:11,905 INFO L82 PathProgramCache]: Analyzing trace with hash -2088954863, now seen corresponding path program 1 times [2019-09-10 02:37:11,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:11,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:11,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:11,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:11,907 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:12,310 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:37:12,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:12,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 02:37:12,311 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:12,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 02:37:12,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 02:37:12,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-09-10 02:37:12,313 INFO L87 Difference]: Start difference. First operand 581 states and 807 transitions. Second operand 19 states. [2019-09-10 02:37:17,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:17,277 INFO L93 Difference]: Finished difference Result 1691 states and 2371 transitions. [2019-09-10 02:37:17,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-10 02:37:17,277 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 206 [2019-09-10 02:37:17,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:17,291 INFO L225 Difference]: With dead ends: 1691 [2019-09-10 02:37:17,291 INFO L226 Difference]: Without dead ends: 1691 [2019-09-10 02:37:17,293 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=287, Invalid=2683, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 02:37:17,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2019-09-10 02:37:17,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 1654. [2019-09-10 02:37:17,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1654 states. [2019-09-10 02:37:17,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 2323 transitions. [2019-09-10 02:37:17,361 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 2323 transitions. Word has length 206 [2019-09-10 02:37:17,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:17,362 INFO L475 AbstractCegarLoop]: Abstraction has 1654 states and 2323 transitions. [2019-09-10 02:37:17,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 02:37:17,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 2323 transitions. [2019-09-10 02:37:17,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-10 02:37:17,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:17,370 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:37:17,370 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:17,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:17,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1909535068, now seen corresponding path program 1 times [2019-09-10 02:37:17,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:17,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:17,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:17,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:17,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:17,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:17,681 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-10 02:37:17,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:17,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 02:37:17,682 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:17,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 02:37:17,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 02:37:17,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:37:17,684 INFO L87 Difference]: Start difference. First operand 1654 states and 2323 transitions. Second operand 16 states. [2019-09-10 02:37:18,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:18,242 INFO L93 Difference]: Finished difference Result 1832 states and 2594 transitions. [2019-09-10 02:37:18,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 02:37:18,243 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 207 [2019-09-10 02:37:18,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:18,255 INFO L225 Difference]: With dead ends: 1832 [2019-09-10 02:37:18,256 INFO L226 Difference]: Without dead ends: 1824 [2019-09-10 02:37:18,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-09-10 02:37:18,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1824 states. [2019-09-10 02:37:18,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1824 to 1824. [2019-09-10 02:37:18,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1824 states. [2019-09-10 02:37:18,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 2576 transitions. [2019-09-10 02:37:18,375 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 2576 transitions. Word has length 207 [2019-09-10 02:37:18,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:18,376 INFO L475 AbstractCegarLoop]: Abstraction has 1824 states and 2576 transitions. [2019-09-10 02:37:18,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 02:37:18,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2576 transitions. [2019-09-10 02:37:18,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-10 02:37:18,387 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:18,388 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:37:18,388 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:18,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:18,389 INFO L82 PathProgramCache]: Analyzing trace with hash 392350703, now seen corresponding path program 1 times [2019-09-10 02:37:18,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:18,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:18,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:18,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:18,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:18,744 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:37:18,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:18,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 02:37:18,745 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:18,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 02:37:18,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 02:37:18,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-09-10 02:37:18,746 INFO L87 Difference]: Start difference. First operand 1824 states and 2576 transitions. Second operand 15 states. [2019-09-10 02:37:22,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:22,658 INFO L93 Difference]: Finished difference Result 1924 states and 2722 transitions. [2019-09-10 02:37:22,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-10 02:37:22,659 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 207 [2019-09-10 02:37:22,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:22,671 INFO L225 Difference]: With dead ends: 1924 [2019-09-10 02:37:22,672 INFO L226 Difference]: Without dead ends: 1924 [2019-09-10 02:37:22,673 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=229, Invalid=1933, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 02:37:22,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1924 states. [2019-09-10 02:37:22,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1924 to 1894. [2019-09-10 02:37:22,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1894 states. [2019-09-10 02:37:22,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 2689 transitions. [2019-09-10 02:37:22,753 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 2689 transitions. Word has length 207 [2019-09-10 02:37:22,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:22,756 INFO L475 AbstractCegarLoop]: Abstraction has 1894 states and 2689 transitions. [2019-09-10 02:37:22,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 02:37:22,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 2689 transitions. [2019-09-10 02:37:22,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-10 02:37:22,765 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:22,765 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:37:22,766 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:22,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:22,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1263804375, now seen corresponding path program 1 times [2019-09-10 02:37:22,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:22,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:22,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:22,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:22,773 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:22,991 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:37:22,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:22,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:37:22,991 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:22,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:37:22,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:37:22,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:37:22,993 INFO L87 Difference]: Start difference. First operand 1894 states and 2689 transitions. Second operand 5 states. [2019-09-10 02:37:24,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:24,461 INFO L93 Difference]: Finished difference Result 4065 states and 5754 transitions. [2019-09-10 02:37:24,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:37:24,462 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 207 [2019-09-10 02:37:24,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:24,489 INFO L225 Difference]: With dead ends: 4065 [2019-09-10 02:37:24,489 INFO L226 Difference]: Without dead ends: 4065 [2019-09-10 02:37:24,489 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-10 02:37:24,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4065 states. [2019-09-10 02:37:24,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4065 to 4047. [2019-09-10 02:37:24,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4047 states. [2019-09-10 02:37:24,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4047 states to 4047 states and 5732 transitions. [2019-09-10 02:37:24,686 INFO L78 Accepts]: Start accepts. Automaton has 4047 states and 5732 transitions. Word has length 207 [2019-09-10 02:37:24,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:24,690 INFO L475 AbstractCegarLoop]: Abstraction has 4047 states and 5732 transitions. [2019-09-10 02:37:24,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:37:24,690 INFO L276 IsEmpty]: Start isEmpty. Operand 4047 states and 5732 transitions. [2019-09-10 02:37:24,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-10 02:37:24,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:24,707 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:37:24,707 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:24,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:24,708 INFO L82 PathProgramCache]: Analyzing trace with hash -154989176, now seen corresponding path program 1 times [2019-09-10 02:37:24,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:24,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:24,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:24,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:24,710 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:24,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:25,017 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:37:25,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:25,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:37:25,019 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:25,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:37:25,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:37:25,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:37:25,021 INFO L87 Difference]: Start difference. First operand 4047 states and 5732 transitions. Second operand 6 states. [2019-09-10 02:37:25,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:25,693 INFO L93 Difference]: Finished difference Result 8129 states and 11520 transitions. [2019-09-10 02:37:25,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:37:25,694 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 207 [2019-09-10 02:37:25,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:25,744 INFO L225 Difference]: With dead ends: 8129 [2019-09-10 02:37:25,745 INFO L226 Difference]: Without dead ends: 8129 [2019-09-10 02:37:25,745 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-10 02:37:25,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8129 states. [2019-09-10 02:37:26,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8129 to 8086. [2019-09-10 02:37:26,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8086 states. [2019-09-10 02:37:26,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8086 states to 8086 states and 11458 transitions. [2019-09-10 02:37:26,094 INFO L78 Accepts]: Start accepts. Automaton has 8086 states and 11458 transitions. Word has length 207 [2019-09-10 02:37:26,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:26,095 INFO L475 AbstractCegarLoop]: Abstraction has 8086 states and 11458 transitions. [2019-09-10 02:37:26,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:37:26,095 INFO L276 IsEmpty]: Start isEmpty. Operand 8086 states and 11458 transitions. [2019-09-10 02:37:26,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-10 02:37:26,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:26,118 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:37:26,118 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:26,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:26,119 INFO L82 PathProgramCache]: Analyzing trace with hash 927792726, now seen corresponding path program 1 times [2019-09-10 02:37:26,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:26,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:26,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:26,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:26,120 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:26,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:26,360 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:37:26,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:26,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 02:37:26,361 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:26,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:37:26,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:37:26,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:37:26,362 INFO L87 Difference]: Start difference. First operand 8086 states and 11458 transitions. Second operand 9 states. [2019-09-10 02:37:26,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:26,564 INFO L93 Difference]: Finished difference Result 8776 states and 12498 transitions. [2019-09-10 02:37:26,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:37:26,565 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 208 [2019-09-10 02:37:26,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:26,626 INFO L225 Difference]: With dead ends: 8776 [2019-09-10 02:37:26,626 INFO L226 Difference]: Without dead ends: 8776 [2019-09-10 02:37:26,627 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-10 02:37:26,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8776 states. [2019-09-10 02:37:26,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8776 to 8716. [2019-09-10 02:37:26,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8716 states. [2019-09-10 02:37:27,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8716 states to 8716 states and 12428 transitions. [2019-09-10 02:37:27,016 INFO L78 Accepts]: Start accepts. Automaton has 8716 states and 12428 transitions. Word has length 208 [2019-09-10 02:37:27,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:27,017 INFO L475 AbstractCegarLoop]: Abstraction has 8716 states and 12428 transitions. [2019-09-10 02:37:27,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:37:27,018 INFO L276 IsEmpty]: Start isEmpty. Operand 8716 states and 12428 transitions. [2019-09-10 02:37:27,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-10 02:37:27,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:27,036 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:37:27,036 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:27,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:27,037 INFO L82 PathProgramCache]: Analyzing trace with hash -464354170, now seen corresponding path program 1 times [2019-09-10 02:37:27,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:27,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:27,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:27,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:27,040 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:27,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:27,276 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:37:27,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:27,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:37:27,277 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:27,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:37:27,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:37:27,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:37:27,278 INFO L87 Difference]: Start difference. First operand 8716 states and 12428 transitions. Second operand 6 states. [2019-09-10 02:37:27,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:27,882 INFO L93 Difference]: Finished difference Result 17567 states and 25051 transitions. [2019-09-10 02:37:27,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:37:27,883 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 209 [2019-09-10 02:37:27,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:27,970 INFO L225 Difference]: With dead ends: 17567 [2019-09-10 02:37:27,971 INFO L226 Difference]: Without dead ends: 17567 [2019-09-10 02:37:27,971 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-10 02:37:27,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17567 states. [2019-09-10 02:37:29,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17567 to 17404. [2019-09-10 02:37:29,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17404 states. [2019-09-10 02:37:29,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17404 states to 17404 states and 24839 transitions. [2019-09-10 02:37:29,311 INFO L78 Accepts]: Start accepts. Automaton has 17404 states and 24839 transitions. Word has length 209 [2019-09-10 02:37:29,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:29,311 INFO L475 AbstractCegarLoop]: Abstraction has 17404 states and 24839 transitions. [2019-09-10 02:37:29,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:37:29,311 INFO L276 IsEmpty]: Start isEmpty. Operand 17404 states and 24839 transitions. [2019-09-10 02:37:29,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-10 02:37:29,341 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:29,341 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:37:29,341 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:29,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:29,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1595148004, now seen corresponding path program 1 times [2019-09-10 02:37:29,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:29,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:29,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:29,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:29,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:29,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:29,538 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:37:29,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:29,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 02:37:29,539 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:29,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:37:29,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:37:29,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:37:29,540 INFO L87 Difference]: Start difference. First operand 17404 states and 24839 transitions. Second operand 9 states. [2019-09-10 02:37:29,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:29,745 INFO L93 Difference]: Finished difference Result 18464 states and 26409 transitions. [2019-09-10 02:37:29,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:37:29,746 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 210 [2019-09-10 02:37:29,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:29,818 INFO L225 Difference]: With dead ends: 18464 [2019-09-10 02:37:29,818 INFO L226 Difference]: Without dead ends: 18464 [2019-09-10 02:37:29,819 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-10 02:37:29,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18464 states. [2019-09-10 02:37:30,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18464 to 18394. [2019-09-10 02:37:30,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18394 states. [2019-09-10 02:37:30,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18394 states to 18394 states and 26314 transitions. [2019-09-10 02:37:30,419 INFO L78 Accepts]: Start accepts. Automaton has 18394 states and 26314 transitions. Word has length 210 [2019-09-10 02:37:30,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:30,419 INFO L475 AbstractCegarLoop]: Abstraction has 18394 states and 26314 transitions. [2019-09-10 02:37:30,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:37:30,420 INFO L276 IsEmpty]: Start isEmpty. Operand 18394 states and 26314 transitions. [2019-09-10 02:37:30,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-10 02:37:30,450 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:30,450 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:37:30,450 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:30,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:30,451 INFO L82 PathProgramCache]: Analyzing trace with hash 164838088, now seen corresponding path program 1 times [2019-09-10 02:37:30,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:30,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:30,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:30,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:30,452 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:30,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:30,776 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:37:30,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:30,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:37:30,776 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:30,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:37:30,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:37:30,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:37:30,778 INFO L87 Difference]: Start difference. First operand 18394 states and 26314 transitions. Second operand 6 states. [2019-09-10 02:37:31,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:31,431 INFO L93 Difference]: Finished difference Result 36383 states and 52128 transitions. [2019-09-10 02:37:31,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:37:31,431 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 211 [2019-09-10 02:37:31,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:31,581 INFO L225 Difference]: With dead ends: 36383 [2019-09-10 02:37:31,582 INFO L226 Difference]: Without dead ends: 33194 [2019-09-10 02:37:31,582 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-10 02:37:31,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33194 states. [2019-09-10 02:37:32,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33194 to 32899. [2019-09-10 02:37:32,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32899 states. [2019-09-10 02:37:32,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32899 states to 32899 states and 47287 transitions. [2019-09-10 02:37:32,963 INFO L78 Accepts]: Start accepts. Automaton has 32899 states and 47287 transitions. Word has length 211 [2019-09-10 02:37:32,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:32,964 INFO L475 AbstractCegarLoop]: Abstraction has 32899 states and 47287 transitions. [2019-09-10 02:37:32,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:37:32,964 INFO L276 IsEmpty]: Start isEmpty. Operand 32899 states and 47287 transitions. [2019-09-10 02:37:33,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-10 02:37:33,048 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:33,048 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:37:33,049 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:33,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:33,049 INFO L82 PathProgramCache]: Analyzing trace with hash -2108044564, now seen corresponding path program 1 times [2019-09-10 02:37:33,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:33,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:33,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:33,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:33,053 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:33,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:33,285 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:37:33,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:33,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:37:33,286 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:33,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:37:33,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:37:33,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:37:33,288 INFO L87 Difference]: Start difference. First operand 32899 states and 47287 transitions. Second operand 3 states. [2019-09-10 02:37:33,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:33,552 INFO L93 Difference]: Finished difference Result 34960 states and 51034 transitions. [2019-09-10 02:37:33,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:37:33,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 222 [2019-09-10 02:37:33,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:33,716 INFO L225 Difference]: With dead ends: 34960 [2019-09-10 02:37:33,717 INFO L226 Difference]: Without dead ends: 34960 [2019-09-10 02:37:33,717 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-10 02:37:33,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34960 states. [2019-09-10 02:37:36,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34960 to 34939. [2019-09-10 02:37:36,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34939 states. [2019-09-10 02:37:36,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34939 states to 34939 states and 51013 transitions. [2019-09-10 02:37:36,212 INFO L78 Accepts]: Start accepts. Automaton has 34939 states and 51013 transitions. Word has length 222 [2019-09-10 02:37:36,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:36,212 INFO L475 AbstractCegarLoop]: Abstraction has 34939 states and 51013 transitions. [2019-09-10 02:37:36,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:37:36,213 INFO L276 IsEmpty]: Start isEmpty. Operand 34939 states and 51013 transitions. [2019-09-10 02:37:36,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-09-10 02:37:36,279 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:36,279 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:37:36,280 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:36,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:36,280 INFO L82 PathProgramCache]: Analyzing trace with hash -685048074, now seen corresponding path program 1 times [2019-09-10 02:37:36,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:36,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:36,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:36,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:36,282 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:36,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:36,501 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:37:36,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:36,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:37:36,502 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:36,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:37:36,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:37:36,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:37:36,504 INFO L87 Difference]: Start difference. First operand 34939 states and 51013 transitions. Second operand 3 states. [2019-09-10 02:37:36,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:36,790 INFO L93 Difference]: Finished difference Result 38800 states and 58054 transitions. [2019-09-10 02:37:36,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:37:36,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 223 [2019-09-10 02:37:36,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:36,957 INFO L225 Difference]: With dead ends: 38800 [2019-09-10 02:37:36,957 INFO L226 Difference]: Without dead ends: 38800 [2019-09-10 02:37:36,959 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-10 02:37:36,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38800 states. [2019-09-10 02:37:38,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38800 to 38779. [2019-09-10 02:37:38,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38779 states. [2019-09-10 02:37:38,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38779 states to 38779 states and 58033 transitions. [2019-09-10 02:37:38,915 INFO L78 Accepts]: Start accepts. Automaton has 38779 states and 58033 transitions. Word has length 223 [2019-09-10 02:37:38,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:38,916 INFO L475 AbstractCegarLoop]: Abstraction has 38779 states and 58033 transitions. [2019-09-10 02:37:38,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:37:38,916 INFO L276 IsEmpty]: Start isEmpty. Operand 38779 states and 58033 transitions. [2019-09-10 02:37:38,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-09-10 02:37:38,981 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:38,981 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:37:38,981 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:38,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:38,982 INFO L82 PathProgramCache]: Analyzing trace with hash 120941706, now seen corresponding path program 1 times [2019-09-10 02:37:38,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:38,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:38,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:38,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:38,984 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:39,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:39,124 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:37:39,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:39,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:37:39,124 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:39,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:37:39,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:37:39,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:37:39,126 INFO L87 Difference]: Start difference. First operand 38779 states and 58033 transitions. Second operand 3 states. [2019-09-10 02:37:39,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:39,390 INFO L93 Difference]: Finished difference Result 46192 states and 71326 transitions. [2019-09-10 02:37:39,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:37:39,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2019-09-10 02:37:39,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:39,575 INFO L225 Difference]: With dead ends: 46192 [2019-09-10 02:37:39,575 INFO L226 Difference]: Without dead ends: 46192 [2019-09-10 02:37:39,577 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-10 02:37:39,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46192 states. [2019-09-10 02:37:41,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46192 to 46171. [2019-09-10 02:37:41,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46171 states. [2019-09-10 02:37:41,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46171 states to 46171 states and 71305 transitions. [2019-09-10 02:37:41,452 INFO L78 Accepts]: Start accepts. Automaton has 46171 states and 71305 transitions. Word has length 224 [2019-09-10 02:37:41,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:41,452 INFO L475 AbstractCegarLoop]: Abstraction has 46171 states and 71305 transitions. [2019-09-10 02:37:41,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:37:41,452 INFO L276 IsEmpty]: Start isEmpty. Operand 46171 states and 71305 transitions. [2019-09-10 02:37:41,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 02:37:41,554 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:41,554 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:37:41,555 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:41,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:41,555 INFO L82 PathProgramCache]: Analyzing trace with hash 158828310, now seen corresponding path program 1 times [2019-09-10 02:37:41,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:41,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:41,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:41,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:41,557 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:41,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:41,712 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:37:41,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:41,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:37:41,712 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:41,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:37:41,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:37:41,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:37:41,714 INFO L87 Difference]: Start difference. First operand 46171 states and 71305 transitions. Second operand 3 states. [2019-09-10 02:37:42,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:42,040 INFO L93 Difference]: Finished difference Result 60400 states and 96526 transitions. [2019-09-10 02:37:42,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:37:42,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2019-09-10 02:37:42,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:43,790 INFO L225 Difference]: With dead ends: 60400 [2019-09-10 02:37:43,791 INFO L226 Difference]: Without dead ends: 60400 [2019-09-10 02:37:43,791 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-10 02:37:43,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60400 states. [2019-09-10 02:37:45,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60400 to 60379. [2019-09-10 02:37:45,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60379 states. [2019-09-10 02:37:45,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60379 states to 60379 states and 96505 transitions. [2019-09-10 02:37:45,444 INFO L78 Accepts]: Start accepts. Automaton has 60379 states and 96505 transitions. Word has length 225 [2019-09-10 02:37:45,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:45,444 INFO L475 AbstractCegarLoop]: Abstraction has 60379 states and 96505 transitions. [2019-09-10 02:37:45,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:37:45,445 INFO L276 IsEmpty]: Start isEmpty. Operand 60379 states and 96505 transitions. [2019-09-10 02:37:45,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-09-10 02:37:45,598 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:45,598 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:37:45,598 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:45,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:45,599 INFO L82 PathProgramCache]: Analyzing trace with hash -470653586, now seen corresponding path program 1 times [2019-09-10 02:37:45,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:45,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:45,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:45,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:45,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:45,819 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:37:45,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:45,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:37:45,820 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:45,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:37:45,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:37:45,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:37:45,821 INFO L87 Difference]: Start difference. First operand 60379 states and 96505 transitions. Second operand 7 states. [2019-09-10 02:37:48,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:48,517 INFO L93 Difference]: Finished difference Result 113083 states and 180960 transitions. [2019-09-10 02:37:48,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 02:37:48,517 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 224 [2019-09-10 02:37:48,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:49,033 INFO L225 Difference]: With dead ends: 113083 [2019-09-10 02:37:49,034 INFO L226 Difference]: Without dead ends: 113083 [2019-09-10 02:37:49,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-10 02:37:49,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113083 states. [2019-09-10 02:37:52,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113083 to 113077. [2019-09-10 02:37:52,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113077 states. [2019-09-10 02:37:52,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113077 states to 113077 states and 180956 transitions. [2019-09-10 02:37:52,678 INFO L78 Accepts]: Start accepts. Automaton has 113077 states and 180956 transitions. Word has length 224 [2019-09-10 02:37:52,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:52,678 INFO L475 AbstractCegarLoop]: Abstraction has 113077 states and 180956 transitions. [2019-09-10 02:37:52,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:37:52,678 INFO L276 IsEmpty]: Start isEmpty. Operand 113077 states and 180956 transitions. [2019-09-10 02:37:52,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-09-10 02:37:52,802 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:52,803 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:37:52,803 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:52,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:52,804 INFO L82 PathProgramCache]: Analyzing trace with hash 435851585, now seen corresponding path program 1 times [2019-09-10 02:37:52,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:52,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:52,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:52,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:52,805 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:52,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:52,999 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:37:52,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:52,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 02:37:53,000 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:53,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:37:53,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:37:53,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:37:53,001 INFO L87 Difference]: Start difference. First operand 113077 states and 180956 transitions. Second operand 9 states. [2019-09-10 02:37:53,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:53,716 INFO L93 Difference]: Finished difference Result 113369 states and 181145 transitions. [2019-09-10 02:37:53,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:37:53,717 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 227 [2019-09-10 02:37:53,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:54,271 INFO L225 Difference]: With dead ends: 113369 [2019-09-10 02:37:54,272 INFO L226 Difference]: Without dead ends: 113193 [2019-09-10 02:37:54,272 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-10 02:37:54,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113193 states. [2019-09-10 02:37:59,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113193 to 112689. [2019-09-10 02:37:59,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112689 states. [2019-09-10 02:38:00,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112689 states to 112689 states and 179507 transitions. [2019-09-10 02:38:00,717 INFO L78 Accepts]: Start accepts. Automaton has 112689 states and 179507 transitions. Word has length 227 [2019-09-10 02:38:00,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:38:00,717 INFO L475 AbstractCegarLoop]: Abstraction has 112689 states and 179507 transitions. [2019-09-10 02:38:00,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:38:00,718 INFO L276 IsEmpty]: Start isEmpty. Operand 112689 states and 179507 transitions. [2019-09-10 02:38:00,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 02:38:00,817 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:38:00,817 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:38:00,818 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:38:00,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:38:00,819 INFO L82 PathProgramCache]: Analyzing trace with hash -474545987, now seen corresponding path program 1 times [2019-09-10 02:38:00,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:38:00,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:00,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:38:00,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:00,820 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:38:00,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:38:01,261 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:38:01,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:38:01,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 02:38:01,261 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:38:01,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 02:38:01,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 02:38:01,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-09-10 02:38:01,263 INFO L87 Difference]: Start difference. First operand 112689 states and 179507 transitions. Second operand 26 states. [2019-09-10 02:38:02,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:38:02,748 INFO L93 Difference]: Finished difference Result 125782 states and 199638 transitions. [2019-09-10 02:38:02,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 02:38:02,749 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 225 [2019-09-10 02:38:02,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:38:03,301 INFO L225 Difference]: With dead ends: 125782 [2019-09-10 02:38:03,302 INFO L226 Difference]: Without dead ends: 125782 [2019-09-10 02:38:03,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=1239, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 02:38:03,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125782 states. [2019-09-10 02:38:09,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125782 to 125591. [2019-09-10 02:38:09,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125591 states. [2019-09-10 02:38:09,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125591 states to 125591 states and 199327 transitions. [2019-09-10 02:38:09,445 INFO L78 Accepts]: Start accepts. Automaton has 125591 states and 199327 transitions. Word has length 225 [2019-09-10 02:38:09,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:38:09,446 INFO L475 AbstractCegarLoop]: Abstraction has 125591 states and 199327 transitions. [2019-09-10 02:38:09,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 02:38:09,446 INFO L276 IsEmpty]: Start isEmpty. Operand 125591 states and 199327 transitions. [2019-09-10 02:38:09,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-10 02:38:09,576 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:38:09,576 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:38:09,576 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:38:09,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:38:09,577 INFO L82 PathProgramCache]: Analyzing trace with hash 219153513, now seen corresponding path program 1 times [2019-09-10 02:38:09,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:38:09,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:09,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:38:09,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:09,578 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:38:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:38:10,525 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:38:10,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:38:10,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:38:10,526 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:38:10,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:38:10,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:38:10,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:38:10,528 INFO L87 Difference]: Start difference. First operand 125591 states and 199327 transitions. Second operand 10 states. [2019-09-10 02:38:11,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:38:11,490 INFO L93 Difference]: Finished difference Result 126431 states and 200312 transitions. [2019-09-10 02:38:11,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 02:38:11,491 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 229 [2019-09-10 02:38:11,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:38:12,078 INFO L225 Difference]: With dead ends: 126431 [2019-09-10 02:38:12,079 INFO L226 Difference]: Without dead ends: 126427 [2019-09-10 02:38:12,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:38:12,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126427 states. [2019-09-10 02:38:17,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126427 to 126427. [2019-09-10 02:38:17,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126427 states. [2019-09-10 02:38:18,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126427 states to 126427 states and 200306 transitions. [2019-09-10 02:38:18,390 INFO L78 Accepts]: Start accepts. Automaton has 126427 states and 200306 transitions. Word has length 229 [2019-09-10 02:38:18,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:38:18,390 INFO L475 AbstractCegarLoop]: Abstraction has 126427 states and 200306 transitions. [2019-09-10 02:38:18,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:38:18,390 INFO L276 IsEmpty]: Start isEmpty. Operand 126427 states and 200306 transitions. [2019-09-10 02:38:18,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-09-10 02:38:18,494 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:38:18,494 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:38:18,494 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:38:18,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:38:18,494 INFO L82 PathProgramCache]: Analyzing trace with hash -68789459, now seen corresponding path program 1 times [2019-09-10 02:38:18,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:38:18,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:18,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:38:18,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:18,496 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:38:18,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:38:18,626 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:38:18,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:38:18,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:38:18,627 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:38:18,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:38:18,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:38:18,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:38:18,628 INFO L87 Difference]: Start difference. First operand 126427 states and 200306 transitions. Second operand 5 states. [2019-09-10 02:38:19,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:38:19,285 INFO L93 Difference]: Finished difference Result 129500 states and 208638 transitions. [2019-09-10 02:38:19,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:38:19,285 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 234 [2019-09-10 02:38:19,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:38:19,786 INFO L225 Difference]: With dead ends: 129500 [2019-09-10 02:38:19,786 INFO L226 Difference]: Without dead ends: 129500 [2019-09-10 02:38:19,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:38:19,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129500 states. [2019-09-10 02:38:28,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129500 to 127889. [2019-09-10 02:38:28,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127889 states. [2019-09-10 02:38:28,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127889 states to 127889 states and 202016 transitions. [2019-09-10 02:38:28,455 INFO L78 Accepts]: Start accepts. Automaton has 127889 states and 202016 transitions. Word has length 234 [2019-09-10 02:38:28,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:38:28,455 INFO L475 AbstractCegarLoop]: Abstraction has 127889 states and 202016 transitions. [2019-09-10 02:38:28,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:38:28,456 INFO L276 IsEmpty]: Start isEmpty. Operand 127889 states and 202016 transitions. [2019-09-10 02:38:28,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-09-10 02:38:28,554 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:38:28,554 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:38:28,554 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:38:28,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:38:28,555 INFO L82 PathProgramCache]: Analyzing trace with hash -860125851, now seen corresponding path program 1 times [2019-09-10 02:38:28,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:38:28,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:28,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:38:28,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:28,556 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:38:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:38:28,784 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:38:28,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:38:28,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 02:38:28,785 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:38:28,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 02:38:28,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 02:38:28,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:38:28,787 INFO L87 Difference]: Start difference. First operand 127889 states and 202016 transitions. Second operand 11 states. [2019-09-10 02:38:29,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:38:29,907 INFO L93 Difference]: Finished difference Result 128355 states and 202288 transitions. [2019-09-10 02:38:29,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:38:29,909 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 234 [2019-09-10 02:38:29,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:38:30,493 INFO L225 Difference]: With dead ends: 128355 [2019-09-10 02:38:30,493 INFO L226 Difference]: Without dead ends: 128355 [2019-09-10 02:38:30,494 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-10 02:38:30,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128355 states. [2019-09-10 02:38:33,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128355 to 128221. [2019-09-10 02:38:33,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128221 states. [2019-09-10 02:38:34,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128221 states to 128221 states and 202154 transitions. [2019-09-10 02:38:34,105 INFO L78 Accepts]: Start accepts. Automaton has 128221 states and 202154 transitions. Word has length 234 [2019-09-10 02:38:34,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:38:34,105 INFO L475 AbstractCegarLoop]: Abstraction has 128221 states and 202154 transitions. [2019-09-10 02:38:34,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 02:38:34,105 INFO L276 IsEmpty]: Start isEmpty. Operand 128221 states and 202154 transitions. [2019-09-10 02:38:34,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-10 02:38:34,218 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:38:34,218 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:38:34,219 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:38:34,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:38:34,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1569687073, now seen corresponding path program 1 times [2019-09-10 02:38:34,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:38:34,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:34,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:38:34,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:34,220 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:38:34,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:38:34,377 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:38:34,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:38:34,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:38:34,378 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:38:34,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:38:34,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:38:34,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:38:34,379 INFO L87 Difference]: Start difference. First operand 128221 states and 202154 transitions. Second operand 6 states. [2019-09-10 02:38:37,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:38:37,155 INFO L93 Difference]: Finished difference Result 259051 states and 420005 transitions. [2019-09-10 02:38:37,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:38:37,155 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 237 [2019-09-10 02:38:37,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:38:38,160 INFO L225 Difference]: With dead ends: 259051 [2019-09-10 02:38:38,160 INFO L226 Difference]: Without dead ends: 259051 [2019-09-10 02:38:38,160 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-10 02:38:38,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259051 states. [2019-09-10 02:38:48,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259051 to 255901. [2019-09-10 02:38:48,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255901 states. [2019-09-10 02:38:50,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255901 states to 255901 states and 408825 transitions. [2019-09-10 02:38:50,935 INFO L78 Accepts]: Start accepts. Automaton has 255901 states and 408825 transitions. Word has length 237 [2019-09-10 02:38:50,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:38:50,935 INFO L475 AbstractCegarLoop]: Abstraction has 255901 states and 408825 transitions. [2019-09-10 02:38:50,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:38:50,936 INFO L276 IsEmpty]: Start isEmpty. Operand 255901 states and 408825 transitions. [2019-09-10 02:38:51,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-10 02:38:51,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:38:51,211 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:38:51,212 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:38:51,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:38:51,212 INFO L82 PathProgramCache]: Analyzing trace with hash 729185400, now seen corresponding path program 1 times [2019-09-10 02:38:51,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:38:51,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:51,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:38:51,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:51,214 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:38:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:38:51,403 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 02:38:51,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:38:51,403 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:38:51,404 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 255 with the following transitions: [2019-09-10 02:38:51,407 INFO L207 CegarAbsIntRunner]: [44], [47], [50], [72], [75], [85], [109], [112], [122], [123], [139], [142], [151], [152], [155], [156], [157], [159], [255], [258], [264], [269], [271], [275], [278], [279], [280], [283], [289], [323], [326], [335], [336], [338], [341], [345], [346], [348], [349], [352], [362], [363], [364], [375], [377], [394], [397], [406], [503], [584], [586], [587], [588], [595], [606], [608], [613], [637], [640], [654], [693], [694], [695], [697], [700], [703], [709], [733], [737], [740], [748], [751], [762], [765], [775], [776], [778], [781], [783], [786], [788], [790], [793], [809], [818], [822], [824], [826], [829], [836], [843], [848], [855], [862], [869], [876], [883], [890], [897], [900], [902], [1109], [1163], [1166], [1180], [1181], [1183], [1200], [1204], [1215], [1218], [1219], [1222], [1226], [1230], [1256], [1257], [1259], [1261], [1268], [1274], [1276], [1359], [1362], [1368], [1389], [1392], [1406], [1414], [1417], [1426], [1620], [1622], [1624], [1626], [1627], [1639], [1640], [1641], [1642], [1643], [1644], [1645], [1657], [1667], [1668], [1669], [1670], [1671], [1672], [1675], [1676], [1677], [1678], [1679], [1681], [1682], [1683], [1684], [1695], [1696], [1699], [1700], [1705], [1706], [1713], [1729], [1730], [1737], [1738], [1739], [1740], [1741], [1749], [1750], [1751], [1753], [1754], [1755], [1756], [1757], [1758], [1759], [1760], [1761], [1763], [1764], [1765], [1766], [1775], [1776], [1777], [1778], [1779], [1780], [1781], [1782], [1783], [1784], [1785], [1786], [1787], [1799], [1800], [1811], [1813], [1814], [1831], [1833], [1834], [1835], [1836], [1837], [1838], [1839], [1840], [1845], [1847], [1848], [1849], [1871], [1872], [1873], [1874], [1875], [1876], [1877], [1878], [1879] [2019-09-10 02:38:51,468 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:38:51,468 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:38:51,621 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 02:38:51,623 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 253 root evaluator evaluations with a maximum evaluation depth of 0. Performed 253 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 368 variables. [2019-09-10 02:38:51,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:38:51,628 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 02:38:51,726 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-10 02:38:51,726 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 02:38:51,732 INFO L420 sIntCurrentIteration]: We unified 253 AI predicates to 253 [2019-09-10 02:38:51,733 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 02:38:51,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 02:38:51,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2019-09-10 02:38:51,734 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:38:51,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:38:51,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:38:51,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:38:51,735 INFO L87 Difference]: Start difference. First operand 255901 states and 408825 transitions. Second operand 2 states. [2019-09-10 02:38:51,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:38:51,736 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-10 02:38:51,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:38:51,736 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 254 [2019-09-10 02:38:51,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:38:51,737 INFO L225 Difference]: With dead ends: 2 [2019-09-10 02:38:51,737 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 02:38:51,737 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 253 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-10 02:38:51,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 02:38:51,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 02:38:51,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 02:38:51,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 02:38:51,738 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 254 [2019-09-10 02:38:51,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:38:51,738 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 02:38:51,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:38:51,738 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 02:38:51,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 02:38:51,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 02:38:51 BoogieIcfgContainer [2019-09-10 02:38:51,744 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 02:38:51,746 INFO L168 Benchmark]: Toolchain (without parser) took 105353.55 ms. Allocated memory was 134.7 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 86.9 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-09-10 02:38:51,747 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 134.7 MB. Free memory is still 107.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-10 02:38:51,748 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1083.87 ms. Allocated memory was 134.7 MB in the beginning and 202.4 MB in the end (delta: 67.6 MB). Free memory was 86.5 MB in the beginning and 133.2 MB in the end (delta: -46.7 MB). Peak memory consumption was 34.0 MB. Max. memory is 7.1 GB. [2019-09-10 02:38:51,749 INFO L168 Benchmark]: Boogie Preprocessor took 206.56 ms. Allocated memory is still 202.4 MB. Free memory was 133.2 MB in the beginning and 123.8 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2019-09-10 02:38:51,749 INFO L168 Benchmark]: RCFGBuilder took 2293.47 ms. Allocated memory was 202.4 MB in the beginning and 259.5 MB in the end (delta: 57.1 MB). Free memory was 123.8 MB in the beginning and 163.5 MB in the end (delta: -39.7 MB). Peak memory consumption was 82.5 MB. Max. memory is 7.1 GB. [2019-09-10 02:38:51,750 INFO L168 Benchmark]: TraceAbstraction took 101765.73 ms. Allocated memory was 259.5 MB in the beginning and 3.2 GB in the end (delta: 2.9 GB). Free memory was 161.3 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-09-10 02:38:51,754 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 134.7 MB. Free memory is still 107.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1083.87 ms. Allocated memory was 134.7 MB in the beginning and 202.4 MB in the end (delta: 67.6 MB). Free memory was 86.5 MB in the beginning and 133.2 MB in the end (delta: -46.7 MB). Peak memory consumption was 34.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 206.56 ms. Allocated memory is still 202.4 MB. Free memory was 133.2 MB in the beginning and 123.8 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2293.47 ms. Allocated memory was 202.4 MB in the beginning and 259.5 MB in the end (delta: 57.1 MB). Free memory was 123.8 MB in the beginning and 163.5 MB in the end (delta: -39.7 MB). Peak memory consumption was 82.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 101765.73 ms. Allocated memory was 259.5 MB in the beginning and 3.2 GB in the end (delta: 2.9 GB). Free memory was 161.3 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1919]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 112 procedures, 767 locations, 1 error locations. SAFE Result, 101.6s OverallTime, 24 OverallIterations, 3 TraceHistogramMax, 32.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 19469 SDtfs, 9827 SDslu, 108962 SDs, 0 SdLazy, 10837 SolverSat, 1166 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 593 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1349 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=255901occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.9446640316205535 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 60.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 6398 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 5232 NumberOfCodeBlocks, 5232 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 5208 ConstructedInterpolants, 0 QuantifiedInterpolants, 1498392 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 23 PerfectInterpolantSequences, 910/912 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...