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_spec6_product35.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:44:03,202 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:44:03,204 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:44:03,216 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:44:03,216 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:44:03,218 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:44:03,219 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:44:03,226 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:44:03,228 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:44:03,229 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:44:03,230 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:44:03,231 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:44:03,232 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:44:03,233 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:44:03,234 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:44:03,235 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:44:03,236 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:44:03,237 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:44:03,238 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:44:03,240 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:44:03,241 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:44:03,242 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:44:03,243 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:44:03,244 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:44:03,246 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:44:03,246 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:44:03,247 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:44:03,247 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:44:03,248 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:44:03,249 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:44:03,249 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:44:03,250 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:44:03,250 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:44:03,251 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:44:03,252 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:44:03,252 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:44:03,253 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:44:03,253 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:44:03,253 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:44:03,254 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:44:03,255 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:44:03,256 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:44:03,271 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:44:03,272 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:44:03,272 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:44:03,272 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:44:03,273 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:44:03,273 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:44:03,273 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:44:03,274 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:44:03,274 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:44:03,274 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:44:03,275 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:44:03,275 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:44:03,275 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:44:03,275 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:44:03,275 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:44:03,276 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:44:03,276 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:44:03,276 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:44:03,276 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:44:03,276 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:44:03,277 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:44:03,277 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:44:03,277 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:44:03,277 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:44:03,277 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:44:03,278 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:44:03,278 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:44:03,278 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:44:03,278 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:44:03,278 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:44:03,306 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:44:03,320 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:44:03,326 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:44:03,327 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:44:03,327 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:44:03,328 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec6_product35.cil.c [2019-09-10 02:44:03,406 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e7bb2d89/dc9b96e1ac684945a12331ee0ded4989/FLAGf548d2319 [2019-09-10 02:44:04,070 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:44:04,071 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec6_product35.cil.c [2019-09-10 02:44:04,103 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e7bb2d89/dc9b96e1ac684945a12331ee0ded4989/FLAGf548d2319 [2019-09-10 02:44:04,223 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e7bb2d89/dc9b96e1ac684945a12331ee0ded4989 [2019-09-10 02:44:04,233 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:44:04,234 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:44:04,235 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:44:04,236 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:44:04,239 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:44:04,240 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:44:04" (1/1) ... [2019-09-10 02:44:04,244 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@230587f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:44:04, skipping insertion in model container [2019-09-10 02:44:04,244 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:44:04" (1/1) ... [2019-09-10 02:44:04,252 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:44:04,333 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:44:05,171 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:44:05,202 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:44:05,367 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:44:05,477 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:44:05,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:44:05 WrapperNode [2019-09-10 02:44:05,478 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:44:05,479 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:44:05,479 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:44:05,479 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:44:05,493 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:44:05" (1/1) ... [2019-09-10 02:44:05,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:44:05" (1/1) ... [2019-09-10 02:44:05,530 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:44:05" (1/1) ... [2019-09-10 02:44:05,530 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:44:05" (1/1) ... [2019-09-10 02:44:05,588 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:44:05" (1/1) ... [2019-09-10 02:44:05,614 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:44:05" (1/1) ... [2019-09-10 02:44:05,642 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:44:05" (1/1) ... [2019-09-10 02:44:05,670 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:44:05,674 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:44:05,674 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:44:05,675 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:44:05,677 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:44:05" (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:44:05,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:44:05,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:44:05,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-10 02:44:05,751 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-10 02:44:05,751 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-10 02:44:05,751 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-09-10 02:44:05,751 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AddressBook [2019-09-10 02:44:05,751 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-10 02:44:05,751 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-10 02:44:05,752 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-09-10 02:44:05,752 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-09-10 02:44:05,752 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-09-10 02:44:05,753 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-09-10 02:44:05,753 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-10 02:44:05,754 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-10 02:44:05,754 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-10 02:44:05,755 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-10 02:44:05,755 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-10 02:44:05,755 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-10 02:44:05,755 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-10 02:44:05,755 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-10 02:44:05,756 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-10 02:44:05,756 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-09-10 02:44:05,756 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-09-10 02:44:05,756 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-09-10 02:44:05,757 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-09-10 02:44:05,757 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-09-10 02:44:05,757 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-10 02:44:05,757 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-10 02:44:05,758 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-10 02:44:05,758 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-10 02:44:05,758 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-10 02:44:05,758 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-10 02:44:05,758 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-10 02:44:05,758 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-10 02:44:05,759 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-10 02:44:05,759 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:44:05,759 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-10 02:44:05,759 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-10 02:44:05,759 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-10 02:44:05,760 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-10 02:44:05,760 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-10 02:44:05,760 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-10 02:44:05,760 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-10 02:44:05,760 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-10 02:44:05,761 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-10 02:44:05,761 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-09-10 02:44:05,761 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-09-10 02:44:05,761 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-09-10 02:44:05,761 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptDecrypt_spec__1 [2019-09-10 02:44:05,761 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptDecrypt_spec__2 [2019-09-10 02:44:05,761 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-10 02:44:05,762 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-10 02:44:05,762 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AddressBook [2019-09-10 02:44:05,762 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Forward [2019-09-10 02:44:05,762 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-10 02:44:05,762 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-10 02:44:05,762 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-10 02:44:05,762 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-10 02:44:05,763 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-10 02:44:05,763 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-10 02:44:05,763 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-10 02:44:05,763 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-10 02:44:05,763 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-10 02:44:05,763 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-10 02:44:05,764 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-10 02:44:05,764 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-10 02:44:05,764 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-10 02:44:05,764 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-10 02:44:05,764 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-10 02:44:05,765 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-10 02:44:05,765 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-10 02:44:05,765 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-10 02:44:05,766 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-10 02:44:05,766 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-10 02:44:05,766 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-10 02:44:05,766 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-10 02:44:05,766 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-10 02:44:05,766 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-10 02:44:05,767 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-10 02:44:05,767 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-10 02:44:05,767 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-10 02:44:05,767 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-10 02:44:05,767 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-10 02:44:05,768 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-10 02:44:05,768 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-10 02:44:05,769 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-10 02:44:05,769 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-10 02:44:05,769 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-10 02:44:05,769 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-10 02:44:05,770 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-10 02:44:05,770 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-10 02:44:05,770 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-10 02:44:05,770 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-10 02:44:05,770 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-10 02:44:05,770 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-10 02:44:05,770 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-10 02:44:05,771 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-10 02:44:05,771 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-10 02:44:05,771 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-10 02:44:05,771 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-10 02:44:05,771 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-10 02:44:05,771 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-10 02:44:05,771 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-10 02:44:05,772 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-10 02:44:05,772 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-10 02:44:05,772 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-10 02:44:05,772 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-10 02:44:05,772 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-10 02:44:05,773 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-10 02:44:05,773 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-10 02:44:05,773 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-10 02:44:05,773 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-10 02:44:05,773 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-10 02:44:05,773 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-10 02:44:05,774 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-10 02:44:05,774 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-10 02:44:05,774 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-10 02:44:05,775 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-10 02:44:05,776 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-10 02:44:05,776 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-10 02:44:05,776 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-10 02:44:05,776 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:44:05,777 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:44:05,777 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-10 02:44:05,777 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-10 02:44:05,778 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-10 02:44:05,778 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-10 02:44:05,778 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-10 02:44:05,779 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-10 02:44:05,779 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-10 02:44:05,779 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-10 02:44:05,779 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-10 02:44:05,780 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-10 02:44:05,780 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-10 02:44:05,780 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-10 02:44:05,780 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-10 02:44:05,780 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-10 02:44:05,781 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-10 02:44:05,784 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-10 02:44:05,785 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-10 02:44:05,785 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-10 02:44:05,785 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-10 02:44:05,792 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-10 02:44:05,792 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-10 02:44:05,793 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-10 02:44:05,793 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-10 02:44:05,793 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-10 02:44:05,793 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-10 02:44:05,793 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-10 02:44:05,794 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-10 02:44:05,794 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-10 02:44:05,794 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-10 02:44:05,794 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-10 02:44:05,796 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-10 02:44:05,796 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-10 02:44:05,796 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-10 02:44:05,796 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-10 02:44:05,797 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-10 02:44:05,797 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-10 02:44:05,797 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-10 02:44:05,797 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-10 02:44:05,797 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-10 02:44:05,798 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-09-10 02:44:05,798 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-09-10 02:44:05,798 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-09-10 02:44:05,798 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-09-10 02:44:05,798 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-09-10 02:44:05,798 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptDecrypt_spec__1 [2019-09-10 02:44:05,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 02:44:05,799 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-10 02:44:05,799 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-09-10 02:44:05,799 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AddressBook [2019-09-10 02:44:05,799 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-09-10 02:44:05,799 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-09-10 02:44:05,799 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-09-10 02:44:05,800 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-09-10 02:44:05,800 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptDecrypt_spec__2 [2019-09-10 02:44:05,800 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-10 02:44:05,800 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-10 02:44:05,800 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-10 02:44:05,800 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-10 02:44:05,801 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-10 02:44:05,801 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-10 02:44:05,801 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-10 02:44:05,801 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-10 02:44:05,801 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-10 02:44:05,801 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-10 02:44:05,802 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-10 02:44:05,802 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-10 02:44:05,802 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-10 02:44:05,802 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-10 02:44:05,802 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-10 02:44:05,802 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-10 02:44:05,803 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-10 02:44:05,803 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-10 02:44:05,803 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-10 02:44:05,803 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-10 02:44:05,803 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-10 02:44:05,803 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:44:05,803 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-10 02:44:05,804 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-10 02:44:05,804 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-10 02:44:05,804 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-10 02:44:05,804 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-10 02:44:05,804 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-10 02:44:05,804 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-10 02:44:05,805 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-10 02:44:05,805 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-10 02:44:05,805 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-09-10 02:44:05,805 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-09-10 02:44:05,805 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-09-10 02:44:05,805 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-10 02:44:05,806 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-10 02:44:05,806 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-10 02:44:05,806 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-10 02:44:05,806 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-10 02:44:05,806 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-10 02:44:05,806 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-10 02:44:05,806 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-10 02:44:05,807 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AddressBook [2019-09-10 02:44:05,807 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Forward [2019-09-10 02:44:05,807 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-10 02:44:05,807 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-10 02:44:05,807 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-10 02:44:05,807 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-10 02:44:05,808 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-10 02:44:05,808 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-10 02:44:05,808 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-10 02:44:05,808 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-10 02:44:05,808 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-10 02:44:05,808 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-10 02:44:05,809 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-10 02:44:05,809 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-10 02:44:05,809 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-10 02:44:05,809 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-10 02:44:05,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-10 02:44:05,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-10 02:44:05,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 02:44:05,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-10 02:44:05,810 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-10 02:44:05,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 02:44:05,810 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-10 02:44:05,810 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-10 02:44:05,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 02:44:05,811 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-10 02:44:05,811 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-10 02:44:05,811 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-10 02:44:05,811 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-10 02:44:05,811 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-10 02:44:05,811 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-10 02:44:05,812 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-10 02:44:05,812 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-10 02:44:05,812 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-10 02:44:05,812 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-10 02:44:05,812 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-10 02:44:05,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:44:05,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-10 02:44:05,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:44:08,044 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:44:08,045 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-10 02:44:08,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:44:08 BoogieIcfgContainer [2019-09-10 02:44:08,047 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:44:08,048 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:44:08,048 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:44:08,052 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:44:08,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:44:04" (1/3) ... [2019-09-10 02:44:08,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30a9d59e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:44:08, skipping insertion in model container [2019-09-10 02:44:08,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:44:05" (2/3) ... [2019-09-10 02:44:08,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30a9d59e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:44:08, skipping insertion in model container [2019-09-10 02:44:08,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:44:08" (3/3) ... [2019-09-10 02:44:08,062 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec6_product35.cil.c [2019-09-10 02:44:08,072 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:44:08,083 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:44:08,100 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:44:08,133 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:44:08,133 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:44:08,134 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:44:08,134 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:44:08,134 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:44:08,134 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:44:08,135 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:44:08,135 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:44:08,175 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states. [2019-09-10 02:44:08,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-10 02:44:08,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:44:08,212 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:44:08,214 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:44:08,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:44:08,220 INFO L82 PathProgramCache]: Analyzing trace with hash -711590193, now seen corresponding path program 1 times [2019-09-10 02:44:08,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:44:08,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:08,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:44:08,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:08,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:44:08,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:44:08,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:44:08,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:44:08,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-10 02:44:08,964 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:44:08,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:44:08,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:44:08,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:44:08,988 INFO L87 Difference]: Start difference. First operand 691 states. Second operand 2 states. [2019-09-10 02:44:09,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:44:09,054 INFO L93 Difference]: Finished difference Result 671 states and 907 transitions. [2019-09-10 02:44:09,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:44:09,056 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 198 [2019-09-10 02:44:09,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:44:09,102 INFO L225 Difference]: With dead ends: 671 [2019-09-10 02:44:09,102 INFO L226 Difference]: Without dead ends: 662 [2019-09-10 02:44:09,104 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:44:09,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-09-10 02:44:09,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2019-09-10 02:44:09,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2019-09-10 02:44:09,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 896 transitions. [2019-09-10 02:44:09,287 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 896 transitions. Word has length 198 [2019-09-10 02:44:09,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:44:09,291 INFO L475 AbstractCegarLoop]: Abstraction has 662 states and 896 transitions. [2019-09-10 02:44:09,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:44:09,291 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 896 transitions. [2019-09-10 02:44:09,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-10 02:44:09,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:44:09,299 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:44:09,299 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:44:09,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:44:09,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1780281315, now seen corresponding path program 1 times [2019-09-10 02:44:09,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:44:09,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:09,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:44:09,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:09,302 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:44:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:44:09,675 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:44:09,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:44:09,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:44:09,676 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:44:09,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:44:09,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:44:09,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:44:09,679 INFO L87 Difference]: Start difference. First operand 662 states and 896 transitions. Second operand 3 states. [2019-09-10 02:44:09,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:44:09,733 INFO L93 Difference]: Finished difference Result 665 states and 899 transitions. [2019-09-10 02:44:09,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:44:09,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2019-09-10 02:44:09,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:44:09,743 INFO L225 Difference]: With dead ends: 665 [2019-09-10 02:44:09,744 INFO L226 Difference]: Without dead ends: 665 [2019-09-10 02:44:09,745 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:44:09,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2019-09-10 02:44:09,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 664. [2019-09-10 02:44:09,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2019-09-10 02:44:09,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 898 transitions. [2019-09-10 02:44:09,797 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 898 transitions. Word has length 199 [2019-09-10 02:44:09,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:44:09,798 INFO L475 AbstractCegarLoop]: Abstraction has 664 states and 898 transitions. [2019-09-10 02:44:09,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:44:09,798 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 898 transitions. [2019-09-10 02:44:09,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-10 02:44:09,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:44:09,806 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:44:09,807 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:44:09,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:44:09,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1355702484, now seen corresponding path program 1 times [2019-09-10 02:44:09,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:44:09,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:09,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:44:09,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:09,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:44:09,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:44:10,016 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:44:10,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:44:10,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:44:10,017 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:44:10,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:44:10,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:44:10,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:44:10,022 INFO L87 Difference]: Start difference. First operand 664 states and 898 transitions. Second operand 3 states. [2019-09-10 02:44:10,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:44:10,064 INFO L93 Difference]: Finished difference Result 709 states and 974 transitions. [2019-09-10 02:44:10,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:44:10,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2019-09-10 02:44:10,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:44:10,073 INFO L225 Difference]: With dead ends: 709 [2019-09-10 02:44:10,074 INFO L226 Difference]: Without dead ends: 709 [2019-09-10 02:44:10,074 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:44:10,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2019-09-10 02:44:10,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 708. [2019-09-10 02:44:10,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2019-09-10 02:44:10,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 973 transitions. [2019-09-10 02:44:10,112 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 973 transitions. Word has length 211 [2019-09-10 02:44:10,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:44:10,113 INFO L475 AbstractCegarLoop]: Abstraction has 708 states and 973 transitions. [2019-09-10 02:44:10,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:44:10,113 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 973 transitions. [2019-09-10 02:44:10,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-10 02:44:10,122 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:44:10,122 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:44:10,123 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:44:10,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:44:10,123 INFO L82 PathProgramCache]: Analyzing trace with hash -211848516, now seen corresponding path program 1 times [2019-09-10 02:44:10,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:44:10,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:10,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:44:10,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:10,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:44:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:44:10,313 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:44:10,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:44:10,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:44:10,314 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:44:10,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:44:10,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:44:10,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:44:10,316 INFO L87 Difference]: Start difference. First operand 708 states and 973 transitions. Second operand 3 states. [2019-09-10 02:44:10,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:44:10,393 INFO L93 Difference]: Finished difference Result 794 states and 1118 transitions. [2019-09-10 02:44:10,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:44:10,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2019-09-10 02:44:10,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:44:10,401 INFO L225 Difference]: With dead ends: 794 [2019-09-10 02:44:10,401 INFO L226 Difference]: Without dead ends: 794 [2019-09-10 02:44:10,402 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:44:10,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2019-09-10 02:44:10,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 793. [2019-09-10 02:44:10,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2019-09-10 02:44:10,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1117 transitions. [2019-09-10 02:44:10,432 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1117 transitions. Word has length 212 [2019-09-10 02:44:10,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:44:10,432 INFO L475 AbstractCegarLoop]: Abstraction has 793 states and 1117 transitions. [2019-09-10 02:44:10,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:44:10,432 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1117 transitions. [2019-09-10 02:44:10,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-09-10 02:44:10,437 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:44:10,438 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] [2019-09-10 02:44:10,438 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:44:10,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:44:10,439 INFO L82 PathProgramCache]: Analyzing trace with hash 945796238, now seen corresponding path program 1 times [2019-09-10 02:44:10,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:44:10,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:10,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:44:10,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:10,440 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:44:10,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:44:10,739 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:44:10,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:44:10,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 02:44:10,739 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:44:10,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 02:44:10,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 02:44:10,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:44:10,741 INFO L87 Difference]: Start difference. First operand 793 states and 1117 transitions. Second operand 11 states. [2019-09-10 02:44:18,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:44:18,510 INFO L93 Difference]: Finished difference Result 3636 states and 5118 transitions. [2019-09-10 02:44:18,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 02:44:18,511 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 215 [2019-09-10 02:44:18,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:44:18,538 INFO L225 Difference]: With dead ends: 3636 [2019-09-10 02:44:18,538 INFO L226 Difference]: Without dead ends: 3636 [2019-09-10 02:44:18,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=209, Invalid=913, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 02:44:18,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3636 states. [2019-09-10 02:44:18,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3636 to 3615. [2019-09-10 02:44:18,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3615 states. [2019-09-10 02:44:18,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3615 states to 3615 states and 4990 transitions. [2019-09-10 02:44:18,690 INFO L78 Accepts]: Start accepts. Automaton has 3615 states and 4990 transitions. Word has length 215 [2019-09-10 02:44:18,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:44:18,691 INFO L475 AbstractCegarLoop]: Abstraction has 3615 states and 4990 transitions. [2019-09-10 02:44:18,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 02:44:18,691 INFO L276 IsEmpty]: Start isEmpty. Operand 3615 states and 4990 transitions. [2019-09-10 02:44:18,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-10 02:44:18,746 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:44:18,747 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] [2019-09-10 02:44:18,747 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:44:18,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:44:18,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1962065818, now seen corresponding path program 1 times [2019-09-10 02:44:18,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:44:18,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:18,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:44:18,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:18,751 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:44:18,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:44:19,180 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:44:19,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:44:19,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-10 02:44:19,181 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:44:19,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 02:44:19,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 02:44:19,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-09-10 02:44:19,182 INFO L87 Difference]: Start difference. First operand 3615 states and 4990 transitions. Second operand 20 states. [2019-09-10 02:44:19,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:44:19,951 INFO L93 Difference]: Finished difference Result 3579 states and 5009 transitions. [2019-09-10 02:44:19,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 02:44:19,951 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 216 [2019-09-10 02:44:19,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:44:19,979 INFO L225 Difference]: With dead ends: 3579 [2019-09-10 02:44:19,979 INFO L226 Difference]: Without dead ends: 3561 [2019-09-10 02:44:19,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2019-09-10 02:44:19,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3561 states. [2019-09-10 02:44:20,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3561 to 3559. [2019-09-10 02:44:20,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3559 states. [2019-09-10 02:44:20,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3559 states to 3559 states and 4906 transitions. [2019-09-10 02:44:20,103 INFO L78 Accepts]: Start accepts. Automaton has 3559 states and 4906 transitions. Word has length 216 [2019-09-10 02:44:20,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:44:20,107 INFO L475 AbstractCegarLoop]: Abstraction has 3559 states and 4906 transitions. [2019-09-10 02:44:20,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 02:44:20,108 INFO L276 IsEmpty]: Start isEmpty. Operand 3559 states and 4906 transitions. [2019-09-10 02:44:20,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 02:44:20,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:44:20,114 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:44:20,115 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:44:20,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:44:20,115 INFO L82 PathProgramCache]: Analyzing trace with hash 652440013, now seen corresponding path program 1 times [2019-09-10 02:44:20,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:44:20,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:20,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:44:20,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:20,119 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:44:20,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:44:20,399 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:44:20,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:44:20,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:44:20,400 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:44:20,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:44:20,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:44:20,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:44:20,401 INFO L87 Difference]: Start difference. First operand 3559 states and 4906 transitions. Second operand 6 states. [2019-09-10 02:44:21,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:44:21,099 INFO L93 Difference]: Finished difference Result 7205 states and 10079 transitions. [2019-09-10 02:44:21,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:44:21,100 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 225 [2019-09-10 02:44:21,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:44:21,144 INFO L225 Difference]: With dead ends: 7205 [2019-09-10 02:44:21,145 INFO L226 Difference]: Without dead ends: 7205 [2019-09-10 02:44:21,145 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:44:21,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7205 states. [2019-09-10 02:44:21,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7205 to 7134. [2019-09-10 02:44:21,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7134 states. [2019-09-10 02:44:21,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7134 states to 7134 states and 9944 transitions. [2019-09-10 02:44:21,365 INFO L78 Accepts]: Start accepts. Automaton has 7134 states and 9944 transitions. Word has length 225 [2019-09-10 02:44:21,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:44:21,367 INFO L475 AbstractCegarLoop]: Abstraction has 7134 states and 9944 transitions. [2019-09-10 02:44:21,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:44:21,367 INFO L276 IsEmpty]: Start isEmpty. Operand 7134 states and 9944 transitions. [2019-09-10 02:44:21,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-09-10 02:44:21,376 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:44:21,377 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] [2019-09-10 02:44:21,377 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:44:21,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:44:21,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1875015399, now seen corresponding path program 1 times [2019-09-10 02:44:21,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:44:21,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:21,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:44:21,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:21,379 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:44:21,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:44:21,599 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:44:21,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:44:21,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:44:21,600 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:44:21,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:44:21,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:44:21,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:44:21,602 INFO L87 Difference]: Start difference. First operand 7134 states and 9944 transitions. Second operand 5 states. [2019-09-10 02:44:23,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:44:23,225 INFO L93 Difference]: Finished difference Result 20570 states and 29147 transitions. [2019-09-10 02:44:23,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:44:23,226 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 226 [2019-09-10 02:44:23,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:44:23,349 INFO L225 Difference]: With dead ends: 20570 [2019-09-10 02:44:23,349 INFO L226 Difference]: Without dead ends: 20570 [2019-09-10 02:44:23,350 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:44:23,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20570 states. [2019-09-10 02:44:24,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20570 to 20474. [2019-09-10 02:44:24,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20474 states. [2019-09-10 02:44:24,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20474 states to 20474 states and 28979 transitions. [2019-09-10 02:44:24,136 INFO L78 Accepts]: Start accepts. Automaton has 20474 states and 28979 transitions. Word has length 226 [2019-09-10 02:44:24,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:44:24,136 INFO L475 AbstractCegarLoop]: Abstraction has 20474 states and 28979 transitions. [2019-09-10 02:44:24,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:44:24,137 INFO L276 IsEmpty]: Start isEmpty. Operand 20474 states and 28979 transitions. [2019-09-10 02:44:24,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-09-10 02:44:24,150 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:44:24,150 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] [2019-09-10 02:44:24,150 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:44:24,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:44:24,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1288239280, now seen corresponding path program 1 times [2019-09-10 02:44:24,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:44:24,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:24,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:44:24,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:24,152 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:44:24,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:44:24,591 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:44:24,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:44:24,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 02:44:24,592 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:44:24,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 02:44:24,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 02:44:24,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-10 02:44:24,593 INFO L87 Difference]: Start difference. First operand 20474 states and 28979 transitions. Second operand 13 states. [2019-09-10 02:44:25,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:44:25,194 INFO L93 Difference]: Finished difference Result 20398 states and 28666 transitions. [2019-09-10 02:44:25,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 02:44:25,195 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 226 [2019-09-10 02:44:25,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:44:25,276 INFO L225 Difference]: With dead ends: 20398 [2019-09-10 02:44:25,276 INFO L226 Difference]: Without dead ends: 20398 [2019-09-10 02:44:25,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2019-09-10 02:44:25,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20398 states. [2019-09-10 02:44:26,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20398 to 20346. [2019-09-10 02:44:26,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20346 states. [2019-09-10 02:44:26,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20346 states to 20346 states and 28588 transitions. [2019-09-10 02:44:26,690 INFO L78 Accepts]: Start accepts. Automaton has 20346 states and 28588 transitions. Word has length 226 [2019-09-10 02:44:26,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:44:26,692 INFO L475 AbstractCegarLoop]: Abstraction has 20346 states and 28588 transitions. [2019-09-10 02:44:26,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 02:44:26,692 INFO L276 IsEmpty]: Start isEmpty. Operand 20346 states and 28588 transitions. [2019-09-10 02:44:26,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-10 02:44:26,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:44:26,709 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:44:26,710 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:44:26,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:44:26,710 INFO L82 PathProgramCache]: Analyzing trace with hash 644155948, now seen corresponding path program 1 times [2019-09-10 02:44:26,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:44:26,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:26,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:44:26,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:26,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:44:26,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:44:26,892 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-10 02:44:26,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:44:26,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:44:26,893 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:44:26,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:44:26,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:44:26,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:44:26,895 INFO L87 Difference]: Start difference. First operand 20346 states and 28588 transitions. Second operand 3 states. [2019-09-10 02:44:27,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:44:27,010 INFO L93 Difference]: Finished difference Result 21006 states and 29786 transitions. [2019-09-10 02:44:27,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:44:27,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 262 [2019-09-10 02:44:27,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:44:27,100 INFO L225 Difference]: With dead ends: 21006 [2019-09-10 02:44:27,101 INFO L226 Difference]: Without dead ends: 21006 [2019-09-10 02:44:27,101 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:44:27,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21006 states. [2019-09-10 02:44:27,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21006 to 21002. [2019-09-10 02:44:27,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21002 states. [2019-09-10 02:44:27,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21002 states to 21002 states and 29782 transitions. [2019-09-10 02:44:27,845 INFO L78 Accepts]: Start accepts. Automaton has 21002 states and 29782 transitions. Word has length 262 [2019-09-10 02:44:27,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:44:27,845 INFO L475 AbstractCegarLoop]: Abstraction has 21002 states and 29782 transitions. [2019-09-10 02:44:27,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:44:27,845 INFO L276 IsEmpty]: Start isEmpty. Operand 21002 states and 29782 transitions. [2019-09-10 02:44:27,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-10 02:44:27,864 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:44:27,865 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:44:27,865 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:44:27,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:44:27,865 INFO L82 PathProgramCache]: Analyzing trace with hash 462111639, now seen corresponding path program 1 times [2019-09-10 02:44:27,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:44:27,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:27,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:44:27,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:27,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:44:27,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:44:28,125 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:44:28,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:44:28,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 02:44:28,126 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:44:28,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:44:28,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:44:28,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:44:28,127 INFO L87 Difference]: Start difference. First operand 21002 states and 29782 transitions. Second operand 8 states. [2019-09-10 02:44:34,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:44:34,144 INFO L93 Difference]: Finished difference Result 42435 states and 61283 transitions. [2019-09-10 02:44:34,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 02:44:34,145 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 248 [2019-09-10 02:44:34,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:44:34,373 INFO L225 Difference]: With dead ends: 42435 [2019-09-10 02:44:34,374 INFO L226 Difference]: Without dead ends: 42435 [2019-09-10 02:44:34,375 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-10 02:44:34,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42435 states. [2019-09-10 02:44:35,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42435 to 23486. [2019-09-10 02:44:35,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23486 states. [2019-09-10 02:44:35,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23486 states to 23486 states and 34650 transitions. [2019-09-10 02:44:35,593 INFO L78 Accepts]: Start accepts. Automaton has 23486 states and 34650 transitions. Word has length 248 [2019-09-10 02:44:35,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:44:35,593 INFO L475 AbstractCegarLoop]: Abstraction has 23486 states and 34650 transitions. [2019-09-10 02:44:35,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:44:35,594 INFO L276 IsEmpty]: Start isEmpty. Operand 23486 states and 34650 transitions. [2019-09-10 02:44:35,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-10 02:44:35,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:44:35,637 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:44:35,638 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:44:35,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:44:35,638 INFO L82 PathProgramCache]: Analyzing trace with hash 921020179, now seen corresponding path program 1 times [2019-09-10 02:44:35,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:44:35,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:35,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:44:35,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:35,640 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:44:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:44:35,876 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:44:35,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:44:35,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 02:44:35,877 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:44:35,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:44:35,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:44:35,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:44:35,879 INFO L87 Difference]: Start difference. First operand 23486 states and 34650 transitions. Second operand 8 states. [2019-09-10 02:44:42,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:44:42,831 INFO L93 Difference]: Finished difference Result 47939 states and 72923 transitions. [2019-09-10 02:44:42,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 02:44:42,832 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 249 [2019-09-10 02:44:42,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:44:43,113 INFO L225 Difference]: With dead ends: 47939 [2019-09-10 02:44:43,113 INFO L226 Difference]: Without dead ends: 47939 [2019-09-10 02:44:43,114 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-10 02:44:43,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47939 states. [2019-09-10 02:44:44,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47939 to 28574. [2019-09-10 02:44:44,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28574 states. [2019-09-10 02:44:44,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28574 states to 28574 states and 45226 transitions. [2019-09-10 02:44:44,891 INFO L78 Accepts]: Start accepts. Automaton has 28574 states and 45226 transitions. Word has length 249 [2019-09-10 02:44:44,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:44:44,892 INFO L475 AbstractCegarLoop]: Abstraction has 28574 states and 45226 transitions. [2019-09-10 02:44:44,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:44:44,892 INFO L276 IsEmpty]: Start isEmpty. Operand 28574 states and 45226 transitions. [2019-09-10 02:44:45,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-10 02:44:45,025 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:44:45,026 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:44:45,026 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:44:45,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:44:45,027 INFO L82 PathProgramCache]: Analyzing trace with hash 860477467, now seen corresponding path program 1 times [2019-09-10 02:44:45,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:44:45,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:45,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:44:45,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:45,030 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:44:45,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:44:45,316 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:44:45,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:44:45,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 02:44:45,317 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:44:45,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:44:45,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:44:45,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:44:45,319 INFO L87 Difference]: Start difference. First operand 28574 states and 45226 transitions. Second operand 8 states. [2019-09-10 02:44:51,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:44:51,308 INFO L93 Difference]: Finished difference Result 59099 states and 97839 transitions. [2019-09-10 02:44:51,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 02:44:51,309 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 250 [2019-09-10 02:44:51,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:44:51,646 INFO L225 Difference]: With dead ends: 59099 [2019-09-10 02:44:51,646 INFO L226 Difference]: Without dead ends: 59099 [2019-09-10 02:44:51,647 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-10 02:44:51,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59099 states. [2019-09-10 02:44:53,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59099 to 38878. [2019-09-10 02:44:53,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38878 states. [2019-09-10 02:44:54,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38878 states to 38878 states and 67918 transitions. [2019-09-10 02:44:54,130 INFO L78 Accepts]: Start accepts. Automaton has 38878 states and 67918 transitions. Word has length 250 [2019-09-10 02:44:54,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:44:54,130 INFO L475 AbstractCegarLoop]: Abstraction has 38878 states and 67918 transitions. [2019-09-10 02:44:54,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:44:54,130 INFO L276 IsEmpty]: Start isEmpty. Operand 38878 states and 67918 transitions. [2019-09-10 02:44:54,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-09-10 02:44:54,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:44:54,228 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:44:54,229 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:44:54,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:44:54,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1417705249, now seen corresponding path program 1 times [2019-09-10 02:44:54,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:44:54,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:54,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:44:54,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:54,231 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:44:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:44:54,385 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-10 02:44:54,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:44:54,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:44:54,385 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:44:54,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:44:54,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:44:54,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:44:54,387 INFO L87 Difference]: Start difference. First operand 38878 states and 67918 transitions. Second operand 3 states. [2019-09-10 02:44:54,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:44:54,612 INFO L93 Difference]: Finished difference Result 48994 states and 91986 transitions. [2019-09-10 02:44:54,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:44:54,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 270 [2019-09-10 02:44:54,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:44:54,768 INFO L225 Difference]: With dead ends: 48994 [2019-09-10 02:44:54,768 INFO L226 Difference]: Without dead ends: 48994 [2019-09-10 02:44:54,768 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:44:54,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48994 states. [2019-09-10 02:44:56,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48994 to 48990. [2019-09-10 02:44:56,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48990 states. [2019-09-10 02:44:56,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48990 states to 48990 states and 91982 transitions. [2019-09-10 02:44:56,445 INFO L78 Accepts]: Start accepts. Automaton has 48990 states and 91982 transitions. Word has length 270 [2019-09-10 02:44:56,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:44:56,446 INFO L475 AbstractCegarLoop]: Abstraction has 48990 states and 91982 transitions. [2019-09-10 02:44:56,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:44:56,446 INFO L276 IsEmpty]: Start isEmpty. Operand 48990 states and 91982 transitions. [2019-09-10 02:44:56,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-09-10 02:44:56,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:44:56,572 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:44:56,572 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:44:56,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:44:56,573 INFO L82 PathProgramCache]: Analyzing trace with hash 868033010, now seen corresponding path program 1 times [2019-09-10 02:44:56,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:44:56,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:56,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:44:56,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:56,575 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:44:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:44:56,827 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-10 02:44:56,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:44:56,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 02:44:56,829 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:44:56,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 02:44:56,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 02:44:56,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:44:56,831 INFO L87 Difference]: Start difference. First operand 48990 states and 91982 transitions. Second operand 11 states. [2019-09-10 02:44:58,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:44:58,390 INFO L93 Difference]: Finished difference Result 67736 states and 120180 transitions. [2019-09-10 02:44:58,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 02:44:58,390 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 271 [2019-09-10 02:44:58,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:00,566 INFO L225 Difference]: With dead ends: 67736 [2019-09-10 02:45:00,566 INFO L226 Difference]: Without dead ends: 67700 [2019-09-10 02:45:00,566 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2019-09-10 02:45:00,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67700 states. [2019-09-10 02:45:01,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67700 to 67072. [2019-09-10 02:45:01,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67072 states. [2019-09-10 02:45:02,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67072 states to 67072 states and 118859 transitions. [2019-09-10 02:45:02,177 INFO L78 Accepts]: Start accepts. Automaton has 67072 states and 118859 transitions. Word has length 271 [2019-09-10 02:45:02,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:02,178 INFO L475 AbstractCegarLoop]: Abstraction has 67072 states and 118859 transitions. [2019-09-10 02:45:02,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 02:45:02,179 INFO L276 IsEmpty]: Start isEmpty. Operand 67072 states and 118859 transitions. [2019-09-10 02:45:02,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-10 02:45:02,678 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:02,678 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:02,678 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:02,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:02,679 INFO L82 PathProgramCache]: Analyzing trace with hash 2142397753, now seen corresponding path program 1 times [2019-09-10 02:45:02,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:02,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:02,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:02,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:02,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:02,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:02,890 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:45:02,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:02,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:45:02,893 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:02,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:45:02,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:45:02,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:45:02,894 INFO L87 Difference]: Start difference. First operand 67072 states and 118859 transitions. Second operand 6 states. [2019-09-10 02:45:03,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:03,798 INFO L93 Difference]: Finished difference Result 67204 states and 118437 transitions. [2019-09-10 02:45:03,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:45:03,798 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 255 [2019-09-10 02:45:03,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:04,023 INFO L225 Difference]: With dead ends: 67204 [2019-09-10 02:45:04,023 INFO L226 Difference]: Without dead ends: 67204 [2019-09-10 02:45:04,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:45:04,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67204 states. [2019-09-10 02:45:07,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67204 to 67204. [2019-09-10 02:45:07,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67204 states. [2019-09-10 02:45:07,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67204 states to 67204 states and 118437 transitions. [2019-09-10 02:45:07,357 INFO L78 Accepts]: Start accepts. Automaton has 67204 states and 118437 transitions. Word has length 255 [2019-09-10 02:45:07,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:07,357 INFO L475 AbstractCegarLoop]: Abstraction has 67204 states and 118437 transitions. [2019-09-10 02:45:07,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:45:07,358 INFO L276 IsEmpty]: Start isEmpty. Operand 67204 states and 118437 transitions. [2019-09-10 02:45:07,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-09-10 02:45:07,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:07,488 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:07,489 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:07,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:07,489 INFO L82 PathProgramCache]: Analyzing trace with hash -66496748, now seen corresponding path program 1 times [2019-09-10 02:45:07,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:07,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:07,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:07,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:07,490 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:07,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:07,937 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-09-10 02:45:07,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:07,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 02:45:07,938 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:07,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 02:45:07,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 02:45:07,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=414, Unknown=0, NotChecked=0, Total=462 [2019-09-10 02:45:07,940 INFO L87 Difference]: Start difference. First operand 67204 states and 118437 transitions. Second operand 22 states. [2019-09-10 02:45:31,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:31,957 INFO L93 Difference]: Finished difference Result 180403 states and 328806 transitions. [2019-09-10 02:45:31,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-10 02:45:31,957 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 271 [2019-09-10 02:45:31,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:32,872 INFO L225 Difference]: With dead ends: 180403 [2019-09-10 02:45:32,872 INFO L226 Difference]: Without dead ends: 180403 [2019-09-10 02:45:32,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1156 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=483, Invalid=4209, Unknown=0, NotChecked=0, Total=4692 [2019-09-10 02:45:32,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180403 states. [2019-09-10 02:45:40,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180403 to 176274. [2019-09-10 02:45:40,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176274 states. [2019-09-10 02:45:41,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176274 states to 176274 states and 316362 transitions. [2019-09-10 02:45:41,187 INFO L78 Accepts]: Start accepts. Automaton has 176274 states and 316362 transitions. Word has length 271 [2019-09-10 02:45:41,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:41,188 INFO L475 AbstractCegarLoop]: Abstraction has 176274 states and 316362 transitions. [2019-09-10 02:45:41,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 02:45:41,188 INFO L276 IsEmpty]: Start isEmpty. Operand 176274 states and 316362 transitions. [2019-09-10 02:45:41,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-09-10 02:45:41,481 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:41,482 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:41,482 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:41,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:41,483 INFO L82 PathProgramCache]: Analyzing trace with hash -474109942, now seen corresponding path program 1 times [2019-09-10 02:45:41,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:41,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:41,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:41,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:41,484 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:41,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:41,697 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-10 02:45:41,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:41,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:45:41,697 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:41,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:45:41,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:45:41,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:45:41,699 INFO L87 Difference]: Start difference. First operand 176274 states and 316362 transitions. Second operand 6 states. [2019-09-10 02:45:47,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:47,478 INFO L93 Difference]: Finished difference Result 176018 states and 296840 transitions. [2019-09-10 02:45:47,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:45:47,479 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 273 [2019-09-10 02:45:47,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:48,245 INFO L225 Difference]: With dead ends: 176018 [2019-09-10 02:45:48,246 INFO L226 Difference]: Without dead ends: 176018 [2019-09-10 02:45:48,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:45:48,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176018 states. [2019-09-10 02:45:51,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176018 to 176018. [2019-09-10 02:45:51,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176018 states. [2019-09-10 02:45:52,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176018 states to 176018 states and 296840 transitions. [2019-09-10 02:45:52,255 INFO L78 Accepts]: Start accepts. Automaton has 176018 states and 296840 transitions. Word has length 273 [2019-09-10 02:45:52,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:52,255 INFO L475 AbstractCegarLoop]: Abstraction has 176018 states and 296840 transitions. [2019-09-10 02:45:52,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:45:52,256 INFO L276 IsEmpty]: Start isEmpty. Operand 176018 states and 296840 transitions. [2019-09-10 02:45:52,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-09-10 02:45:52,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:52,443 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:52,443 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:52,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:52,443 INFO L82 PathProgramCache]: Analyzing trace with hash 949421770, now seen corresponding path program 1 times [2019-09-10 02:45:52,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:52,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:52,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:52,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:52,445 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:52,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:52,818 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-10 02:45:52,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:52,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 02:45:52,819 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:52,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 02:45:52,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 02:45:52,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-09-10 02:45:52,822 INFO L87 Difference]: Start difference. First operand 176018 states and 296840 transitions. Second operand 18 states. [2019-09-10 02:46:17,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:46:17,964 INFO L93 Difference]: Finished difference Result 187706 states and 325374 transitions. [2019-09-10 02:46:17,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-10 02:46:17,965 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 274 [2019-09-10 02:46:17,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:46:19,172 INFO L225 Difference]: With dead ends: 187706 [2019-09-10 02:46:19,172 INFO L226 Difference]: Without dead ends: 187706 [2019-09-10 02:46:19,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 975 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=423, Invalid=3483, Unknown=0, NotChecked=0, Total=3906 [2019-09-10 02:46:19,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187706 states. [2019-09-10 02:46:23,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187706 to 184439. [2019-09-10 02:46:23,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184439 states. [2019-09-10 02:46:25,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184439 states to 184439 states and 316609 transitions. [2019-09-10 02:46:25,051 INFO L78 Accepts]: Start accepts. Automaton has 184439 states and 316609 transitions. Word has length 274 [2019-09-10 02:46:25,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:46:25,052 INFO L475 AbstractCegarLoop]: Abstraction has 184439 states and 316609 transitions. [2019-09-10 02:46:25,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 02:46:25,052 INFO L276 IsEmpty]: Start isEmpty. Operand 184439 states and 316609 transitions. [2019-09-10 02:46:25,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-09-10 02:46:25,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:46:25,249 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:46:25,249 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:46:25,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:46:25,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1010871985, now seen corresponding path program 1 times [2019-09-10 02:46:25,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:46:25,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:25,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:46:25,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:25,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:46:25,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:46:25,638 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-10 02:46:25,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:46:25,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 02:46:25,639 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:46:25,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 02:46:25,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 02:46:25,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-09-10 02:46:25,641 INFO L87 Difference]: Start difference. First operand 184439 states and 316609 transitions. Second operand 18 states. [2019-09-10 02:46:27,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:46:27,045 INFO L93 Difference]: Finished difference Result 183761 states and 311939 transitions. [2019-09-10 02:46:27,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 02:46:27,046 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 274 [2019-09-10 02:46:27,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:46:27,764 INFO L225 Difference]: With dead ends: 183761 [2019-09-10 02:46:27,765 INFO L226 Difference]: Without dead ends: 183761 [2019-09-10 02:46:27,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2019-09-10 02:46:27,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183761 states. [2019-09-10 02:46:36,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183761 to 183527. [2019-09-10 02:46:36,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183527 states. [2019-09-10 02:46:38,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183527 states to 183527 states and 311547 transitions. [2019-09-10 02:46:38,187 INFO L78 Accepts]: Start accepts. Automaton has 183527 states and 311547 transitions. Word has length 274 [2019-09-10 02:46:38,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:46:38,188 INFO L475 AbstractCegarLoop]: Abstraction has 183527 states and 311547 transitions. [2019-09-10 02:46:38,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 02:46:38,188 INFO L276 IsEmpty]: Start isEmpty. Operand 183527 states and 311547 transitions. [2019-09-10 02:46:38,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-09-10 02:46:38,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:46:38,373 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:46:38,373 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:46:38,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:46:38,373 INFO L82 PathProgramCache]: Analyzing trace with hash 543981817, now seen corresponding path program 1 times [2019-09-10 02:46:38,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:46:38,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:38,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:46:38,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:38,375 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:46:38,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:46:38,541 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-10 02:46:38,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:46:38,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:46:38,542 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:46:38,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:46:38,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:46:38,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:46:38,545 INFO L87 Difference]: Start difference. First operand 183527 states and 311547 transitions. Second operand 5 states. [2019-09-10 02:46:39,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:46:39,459 INFO L93 Difference]: Finished difference Result 185930 states and 316136 transitions. [2019-09-10 02:46:39,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:46:39,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 274 [2019-09-10 02:46:39,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:46:41,238 INFO L225 Difference]: With dead ends: 185930 [2019-09-10 02:46:41,238 INFO L226 Difference]: Without dead ends: 185930 [2019-09-10 02:46:41,238 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:46:41,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185930 states. [2019-09-10 02:46:49,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185930 to 184418. [2019-09-10 02:46:49,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184418 states. [2019-09-10 02:46:50,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184418 states to 184418 states and 311801 transitions. [2019-09-10 02:46:50,884 INFO L78 Accepts]: Start accepts. Automaton has 184418 states and 311801 transitions. Word has length 274 [2019-09-10 02:46:50,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:46:50,884 INFO L475 AbstractCegarLoop]: Abstraction has 184418 states and 311801 transitions. [2019-09-10 02:46:50,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:46:50,884 INFO L276 IsEmpty]: Start isEmpty. Operand 184418 states and 311801 transitions. [2019-09-10 02:46:51,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-09-10 02:46:51,074 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:46:51,074 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:51,074 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:46:51,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:46:51,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1547134065, now seen corresponding path program 1 times [2019-09-10 02:46:51,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:46:51,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:51,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:46:51,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:51,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:46:51,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:46:51,247 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-10 02:46:51,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:46:51,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:46:51,247 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:46:51,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:46:51,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:46:51,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:46:51,249 INFO L87 Difference]: Start difference. First operand 184418 states and 311801 transitions. Second operand 5 states. [2019-09-10 02:46:56,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:46:56,058 INFO L93 Difference]: Finished difference Result 155031 states and 262596 transitions. [2019-09-10 02:46:56,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:46:56,059 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 274 [2019-09-10 02:46:56,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:46:56,626 INFO L225 Difference]: With dead ends: 155031 [2019-09-10 02:46:56,626 INFO L226 Difference]: Without dead ends: 155025 [2019-09-10 02:46:56,627 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:46:56,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155025 states. [2019-09-10 02:46:59,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155025 to 154877. [2019-09-10 02:46:59,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154877 states. [2019-09-10 02:47:00,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154877 states to 154877 states and 262229 transitions. [2019-09-10 02:47:00,477 INFO L78 Accepts]: Start accepts. Automaton has 154877 states and 262229 transitions. Word has length 274 [2019-09-10 02:47:00,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:47:00,478 INFO L475 AbstractCegarLoop]: Abstraction has 154877 states and 262229 transitions. [2019-09-10 02:47:00,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:47:00,478 INFO L276 IsEmpty]: Start isEmpty. Operand 154877 states and 262229 transitions. [2019-09-10 02:47:01,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-10 02:47:01,365 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:47:01,366 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:01,366 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:47:01,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:47:01,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1139645459, now seen corresponding path program 1 times [2019-09-10 02:47:01,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:47:01,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:47:01,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:47:01,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:47:01,367 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:47:01,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:47:01,658 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:47:01,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:47:01,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 02:47:01,658 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:47:01,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 02:47:01,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 02:47:01,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-09-10 02:47:01,659 INFO L87 Difference]: Start difference. First operand 154877 states and 262229 transitions. Second operand 18 states. [2019-09-10 02:47:21,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:47:21,944 INFO L93 Difference]: Finished difference Result 157150 states and 267892 transitions. [2019-09-10 02:47:21,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-10 02:47:21,945 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 258 [2019-09-10 02:47:21,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:47:22,531 INFO L225 Difference]: With dead ends: 157150 [2019-09-10 02:47:22,531 INFO L226 Difference]: Without dead ends: 157150 [2019-09-10 02:47:22,532 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=312, Invalid=2138, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 02:47:22,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157150 states. [2019-09-10 02:47:25,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157150 to 154877. [2019-09-10 02:47:25,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154877 states. [2019-09-10 02:47:27,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154877 states to 154877 states and 262229 transitions. [2019-09-10 02:47:27,287 INFO L78 Accepts]: Start accepts. Automaton has 154877 states and 262229 transitions. Word has length 258 [2019-09-10 02:47:27,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:47:27,287 INFO L475 AbstractCegarLoop]: Abstraction has 154877 states and 262229 transitions. [2019-09-10 02:47:27,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 02:47:27,287 INFO L276 IsEmpty]: Start isEmpty. Operand 154877 states and 262229 transitions. [2019-09-10 02:47:27,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-10 02:47:27,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:47:27,471 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:27,471 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:47:27,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:47:27,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1548469684, now seen corresponding path program 1 times [2019-09-10 02:47:27,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:47:27,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:47:27,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:47:27,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:47:27,473 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:47:27,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:47:27,634 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:47:27,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:47:27,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:47:27,635 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:47:27,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:47:27,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:47:27,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:47:27,639 INFO L87 Difference]: Start difference. First operand 154877 states and 262229 transitions. Second operand 6 states. [2019-09-10 02:47:29,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:47:29,017 INFO L93 Difference]: Finished difference Result 155057 states and 262010 transitions. [2019-09-10 02:47:29,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:47:29,017 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 258 [2019-09-10 02:47:29,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:47:29,586 INFO L225 Difference]: With dead ends: 155057 [2019-09-10 02:47:29,587 INFO L226 Difference]: Without dead ends: 155057 [2019-09-10 02:47:29,587 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:47:29,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155057 states. [2019-09-10 02:47:39,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155057 to 155057. [2019-09-10 02:47:39,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155057 states. [2019-09-10 02:47:40,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155057 states to 155057 states and 262010 transitions. [2019-09-10 02:47:40,031 INFO L78 Accepts]: Start accepts. Automaton has 155057 states and 262010 transitions. Word has length 258 [2019-09-10 02:47:40,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:47:40,032 INFO L475 AbstractCegarLoop]: Abstraction has 155057 states and 262010 transitions. [2019-09-10 02:47:40,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:47:40,032 INFO L276 IsEmpty]: Start isEmpty. Operand 155057 states and 262010 transitions. [2019-09-10 02:47:40,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-10 02:47:40,230 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:47:40,230 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:40,230 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:47:40,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:47:40,231 INFO L82 PathProgramCache]: Analyzing trace with hash 455664760, now seen corresponding path program 1 times [2019-09-10 02:47:40,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:47:40,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:47:40,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:47:40,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:47:40,231 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:47:40,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:47:40,384 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:47:40,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:47:40,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:47:40,385 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:47:40,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:47:40,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:47:40,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:47:40,386 INFO L87 Difference]: Start difference. First operand 155057 states and 262010 transitions. Second operand 6 states. [2019-09-10 02:47:42,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:47:42,249 INFO L93 Difference]: Finished difference Result 155057 states and 256916 transitions. [2019-09-10 02:47:42,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:47:42,249 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 261 [2019-09-10 02:47:42,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:47:42,898 INFO L225 Difference]: With dead ends: 155057 [2019-09-10 02:47:42,899 INFO L226 Difference]: Without dead ends: 155057 [2019-09-10 02:47:42,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:47:43,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155057 states. [2019-09-10 02:47:49,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155057 to 155057. [2019-09-10 02:47:49,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155057 states. [2019-09-10 02:47:50,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155057 states to 155057 states and 256916 transitions. [2019-09-10 02:47:50,587 INFO L78 Accepts]: Start accepts. Automaton has 155057 states and 256916 transitions. Word has length 261 [2019-09-10 02:47:50,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:47:50,588 INFO L475 AbstractCegarLoop]: Abstraction has 155057 states and 256916 transitions. [2019-09-10 02:47:50,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:47:50,588 INFO L276 IsEmpty]: Start isEmpty. Operand 155057 states and 256916 transitions. [2019-09-10 02:47:50,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-09-10 02:47:50,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:47:50,767 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:50,767 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:47:50,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:47:50,767 INFO L82 PathProgramCache]: Analyzing trace with hash 571110950, now seen corresponding path program 1 times [2019-09-10 02:47:50,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:47:50,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:47:50,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:47:50,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:47:50,768 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:47:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:47:50,926 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-10 02:47:50,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:47:50,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:47:50,926 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:47:50,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:47:50,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:47:50,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:47:50,927 INFO L87 Difference]: Start difference. First operand 155057 states and 256916 transitions. Second operand 6 states. [2019-09-10 02:47:52,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:47:52,267 INFO L93 Difference]: Finished difference Result 155153 states and 256964 transitions. [2019-09-10 02:47:52,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:47:52,268 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 298 [2019-09-10 02:47:52,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:47:53,603 INFO L225 Difference]: With dead ends: 155153 [2019-09-10 02:47:53,603 INFO L226 Difference]: Without dead ends: 155057 [2019-09-10 02:47:53,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:47:53,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155057 states. [2019-09-10 02:47:59,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155057 to 155057. [2019-09-10 02:47:59,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155057 states. [2019-09-10 02:48:00,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155057 states to 155057 states and 256868 transitions. [2019-09-10 02:48:00,466 INFO L78 Accepts]: Start accepts. Automaton has 155057 states and 256868 transitions. Word has length 298 [2019-09-10 02:48:00,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:48:00,466 INFO L475 AbstractCegarLoop]: Abstraction has 155057 states and 256868 transitions. [2019-09-10 02:48:00,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:48:00,466 INFO L276 IsEmpty]: Start isEmpty. Operand 155057 states and 256868 transitions. [2019-09-10 02:48:00,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-09-10 02:48:00,622 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:48:00,623 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:00,623 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:48:00,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:48:00,624 INFO L82 PathProgramCache]: Analyzing trace with hash -418951934, now seen corresponding path program 1 times [2019-09-10 02:48:00,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:48:00,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:48:00,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:48:00,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:48:00,625 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:48:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:48:00,797 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-10 02:48:00,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:48:00,797 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:48:00,798 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 283 with the following transitions: [2019-09-10 02:48:00,801 INFO L207 CegarAbsIntRunner]: [72], [75], [85], [116], [119], [129], [130], [146], [149], [158], [159], [162], [163], [164], [166], [248], [251], [257], [276], [278], [282], [285], [286], [287], [290], [296], [332], [334], [336], [339], [350], [353], [362], [383], [385], [386], [389], [399], [402], [404], [407], [409], [411], [466], [467], [470], [479], [584], [587], [597], [648], [650], [653], [655], [657], [658], [659], [661], [662], [663], [681], [684], [698], [701], [704], [718], [757], [759], [761], [764], [765], [766], [770], [773], [775], [776], [778], [781], [785], [799], [803], [806], [824], [827], [865], [899], [908], [912], [914], [916], [919], [922], [924], [926], [933], [936], [938], [1076], [1078], [1095], [1099], [1104], [1107], [1116], [1135], [1138], [1141], [1172], [1173], [1176], [1179], [1223], [1224], [1227], [1230], [1233], [1277], [1278], [1300], [1311], [1314], [1315], [1318], [1321], [1352], [1355], [1357], [1440], [1443], [1449], [1470], [1473], [1487], [1493], [1496], [1505], [1534], [1537], [1539], [1541], [1543], [1548], [1555], [1558], [1561], [1592], [1596], [1598], [1599], [1724], [1726], [1728], [1730], [1731], [1767], [1777], [1778], [1779], [1780], [1781], [1782], [1785], [1786], [1787], [1788], [1789], [1791], [1792], [1793], [1794], [1807], [1808], [1809], [1810], [1811], [1812], [1813], [1814], [1815], [1827], [1828], [1829], [1830], [1831], [1832], [1847], [1848], [1863], [1864], [1865], [1866], [1867], [1868], [1869], [1870], [1871], [1872], [1873], [1874], [1889], [1890], [1891], [1892], [1893], [1895], [1896], [1901], [1902], [1903], [1904], [1905], [1906], [1907], [1908], [1909], [1911], [1912], [1913], [1914], [1935], [1953], [1954], [1955], [1956], [1975], [1977], [1978], [1995], [1997], [1998], [1999], [2001], [2002], [2003], [2004], [2005], [2006], [2007], [2013], [2014], [2015], [2016], [2017], [2018], [2019], [2023], [2024], [2037], [2038], [2039], [2040], [2041], [2042], [2043], [2044], [2045] [2019-09-10 02:48:00,886 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:48:00,887 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:48:01,067 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 02:48:01,069 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 216 root evaluator evaluations with a maximum evaluation depth of 0. Performed 216 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 398 variables. [2019-09-10 02:48:01,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:48:01,073 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 02:48:01,206 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-10 02:48:01,206 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 02:48:01,215 INFO L420 sIntCurrentIteration]: We unified 281 AI predicates to 281 [2019-09-10 02:48:01,215 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 02:48:01,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 02:48:01,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 7 [2019-09-10 02:48:01,216 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:48:01,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:48:01,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:48:01,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:48:01,218 INFO L87 Difference]: Start difference. First operand 155057 states and 256868 transitions. Second operand 2 states. [2019-09-10 02:48:01,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:48:01,218 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-10 02:48:01,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:48:01,219 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 282 [2019-09-10 02:48:01,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:48:01,219 INFO L225 Difference]: With dead ends: 2 [2019-09-10 02:48:01,219 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 02:48:01,219 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 281 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:48:01,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 02:48:01,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 02:48:01,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 02:48:01,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 02:48:01,220 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 282 [2019-09-10 02:48:01,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:48:01,221 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 02:48:01,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:48:01,221 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 02:48:01,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 02:48:01,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 02:48:01 BoogieIcfgContainer [2019-09-10 02:48:01,227 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 02:48:01,229 INFO L168 Benchmark]: Toolchain (without parser) took 236994.19 ms. Allocated memory was 141.0 MB in the beginning and 3.4 GB in the end (delta: 3.3 GB). Free memory was 84.8 MB in the beginning and 1.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-09-10 02:48:01,230 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 141.0 MB. Free memory was 105.9 MB in the beginning and 105.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 02:48:01,231 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1242.79 ms. Allocated memory was 141.0 MB in the beginning and 203.4 MB in the end (delta: 62.4 MB). Free memory was 84.6 MB in the beginning and 128.1 MB in the end (delta: -43.5 MB). Peak memory consumption was 30.4 MB. Max. memory is 7.1 GB. [2019-09-10 02:48:01,231 INFO L168 Benchmark]: Boogie Preprocessor took 192.25 ms. Allocated memory is still 203.4 MB. Free memory was 128.1 MB in the beginning and 118.4 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2019-09-10 02:48:01,232 INFO L168 Benchmark]: RCFGBuilder took 2372.91 ms. Allocated memory was 203.4 MB in the beginning and 262.1 MB in the end (delta: 58.7 MB). Free memory was 118.4 MB in the beginning and 123.8 MB in the end (delta: -5.4 MB). Peak memory consumption was 76.5 MB. Max. memory is 7.1 GB. [2019-09-10 02:48:01,233 INFO L168 Benchmark]: TraceAbstraction took 233178.79 ms. Allocated memory was 262.1 MB in the beginning and 3.4 GB in the end (delta: 3.1 GB). Free memory was 123.8 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-09-10 02:48:01,237 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.21 ms. Allocated memory is still 141.0 MB. Free memory was 105.9 MB in the beginning and 105.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1242.79 ms. Allocated memory was 141.0 MB in the beginning and 203.4 MB in the end (delta: 62.4 MB). Free memory was 84.6 MB in the beginning and 128.1 MB in the end (delta: -43.5 MB). Peak memory consumption was 30.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 192.25 ms. Allocated memory is still 203.4 MB. Free memory was 128.1 MB in the beginning and 118.4 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2372.91 ms. Allocated memory was 203.4 MB in the beginning and 262.1 MB in the end (delta: 58.7 MB). Free memory was 118.4 MB in the beginning and 123.8 MB in the end (delta: -5.4 MB). Peak memory consumption was 76.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 233178.79 ms. Allocated memory was 262.1 MB in the beginning and 3.4 GB in the end (delta: 3.1 GB). Free memory was 123.8 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1255]: 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 122 procedures, 850 locations, 1 error locations. SAFE Result, 233.1s OverallTime, 27 OverallIterations, 4 TraceHistogramMax, 133.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 27153 SDtfs, 27169 SDslu, 104298 SDs, 0 SdLazy, 89959 SolverSat, 8772 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 79.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 818 GetRequests, 423 SyntacticMatches, 0 SemanticMatches, 395 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3113 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=184439occurred in iteration=19, 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.99288256227758 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 87.6s AutomataMinimizationTime, 27 MinimizatonAttempts, 70979 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 6730 NumberOfCodeBlocks, 6730 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 6703 ConstructedInterpolants, 0 QuantifiedInterpolants, 2202988 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 26 PerfectInterpolantSequences, 1182/1185 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...