java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/product-lines/email_spec0_product16.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:47:44,123 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:47:44,126 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:47:44,150 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:47:44,151 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:47:44,153 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:47:44,155 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:47:44,168 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:47:44,170 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:47:44,172 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:47:44,174 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:47:44,177 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:47:44,177 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:47:44,181 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:47:44,183 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:47:44,184 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:47:44,184 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:47:44,185 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:47:44,187 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:47:44,191 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:47:44,192 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:47:44,193 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:47:44,194 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:47:44,195 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:47:44,198 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:47:44,198 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:47:44,199 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:47:44,201 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:47:44,201 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:47:44,202 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:47:44,203 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:47:44,204 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:47:44,204 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:47:44,205 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:47:44,206 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:47:44,206 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:47:44,207 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:47:44,207 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:47:44,207 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:47:44,208 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:47:44,211 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:47:44,212 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-10-03 02:47:44,234 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:47:44,235 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:47:44,236 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:47:44,236 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:47:44,237 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:47:44,237 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:47:44,237 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:47:44,237 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:47:44,238 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:47:44,238 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:47:44,240 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:47:44,240 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:47:44,241 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:47:44,241 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:47:44,241 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:47:44,241 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:47:44,242 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:47:44,242 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:47:44,242 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:47:44,242 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:47:44,243 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:47:44,243 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:47:44,243 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:47:44,243 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:47:44,244 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:47:44,244 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:47:44,244 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:47:44,244 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:47:44,244 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:47:44,244 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:47:44,305 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:47:44,324 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:47:44,331 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:47:44,333 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:47:44,333 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:47:44,335 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec0_product16.cil.c [2019-10-03 02:47:44,398 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d47506ecd/25e8b16bb2c14e53b7137dec1b853b7a/FLAG98b6d340f [2019-10-03 02:47:45,019 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:47:45,022 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec0_product16.cil.c [2019-10-03 02:47:45,053 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d47506ecd/25e8b16bb2c14e53b7137dec1b853b7a/FLAG98b6d340f [2019-10-03 02:47:45,204 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d47506ecd/25e8b16bb2c14e53b7137dec1b853b7a [2019-10-03 02:47:45,213 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:47:45,214 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:47:45,216 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:47:45,216 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:47:45,219 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:47:45,220 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:47:45" (1/1) ... [2019-10-03 02:47:45,223 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ad58572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:47:45, skipping insertion in model container [2019-10-03 02:47:45,224 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:47:45" (1/1) ... [2019-10-03 02:47:45,231 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:47:45,311 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:47:46,058 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:47:46,096 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:47:46,232 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:47:46,337 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:47:46,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:47:46 WrapperNode [2019-10-03 02:47:46,338 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:47:46,338 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:47:46,338 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:47:46,339 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:47:46,352 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:47:46" (1/1) ... [2019-10-03 02:47:46,352 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:47:46" (1/1) ... [2019-10-03 02:47:46,386 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:47:46" (1/1) ... [2019-10-03 02:47:46,387 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:47:46" (1/1) ... [2019-10-03 02:47:46,447 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:47:46" (1/1) ... [2019-10-03 02:47:46,473 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:47:46" (1/1) ... [2019-10-03 02:47:46,502 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:47:46" (1/1) ... [2019-10-03 02:47:46,530 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:47:46,533 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:47:46,533 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:47:46,533 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:47:46,534 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:47:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:47:46,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:47:46,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:47:46,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-03 02:47:46,610 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-03 02:47:46,610 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-03 02:47:46,610 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-03 02:47:46,610 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-03 02:47:46,611 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-03 02:47:46,611 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-03 02:47:46,611 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-03 02:47:46,611 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-03 02:47:46,612 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-03 02:47:46,612 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-03 02:47:46,612 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-03 02:47:46,612 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-03 02:47:46,613 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-03 02:47:46,613 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:47:46,613 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-03 02:47:46,613 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-03 02:47:46,614 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-03 02:47:46,614 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-03 02:47:46,614 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-03 02:47:46,614 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-03 02:47:46,615 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-03 02:47:46,615 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-03 02:47:46,615 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-03 02:47:46,615 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-03 02:47:46,615 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-03 02:47:46,616 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-03 02:47:46,616 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-03 02:47:46,616 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-03 02:47:46,616 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-03 02:47:46,617 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-03 02:47:46,617 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-03 02:47:46,617 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-03 02:47:46,617 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-03 02:47:46,617 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-03 02:47:46,618 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-03 02:47:46,618 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-03 02:47:46,618 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-03 02:47:46,618 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-03 02:47:46,618 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-03 02:47:46,618 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-03 02:47:46,619 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-03 02:47:46,619 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-03 02:47:46,619 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-03 02:47:46,619 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-03 02:47:46,619 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-03 02:47:46,620 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-03 02:47:46,620 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-03 02:47:46,620 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-03 02:47:46,620 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-03 02:47:46,621 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-03 02:47:46,621 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-03 02:47:46,621 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-03 02:47:46,621 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-03 02:47:46,621 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-03 02:47:46,621 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-03 02:47:46,622 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-03 02:47:46,622 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-03 02:47:46,622 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-03 02:47:46,622 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-03 02:47:46,622 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-03 02:47:46,623 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-03 02:47:46,623 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-03 02:47:46,623 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-03 02:47:46,623 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-03 02:47:46,623 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-03 02:47:46,624 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-03 02:47:46,624 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-03 02:47:46,624 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-03 02:47:46,624 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-03 02:47:46,625 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-03 02:47:46,625 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-03 02:47:46,625 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-03 02:47:46,625 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-03 02:47:46,625 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-03 02:47:46,626 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-03 02:47:46,626 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-03 02:47:46,626 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-03 02:47:46,626 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-03 02:47:46,627 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-03 02:47:46,627 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-03 02:47:46,627 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-03 02:47:46,627 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-03 02:47:46,628 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-03 02:47:46,628 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-03 02:47:46,628 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-03 02:47:46,628 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-03 02:47:46,628 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-03 02:47:46,629 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-03 02:47:46,629 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__DecryptForward_spec__1 [2019-10-03 02:47:46,629 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-03 02:47:46,629 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-03 02:47:46,629 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-03 02:47:46,630 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-03 02:47:46,630 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-03 02:47:46,630 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-10-03 02:47:46,630 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-10-03 02:47:46,631 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-03 02:47:46,631 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-03 02:47:46,631 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-03 02:47:46,631 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-03 02:47:46,631 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-03 02:47:46,632 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-03 02:47:46,632 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-03 02:47:46,632 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-03 02:47:46,632 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-03 02:47:46,632 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-03 02:47:46,633 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:47:46,633 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:47:46,633 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-03 02:47:46,633 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-03 02:47:46,634 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-03 02:47:46,634 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-03 02:47:46,634 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-03 02:47:46,634 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-03 02:47:46,634 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-03 02:47:46,635 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-03 02:47:46,635 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-03 02:47:46,635 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-03 02:47:46,635 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-03 02:47:46,635 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-03 02:47:46,635 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-03 02:47:46,636 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-03 02:47:46,636 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-03 02:47:46,636 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-03 02:47:46,636 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-03 02:47:46,636 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-03 02:47:46,636 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-03 02:47:46,636 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-03 02:47:46,637 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-03 02:47:46,637 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-03 02:47:46,637 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-03 02:47:46,637 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-03 02:47:46,638 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-03 02:47:46,638 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-03 02:47:46,638 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-03 02:47:46,638 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:47:46,638 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-03 02:47:46,639 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-03 02:47:46,639 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-03 02:47:46,639 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-03 02:47:46,639 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-03 02:47:46,639 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-03 02:47:46,639 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-03 02:47:46,640 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-03 02:47:46,640 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-03 02:47:46,640 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-03 02:47:46,640 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-03 02:47:46,640 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-03 02:47:46,640 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-03 02:47:46,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:47:46,641 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-03 02:47:46,641 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-03 02:47:46,641 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-03 02:47:46,642 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-03 02:47:46,642 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-03 02:47:46,642 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-03 02:47:46,642 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-03 02:47:46,642 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-03 02:47:46,643 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-03 02:47:46,643 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-03 02:47:46,643 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-03 02:47:46,643 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-03 02:47:46,643 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-03 02:47:46,644 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-03 02:47:46,644 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-03 02:47:46,644 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:47:46,644 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:47:46,644 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-03 02:47:46,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:47:46,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:47:46,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:47:46,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:47:46,645 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-03 02:47:46,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:47:46,645 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-03 02:47:46,646 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-03 02:47:46,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:47:46,646 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-03 02:47:46,646 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-03 02:47:46,646 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-03 02:47:46,646 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-03 02:47:46,647 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-03 02:47:46,647 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-03 02:47:46,647 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-03 02:47:46,647 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-03 02:47:46,647 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-03 02:47:46,647 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-03 02:47:46,647 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-03 02:47:46,648 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-03 02:47:46,648 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-03 02:47:46,648 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-03 02:47:46,648 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-03 02:47:46,648 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-03 02:47:46,648 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-03 02:47:46,648 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-03 02:47:46,649 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-03 02:47:46,649 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-03 02:47:46,649 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-03 02:47:46,649 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-03 02:47:46,649 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-03 02:47:46,649 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-03 02:47:46,650 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-03 02:47:46,650 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-03 02:47:46,650 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-03 02:47:46,650 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-03 02:47:46,650 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-03 02:47:46,650 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-03 02:47:46,650 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-03 02:47:46,651 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-03 02:47:46,651 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-03 02:47:46,651 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-03 02:47:46,651 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-03 02:47:46,651 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-03 02:47:46,651 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-03 02:47:46,652 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-03 02:47:46,652 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__DecryptForward_spec__1 [2019-10-03 02:47:46,652 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-03 02:47:46,652 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-03 02:47:46,652 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-03 02:47:46,652 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-03 02:47:46,653 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-03 02:47:46,653 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-03 02:47:46,653 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-03 02:47:46,653 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-03 02:47:46,653 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-03 02:47:46,653 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-10-03 02:47:46,653 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-10-03 02:47:46,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:47:46,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:47:46,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:47:49,016 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:47:49,016 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-03 02:47:49,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:47:49 BoogieIcfgContainer [2019-10-03 02:47:49,019 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:47:49,020 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:47:49,020 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:47:49,024 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:47:49,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:47:45" (1/3) ... [2019-10-03 02:47:49,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a947f18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:47:49, skipping insertion in model container [2019-10-03 02:47:49,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:47:46" (2/3) ... [2019-10-03 02:47:49,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a947f18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:47:49, skipping insertion in model container [2019-10-03 02:47:49,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:47:49" (3/3) ... [2019-10-03 02:47:49,028 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec0_product16.cil.c [2019-10-03 02:47:49,040 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:47:49,051 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:47:49,069 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:47:49,099 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:47:49,099 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:47:49,100 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:47:49,100 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:47:49,100 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:47:49,100 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:47:49,100 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:47:49,100 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:47:49,146 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states. [2019-10-03 02:47:49,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-03 02:47:49,196 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:49,199 INFO L411 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] [2019-10-03 02:47:49,203 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:49,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:49,210 INFO L82 PathProgramCache]: Analyzing trace with hash -302652635, now seen corresponding path program 1 times [2019-10-03 02:47:49,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:49,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:49,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:49,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:49,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:49,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:49,870 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:47:49,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:49,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-03 02:47:49,873 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:49,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:47:49,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:47:49,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:47:49,902 INFO L87 Difference]: Start difference. First operand 473 states. Second operand 2 states. [2019-10-03 02:47:49,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:49,986 INFO L93 Difference]: Finished difference Result 459 states and 607 transitions. [2019-10-03 02:47:49,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:47:49,989 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 189 [2019-10-03 02:47:49,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:50,010 INFO L225 Difference]: With dead ends: 459 [2019-10-03 02:47:50,011 INFO L226 Difference]: Without dead ends: 450 [2019-10-03 02:47:50,013 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:47:50,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-10-03 02:47:50,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2019-10-03 02:47:50,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-10-03 02:47:50,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 596 transitions. [2019-10-03 02:47:50,135 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 596 transitions. Word has length 189 [2019-10-03 02:47:50,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:50,137 INFO L475 AbstractCegarLoop]: Abstraction has 450 states and 596 transitions. [2019-10-03 02:47:50,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:47:50,138 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 596 transitions. [2019-10-03 02:47:50,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-03 02:47:50,143 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:50,144 INFO L411 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] [2019-10-03 02:47:50,144 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:50,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:50,145 INFO L82 PathProgramCache]: Analyzing trace with hash -182666753, now seen corresponding path program 1 times [2019-10-03 02:47:50,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:50,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:50,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:50,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:50,150 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:50,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:50,406 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:47:50,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:50,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:47:50,407 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:50,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:47:50,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:47:50,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:47:50,413 INFO L87 Difference]: Start difference. First operand 450 states and 596 transitions. Second operand 3 states. [2019-10-03 02:47:50,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:50,472 INFO L93 Difference]: Finished difference Result 453 states and 599 transitions. [2019-10-03 02:47:50,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:47:50,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2019-10-03 02:47:50,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:50,480 INFO L225 Difference]: With dead ends: 453 [2019-10-03 02:47:50,480 INFO L226 Difference]: Without dead ends: 453 [2019-10-03 02:47:50,481 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:47:50,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-10-03 02:47:50,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 452. [2019-10-03 02:47:50,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-10-03 02:47:50,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 598 transitions. [2019-10-03 02:47:50,531 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 598 transitions. Word has length 190 [2019-10-03 02:47:50,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:50,533 INFO L475 AbstractCegarLoop]: Abstraction has 452 states and 598 transitions. [2019-10-03 02:47:50,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:47:50,533 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 598 transitions. [2019-10-03 02:47:50,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-03 02:47:50,538 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:50,539 INFO L411 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] [2019-10-03 02:47:50,539 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:50,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:50,539 INFO L82 PathProgramCache]: Analyzing trace with hash -2135910709, now seen corresponding path program 1 times [2019-10-03 02:47:50,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:50,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:50,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:50,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:50,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:50,776 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:47:50,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:50,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:47:50,777 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:50,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:47:50,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:47:50,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:47:50,778 INFO L87 Difference]: Start difference. First operand 452 states and 598 transitions. Second operand 3 states. [2019-10-03 02:47:50,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:50,820 INFO L93 Difference]: Finished difference Result 493 states and 668 transitions. [2019-10-03 02:47:50,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:47:50,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-10-03 02:47:50,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:50,828 INFO L225 Difference]: With dead ends: 493 [2019-10-03 02:47:50,829 INFO L226 Difference]: Without dead ends: 493 [2019-10-03 02:47:50,829 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:47:50,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-10-03 02:47:50,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 492. [2019-10-03 02:47:50,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2019-10-03 02:47:50,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 667 transitions. [2019-10-03 02:47:50,867 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 667 transitions. Word has length 196 [2019-10-03 02:47:50,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:50,870 INFO L475 AbstractCegarLoop]: Abstraction has 492 states and 667 transitions. [2019-10-03 02:47:50,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:47:50,870 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 667 transitions. [2019-10-03 02:47:50,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-10-03 02:47:50,880 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:50,880 INFO L411 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] [2019-10-03 02:47:50,881 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:50,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:50,882 INFO L82 PathProgramCache]: Analyzing trace with hash -318353265, now seen corresponding path program 1 times [2019-10-03 02:47:50,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:50,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:50,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:50,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:50,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:50,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:51,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-10-03 02:47:51,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:51,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-03 02:47:51,399 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:51,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-03 02:47:51,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-03 02:47:51,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-10-03 02:47:51,401 INFO L87 Difference]: Start difference. First operand 492 states and 667 transitions. Second operand 19 states. [2019-10-03 02:47:56,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:56,369 INFO L93 Difference]: Finished difference Result 1427 states and 1944 transitions. [2019-10-03 02:47:56,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-03 02:47:56,369 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 197 [2019-10-03 02:47:56,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:56,380 INFO L225 Difference]: With dead ends: 1427 [2019-10-03 02:47:56,380 INFO L226 Difference]: Without dead ends: 1427 [2019-10-03 02:47:56,382 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=287, Invalid=2683, Unknown=0, NotChecked=0, Total=2970 [2019-10-03 02:47:56,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2019-10-03 02:47:56,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1390. [2019-10-03 02:47:56,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1390 states. [2019-10-03 02:47:56,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 1897 transitions. [2019-10-03 02:47:56,449 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 1897 transitions. Word has length 197 [2019-10-03 02:47:56,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:56,450 INFO L475 AbstractCegarLoop]: Abstraction has 1390 states and 1897 transitions. [2019-10-03 02:47:56,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-03 02:47:56,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1897 transitions. [2019-10-03 02:47:56,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-03 02:47:56,456 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:56,457 INFO L411 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] [2019-10-03 02:47:56,457 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:56,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:56,458 INFO L82 PathProgramCache]: Analyzing trace with hash 309681099, now seen corresponding path program 1 times [2019-10-03 02:47:56,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:56,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:56,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:56,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:56,462 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:56,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:56,753 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:47:56,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:56,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:47:56,754 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:56,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:47:56,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:47:56,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:47:56,757 INFO L87 Difference]: Start difference. First operand 1390 states and 1897 transitions. Second operand 9 states. [2019-10-03 02:47:57,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:57,051 INFO L93 Difference]: Finished difference Result 1444 states and 1980 transitions. [2019-10-03 02:47:57,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:47:57,051 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 198 [2019-10-03 02:47:57,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:57,063 INFO L225 Difference]: With dead ends: 1444 [2019-10-03 02:47:57,063 INFO L226 Difference]: Without dead ends: 1436 [2019-10-03 02:47:57,064 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-10-03 02:47:57,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2019-10-03 02:47:57,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1436. [2019-10-03 02:47:57,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1436 states. [2019-10-03 02:47:57,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 1970 transitions. [2019-10-03 02:47:57,129 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 1970 transitions. Word has length 198 [2019-10-03 02:47:57,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:57,131 INFO L475 AbstractCegarLoop]: Abstraction has 1436 states and 1970 transitions. [2019-10-03 02:47:57,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:47:57,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 1970 transitions. [2019-10-03 02:47:57,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-03 02:47:57,137 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:57,137 INFO L411 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] [2019-10-03 02:47:57,138 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:57,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:57,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1834515197, now seen corresponding path program 1 times [2019-10-03 02:47:57,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:57,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:57,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:57,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:57,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:57,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:57,327 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:47:57,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:57,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:47:57,327 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:57,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:47:57,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:47:57,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:47:57,329 INFO L87 Difference]: Start difference. First operand 1436 states and 1970 transitions. Second operand 5 states. [2019-10-03 02:47:58,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:58,315 INFO L93 Difference]: Finished difference Result 3040 states and 4139 transitions. [2019-10-03 02:47:58,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:47:58,315 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 198 [2019-10-03 02:47:58,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:58,338 INFO L225 Difference]: With dead ends: 3040 [2019-10-03 02:47:58,338 INFO L226 Difference]: Without dead ends: 3040 [2019-10-03 02:47:58,339 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:47:58,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3040 states. [2019-10-03 02:47:58,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3040 to 3020. [2019-10-03 02:47:58,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3020 states. [2019-10-03 02:47:58,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3020 states to 3020 states and 4117 transitions. [2019-10-03 02:47:58,453 INFO L78 Accepts]: Start accepts. Automaton has 3020 states and 4117 transitions. Word has length 198 [2019-10-03 02:47:58,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:58,454 INFO L475 AbstractCegarLoop]: Abstraction has 3020 states and 4117 transitions. [2019-10-03 02:47:58,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:47:58,454 INFO L276 IsEmpty]: Start isEmpty. Operand 3020 states and 4117 transitions. [2019-10-03 02:47:58,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-03 02:47:58,462 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:58,462 INFO L411 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] [2019-10-03 02:47:58,463 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:58,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:58,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1351636900, now seen corresponding path program 1 times [2019-10-03 02:47:58,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:58,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:58,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:58,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:58,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:58,647 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:47:58,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:58,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:47:58,648 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:58,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:47:58,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:47:58,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:47:58,649 INFO L87 Difference]: Start difference. First operand 3020 states and 4117 transitions. Second operand 6 states. [2019-10-03 02:47:59,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:59,116 INFO L93 Difference]: Finished difference Result 6075 states and 8280 transitions. [2019-10-03 02:47:59,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:47:59,116 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 198 [2019-10-03 02:47:59,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:59,153 INFO L225 Difference]: With dead ends: 6075 [2019-10-03 02:47:59,153 INFO L226 Difference]: Without dead ends: 6075 [2019-10-03 02:47:59,153 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:47:59,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6075 states. [2019-10-03 02:47:59,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6075 to 6032. [2019-10-03 02:47:59,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6032 states. [2019-10-03 02:47:59,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6032 states to 6032 states and 8228 transitions. [2019-10-03 02:47:59,436 INFO L78 Accepts]: Start accepts. Automaton has 6032 states and 8228 transitions. Word has length 198 [2019-10-03 02:47:59,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:59,438 INFO L475 AbstractCegarLoop]: Abstraction has 6032 states and 8228 transitions. [2019-10-03 02:47:59,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:47:59,438 INFO L276 IsEmpty]: Start isEmpty. Operand 6032 states and 8228 transitions. [2019-10-03 02:47:59,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-03 02:47:59,462 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:59,462 INFO L411 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] [2019-10-03 02:47:59,462 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:59,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:59,463 INFO L82 PathProgramCache]: Analyzing trace with hash 156692310, now seen corresponding path program 1 times [2019-10-03 02:47:59,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:59,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:59,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:59,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:59,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:59,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:59,806 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:47:59,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:59,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:47:59,807 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:59,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:47:59,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:47:59,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:47:59,810 INFO L87 Difference]: Start difference. First operand 6032 states and 8228 transitions. Second operand 9 states. [2019-10-03 02:47:59,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:59,993 INFO L93 Difference]: Finished difference Result 6562 states and 9003 transitions. [2019-10-03 02:47:59,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:47:59,993 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 199 [2019-10-03 02:47:59,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:48:00,040 INFO L225 Difference]: With dead ends: 6562 [2019-10-03 02:48:00,041 INFO L226 Difference]: Without dead ends: 6562 [2019-10-03 02:48:00,041 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:48:00,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6562 states. [2019-10-03 02:48:00,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6562 to 6532. [2019-10-03 02:48:00,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6532 states. [2019-10-03 02:48:00,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6532 states to 6532 states and 8968 transitions. [2019-10-03 02:48:00,311 INFO L78 Accepts]: Start accepts. Automaton has 6532 states and 8968 transitions. Word has length 199 [2019-10-03 02:48:00,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:48:00,311 INFO L475 AbstractCegarLoop]: Abstraction has 6532 states and 8968 transitions. [2019-10-03 02:48:00,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:48:00,312 INFO L276 IsEmpty]: Start isEmpty. Operand 6532 states and 8968 transitions. [2019-10-03 02:48:00,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-03 02:48:00,329 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:48:00,329 INFO L411 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] [2019-10-03 02:48:00,330 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:48:00,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:48:00,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1972860762, now seen corresponding path program 1 times [2019-10-03 02:48:00,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:48:00,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:00,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:48:00,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:00,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:48:00,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:48:00,547 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:48:00,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:48:00,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:48:00,547 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:48:00,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:48:00,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:48:00,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:48:00,549 INFO L87 Difference]: Start difference. First operand 6532 states and 8968 transitions. Second operand 6 states. [2019-10-03 02:48:01,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:48:01,090 INFO L93 Difference]: Finished difference Result 13199 states and 18101 transitions. [2019-10-03 02:48:01,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:48:01,091 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 200 [2019-10-03 02:48:01,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:48:01,280 INFO L225 Difference]: With dead ends: 13199 [2019-10-03 02:48:01,280 INFO L226 Difference]: Without dead ends: 13199 [2019-10-03 02:48:01,281 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:48:01,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13199 states. [2019-10-03 02:48:01,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13199 to 13036. [2019-10-03 02:48:01,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13036 states. [2019-10-03 02:48:01,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13036 states to 13036 states and 17919 transitions. [2019-10-03 02:48:01,756 INFO L78 Accepts]: Start accepts. Automaton has 13036 states and 17919 transitions. Word has length 200 [2019-10-03 02:48:01,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:48:01,757 INFO L475 AbstractCegarLoop]: Abstraction has 13036 states and 17919 transitions. [2019-10-03 02:48:01,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:48:01,758 INFO L276 IsEmpty]: Start isEmpty. Operand 13036 states and 17919 transitions. [2019-10-03 02:48:01,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-03 02:48:01,785 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:48:01,786 INFO L411 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] [2019-10-03 02:48:01,786 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:48:01,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:48:01,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1385655780, now seen corresponding path program 1 times [2019-10-03 02:48:01,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:48:01,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:01,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:48:01,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:01,792 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:48:01,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:48:02,025 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:48:02,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:48:02,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:48:02,026 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:48:02,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:48:02,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:48:02,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:48:02,028 INFO L87 Difference]: Start difference. First operand 13036 states and 17919 transitions. Second operand 9 states. [2019-10-03 02:48:02,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:48:02,245 INFO L93 Difference]: Finished difference Result 14456 states and 20039 transitions. [2019-10-03 02:48:02,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:48:02,246 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 201 [2019-10-03 02:48:02,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:48:02,311 INFO L225 Difference]: With dead ends: 14456 [2019-10-03 02:48:02,312 INFO L226 Difference]: Without dead ends: 14456 [2019-10-03 02:48:02,312 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:48:02,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14456 states. [2019-10-03 02:48:02,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14456 to 14326. [2019-10-03 02:48:02,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14326 states. [2019-10-03 02:48:03,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14326 states to 14326 states and 19899 transitions. [2019-10-03 02:48:03,007 INFO L78 Accepts]: Start accepts. Automaton has 14326 states and 19899 transitions. Word has length 201 [2019-10-03 02:48:03,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:48:03,007 INFO L475 AbstractCegarLoop]: Abstraction has 14326 states and 19899 transitions. [2019-10-03 02:48:03,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:48:03,008 INFO L276 IsEmpty]: Start isEmpty. Operand 14326 states and 19899 transitions. [2019-10-03 02:48:03,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-03 02:48:03,038 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:48:03,038 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:48:03,039 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:48:03,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:48:03,039 INFO L82 PathProgramCache]: Analyzing trace with hash -221138788, now seen corresponding path program 1 times [2019-10-03 02:48:03,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:48:03,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:03,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:48:03,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:03,044 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:48:03,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:48:03,249 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:48:03,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:48:03,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:48:03,250 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:48:03,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:48:03,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:48:03,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:48:03,251 INFO L87 Difference]: Start difference. First operand 14326 states and 19899 transitions. Second operand 6 states. [2019-10-03 02:48:03,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:48:03,890 INFO L93 Difference]: Finished difference Result 28238 states and 39284 transitions. [2019-10-03 02:48:03,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:48:03,891 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 202 [2019-10-03 02:48:03,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:48:04,008 INFO L225 Difference]: With dead ends: 28238 [2019-10-03 02:48:04,009 INFO L226 Difference]: Without dead ends: 25937 [2019-10-03 02:48:04,011 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:48:04,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25937 states. [2019-10-03 02:48:05,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25937 to 25642. [2019-10-03 02:48:05,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25642 states. [2019-10-03 02:48:05,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25642 states to 25642 states and 35837 transitions. [2019-10-03 02:48:05,664 INFO L78 Accepts]: Start accepts. Automaton has 25642 states and 35837 transitions. Word has length 202 [2019-10-03 02:48:05,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:48:05,664 INFO L475 AbstractCegarLoop]: Abstraction has 25642 states and 35837 transitions. [2019-10-03 02:48:05,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:48:05,665 INFO L276 IsEmpty]: Start isEmpty. Operand 25642 states and 35837 transitions. [2019-10-03 02:48:05,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-03 02:48:05,720 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:48:05,720 INFO L411 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] [2019-10-03 02:48:05,721 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:48:05,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:48:05,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1368778680, now seen corresponding path program 1 times [2019-10-03 02:48:05,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:48:05,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:05,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:48:05,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:05,727 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:48:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:48:05,867 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:48:05,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:48:05,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:48:05,868 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:48:05,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:48:05,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:48:05,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:48:05,869 INFO L87 Difference]: Start difference. First operand 25642 states and 35837 transitions. Second operand 3 states. [2019-10-03 02:48:06,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:48:06,021 INFO L93 Difference]: Finished difference Result 27607 states and 39440 transitions. [2019-10-03 02:48:06,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:48:06,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2019-10-03 02:48:06,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:48:06,152 INFO L225 Difference]: With dead ends: 27607 [2019-10-03 02:48:06,153 INFO L226 Difference]: Without dead ends: 27607 [2019-10-03 02:48:06,153 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:48:06,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27607 states. [2019-10-03 02:48:07,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27607 to 27586. [2019-10-03 02:48:07,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27586 states. [2019-10-03 02:48:07,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27586 states to 27586 states and 39419 transitions. [2019-10-03 02:48:07,201 INFO L78 Accepts]: Start accepts. Automaton has 27586 states and 39419 transitions. Word has length 213 [2019-10-03 02:48:07,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:48:07,202 INFO L475 AbstractCegarLoop]: Abstraction has 27586 states and 39419 transitions. [2019-10-03 02:48:07,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:48:07,202 INFO L276 IsEmpty]: Start isEmpty. Operand 27586 states and 39419 transitions. [2019-10-03 02:48:07,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-10-03 02:48:07,248 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:48:07,249 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:48:07,249 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:48:07,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:48:07,249 INFO L82 PathProgramCache]: Analyzing trace with hash -719397532, now seen corresponding path program 1 times [2019-10-03 02:48:07,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:48:07,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:07,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:48:07,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:07,253 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:48:07,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:48:07,375 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:48:07,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:48:07,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:48:07,376 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:48:07,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:48:07,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:48:07,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:48:07,378 INFO L87 Difference]: Start difference. First operand 27586 states and 39419 transitions. Second operand 3 states. [2019-10-03 02:48:07,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:48:07,539 INFO L93 Difference]: Finished difference Result 31255 states and 46172 transitions. [2019-10-03 02:48:07,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:48:07,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 214 [2019-10-03 02:48:07,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:48:07,651 INFO L225 Difference]: With dead ends: 31255 [2019-10-03 02:48:07,652 INFO L226 Difference]: Without dead ends: 31255 [2019-10-03 02:48:07,652 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:48:07,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31255 states. [2019-10-03 02:48:09,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31255 to 31234. [2019-10-03 02:48:09,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31234 states. [2019-10-03 02:48:09,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31234 states to 31234 states and 46151 transitions. [2019-10-03 02:48:09,564 INFO L78 Accepts]: Start accepts. Automaton has 31234 states and 46151 transitions. Word has length 214 [2019-10-03 02:48:09,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:48:09,564 INFO L475 AbstractCegarLoop]: Abstraction has 31234 states and 46151 transitions. [2019-10-03 02:48:09,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:48:09,564 INFO L276 IsEmpty]: Start isEmpty. Operand 31234 states and 46151 transitions. [2019-10-03 02:48:09,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-03 02:48:09,623 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:48:09,623 INFO L411 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] [2019-10-03 02:48:09,623 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:48:09,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:48:09,624 INFO L82 PathProgramCache]: Analyzing trace with hash -569401298, now seen corresponding path program 1 times [2019-10-03 02:48:09,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:48:09,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:09,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:48:09,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:09,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:48:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:48:09,761 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:48:09,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:48:09,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:48:09,762 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:48:09,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:48:09,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:48:09,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:48:09,764 INFO L87 Difference]: Start difference. First operand 31234 states and 46151 transitions. Second operand 3 states. [2019-10-03 02:48:09,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:48:09,977 INFO L93 Difference]: Finished difference Result 38263 states and 58868 transitions. [2019-10-03 02:48:09,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:48:09,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2019-10-03 02:48:09,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:48:10,134 INFO L225 Difference]: With dead ends: 38263 [2019-10-03 02:48:10,134 INFO L226 Difference]: Without dead ends: 38263 [2019-10-03 02:48:10,135 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:48:10,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38263 states. [2019-10-03 02:48:11,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38263 to 38242. [2019-10-03 02:48:11,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38242 states. [2019-10-03 02:48:11,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38242 states to 38242 states and 58847 transitions. [2019-10-03 02:48:11,661 INFO L78 Accepts]: Start accepts. Automaton has 38242 states and 58847 transitions. Word has length 213 [2019-10-03 02:48:11,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:48:11,661 INFO L475 AbstractCegarLoop]: Abstraction has 38242 states and 58847 transitions. [2019-10-03 02:48:11,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:48:11,662 INFO L276 IsEmpty]: Start isEmpty. Operand 38242 states and 58847 transitions. [2019-10-03 02:48:11,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-10-03 02:48:11,765 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:48:11,766 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:48:11,766 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:48:11,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:48:11,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1465568888, now seen corresponding path program 1 times [2019-10-03 02:48:11,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:48:11,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:11,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:48:11,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:11,771 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:48:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:48:11,908 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:48:11,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:48:11,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:48:11,908 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:48:11,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:48:11,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:48:11,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:48:11,910 INFO L87 Difference]: Start difference. First operand 38242 states and 58847 transitions. Second operand 3 states. [2019-10-03 02:48:12,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:48:12,168 INFO L93 Difference]: Finished difference Result 51703 states and 82916 transitions. [2019-10-03 02:48:12,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:48:12,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 214 [2019-10-03 02:48:12,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:48:12,371 INFO L225 Difference]: With dead ends: 51703 [2019-10-03 02:48:12,371 INFO L226 Difference]: Without dead ends: 51703 [2019-10-03 02:48:12,373 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:48:12,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51703 states. [2019-10-03 02:48:13,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51703 to 51682. [2019-10-03 02:48:13,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51682 states. [2019-10-03 02:48:14,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51682 states to 51682 states and 82895 transitions. [2019-10-03 02:48:14,028 INFO L78 Accepts]: Start accepts. Automaton has 51682 states and 82895 transitions. Word has length 214 [2019-10-03 02:48:14,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:48:14,028 INFO L475 AbstractCegarLoop]: Abstraction has 51682 states and 82895 transitions. [2019-10-03 02:48:14,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:48:14,029 INFO L276 IsEmpty]: Start isEmpty. Operand 51682 states and 82895 transitions. [2019-10-03 02:48:14,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-10-03 02:48:14,120 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:48:14,121 INFO L411 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-10-03 02:48:14,121 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:48:14,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:48:14,122 INFO L82 PathProgramCache]: Analyzing trace with hash 907809038, now seen corresponding path program 1 times [2019-10-03 02:48:14,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:48:14,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:14,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:48:14,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:14,128 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:48:14,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:48:14,301 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:48:14,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:48:14,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:48:14,304 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:48:14,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:48:14,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:48:14,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:48:14,305 INFO L87 Difference]: Start difference. First operand 51682 states and 82895 transitions. Second operand 7 states. [2019-10-03 02:48:17,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:48:17,372 INFO L93 Difference]: Finished difference Result 92150 states and 142526 transitions. [2019-10-03 02:48:17,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-03 02:48:17,372 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 215 [2019-10-03 02:48:17,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:48:17,922 INFO L225 Difference]: With dead ends: 92150 [2019-10-03 02:48:17,923 INFO L226 Difference]: Without dead ends: 90035 [2019-10-03 02:48:17,923 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-03 02:48:18,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90035 states. [2019-10-03 02:48:21,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90035 to 89461. [2019-10-03 02:48:21,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89461 states. [2019-10-03 02:48:21,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89461 states to 89461 states and 136896 transitions. [2019-10-03 02:48:21,560 INFO L78 Accepts]: Start accepts. Automaton has 89461 states and 136896 transitions. Word has length 215 [2019-10-03 02:48:21,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:48:21,561 INFO L475 AbstractCegarLoop]: Abstraction has 89461 states and 136896 transitions. [2019-10-03 02:48:21,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:48:21,561 INFO L276 IsEmpty]: Start isEmpty. Operand 89461 states and 136896 transitions. [2019-10-03 02:48:21,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-10-03 02:48:21,647 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:48:21,648 INFO L411 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] [2019-10-03 02:48:21,648 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:48:21,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:48:21,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1656476220, now seen corresponding path program 1 times [2019-10-03 02:48:21,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:48:21,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:21,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:48:21,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:21,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:48:21,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:48:23,637 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:48:23,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:48:23,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:48:23,637 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:48:23,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:48:23,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:48:23,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:48:23,639 INFO L87 Difference]: Start difference. First operand 89461 states and 136896 transitions. Second operand 9 states. [2019-10-03 02:48:24,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:48:24,117 INFO L93 Difference]: Finished difference Result 89676 states and 137006 transitions. [2019-10-03 02:48:24,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:48:24,118 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 218 [2019-10-03 02:48:24,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:48:24,425 INFO L225 Difference]: With dead ends: 89676 [2019-10-03 02:48:24,426 INFO L226 Difference]: Without dead ends: 89401 [2019-10-03 02:48:24,427 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:48:24,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89401 states. [2019-10-03 02:48:26,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89401 to 89026. [2019-10-03 02:48:26,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89026 states. [2019-10-03 02:48:26,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89026 states to 89026 states and 135901 transitions. [2019-10-03 02:48:26,694 INFO L78 Accepts]: Start accepts. Automaton has 89026 states and 135901 transitions. Word has length 218 [2019-10-03 02:48:26,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:48:26,694 INFO L475 AbstractCegarLoop]: Abstraction has 89026 states and 135901 transitions. [2019-10-03 02:48:26,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:48:26,694 INFO L276 IsEmpty]: Start isEmpty. Operand 89026 states and 135901 transitions. [2019-10-03 02:48:26,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-10-03 02:48:26,787 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:48:26,788 INFO L411 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-10-03 02:48:26,788 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:48:26,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:48:26,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1958723520, now seen corresponding path program 1 times [2019-10-03 02:48:26,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:48:26,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:26,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:48:26,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:26,791 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:48:26,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:48:27,203 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:48:27,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:48:27,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-10-03 02:48:27,204 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:48:27,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-03 02:48:27,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-03 02:48:27,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-10-03 02:48:27,207 INFO L87 Difference]: Start difference. First operand 89026 states and 135901 transitions. Second operand 24 states. [2019-10-03 02:48:28,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:48:28,408 INFO L93 Difference]: Finished difference Result 106467 states and 163769 transitions. [2019-10-03 02:48:28,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-03 02:48:28,408 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 216 [2019-10-03 02:48:28,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:48:28,891 INFO L225 Difference]: With dead ends: 106467 [2019-10-03 02:48:28,891 INFO L226 Difference]: Without dead ends: 96117 [2019-10-03 02:48:28,893 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2019-10-03 02:48:28,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96117 states. [2019-10-03 02:48:31,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96117 to 91868. [2019-10-03 02:48:31,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91868 states. [2019-10-03 02:48:31,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91868 states to 91868 states and 140029 transitions. [2019-10-03 02:48:31,714 INFO L78 Accepts]: Start accepts. Automaton has 91868 states and 140029 transitions. Word has length 216 [2019-10-03 02:48:31,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:48:31,715 INFO L475 AbstractCegarLoop]: Abstraction has 91868 states and 140029 transitions. [2019-10-03 02:48:31,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-03 02:48:31,716 INFO L276 IsEmpty]: Start isEmpty. Operand 91868 states and 140029 transitions. [2019-10-03 02:48:31,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-10-03 02:48:31,910 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:48:31,910 INFO L411 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] [2019-10-03 02:48:31,910 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:48:31,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:48:31,911 INFO L82 PathProgramCache]: Analyzing trace with hash -137374558, now seen corresponding path program 1 times [2019-10-03 02:48:31,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:48:31,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:31,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:48:31,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:31,915 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:48:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:48:34,814 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:48:34,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:48:34,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:48:34,814 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:48:34,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:48:34,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:48:34,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:48:34,817 INFO L87 Difference]: Start difference. First operand 91868 states and 140029 transitions. Second operand 10 states. [2019-10-03 02:48:35,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:48:35,354 INFO L93 Difference]: Finished difference Result 92290 states and 140520 transitions. [2019-10-03 02:48:35,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:48:35,355 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 220 [2019-10-03 02:48:35,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:48:35,680 INFO L225 Difference]: With dead ends: 92290 [2019-10-03 02:48:35,681 INFO L226 Difference]: Without dead ends: 91798 [2019-10-03 02:48:35,682 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:48:35,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91798 states. [2019-10-03 02:48:38,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91798 to 91798. [2019-10-03 02:48:38,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91798 states. [2019-10-03 02:48:38,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91798 states to 91798 states and 139679 transitions. [2019-10-03 02:48:38,323 INFO L78 Accepts]: Start accepts. Automaton has 91798 states and 139679 transitions. Word has length 220 [2019-10-03 02:48:38,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:48:38,323 INFO L475 AbstractCegarLoop]: Abstraction has 91798 states and 139679 transitions. [2019-10-03 02:48:38,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:48:38,323 INFO L276 IsEmpty]: Start isEmpty. Operand 91798 states and 139679 transitions. [2019-10-03 02:48:38,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-10-03 02:48:38,418 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:48:38,418 INFO L411 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-10-03 02:48:38,418 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:48:38,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:48:38,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1689915209, now seen corresponding path program 1 times [2019-10-03 02:48:38,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:48:38,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:38,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:48:38,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:38,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:48:38,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:48:38,557 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:48:38,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:48:38,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:48:38,558 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:48:38,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:48:38,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:48:38,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:48:38,559 INFO L87 Difference]: Start difference. First operand 91798 states and 139679 transitions. Second operand 5 states. [2019-10-03 02:48:38,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:48:38,914 INFO L93 Difference]: Finished difference Result 93646 states and 142031 transitions. [2019-10-03 02:48:38,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:48:38,915 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 225 [2019-10-03 02:48:38,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:48:39,221 INFO L225 Difference]: With dead ends: 93646 [2019-10-03 02:48:39,221 INFO L226 Difference]: Without dead ends: 93646 [2019-10-03 02:48:39,224 INFO L640 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-10-03 02:48:39,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93646 states. [2019-10-03 02:48:41,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93646 to 92778. [2019-10-03 02:48:41,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92778 states. [2019-10-03 02:48:41,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92778 states to 92778 states and 140750 transitions. [2019-10-03 02:48:41,862 INFO L78 Accepts]: Start accepts. Automaton has 92778 states and 140750 transitions. Word has length 225 [2019-10-03 02:48:41,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:48:41,862 INFO L475 AbstractCegarLoop]: Abstraction has 92778 states and 140750 transitions. [2019-10-03 02:48:41,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:48:41,863 INFO L276 IsEmpty]: Start isEmpty. Operand 92778 states and 140750 transitions. [2019-10-03 02:48:41,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-10-03 02:48:41,964 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:48:41,964 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:48:41,964 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:48:41,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:48:41,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1511516434, now seen corresponding path program 1 times [2019-10-03 02:48:41,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:48:41,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:41,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:48:41,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:48:41,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:48:42,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:48:42,099 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-03 02:48:42,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:48:42,100 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:48:42,101 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 227 with the following transitions: [2019-10-03 02:48:42,104 INFO L207 CegarAbsIntRunner]: [44], [47], [50], [72], [75], [85], [123], [139], [142], [143], [146], [155], [156], [157], [159], [269], [271], [275], [278], [279], [280], [283], [284], [288], [289], [313], [315], [316], [319], [328], [339], [341], [344], [348], [349], [351], [352], [355], [365], [366], [367], [394], [397], [406], [503], [584], [586], [587], [588], [595], [606], [608], [613], [637], [640], [654], [683], [684], [695], [697], [723], [727], [730], [748], [751], [762], [765], [775], [776], [778], [803], [809], [818], [822], [824], [826], [829], [836], [843], [848], [855], [862], [869], [876], [883], [890], [897], [900], [902], [1107], [1161], [1164], [1178], [1179], [1181], [1183], [1186], [1194], [1205], [1208], [1209], [1212], [1215], [1246], [1247], [1249], [1318], [1321], [1327], [1362], [1365], [1379], [1387], [1390], [1392], [1395], [1399], [1588], [1590], [1592], [1594], [1595], [1607], [1608], [1609], [1610], [1611], [1612], [1613], [1625], [1635], [1636], [1637], [1638], [1639], [1640], [1643], [1644], [1645], [1646], [1647], [1649], [1650], [1651], [1652], [1659], [1660], [1665], [1666], [1669], [1670], [1681], [1697], [1698], [1705], [1706], [1707], [1708], [1709], [1717], [1718], [1719], [1721], [1722], [1723], [1724], [1725], [1726], [1727], [1728], [1729], [1731], [1732], [1733], [1734], [1743], [1744], [1755], [1767], [1768], [1777], [1779], [1780], [1781], [1782], [1783], [1784], [1785], [1786], [1787], [1789], [1790], [1791], [1792], [1793], [1794], [1795], [1809], [1810], [1811], [1812], [1813], [1814], [1815], [1816], [1817] [2019-10-03 02:48:42,155 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:48:42,155 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:48:42,279 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:48:42,281 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 197 root evaluator evaluations with a maximum evaluation depth of 0. Performed 197 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 360 variables. [2019-10-03 02:48:42,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:48:42,286 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:48:42,360 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-03 02:48:42,360 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:48:42,366 INFO L420 sIntCurrentIteration]: We unified 225 AI predicates to 225 [2019-10-03 02:48:42,367 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:48:42,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:48:42,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2019-10-03 02:48:42,368 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:48:42,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:48:42,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:48:42,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:48:42,369 INFO L87 Difference]: Start difference. First operand 92778 states and 140750 transitions. Second operand 2 states. [2019-10-03 02:48:42,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:48:42,370 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-03 02:48:42,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:48:42,370 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 226 [2019-10-03 02:48:42,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:48:42,371 INFO L225 Difference]: With dead ends: 2 [2019-10-03 02:48:42,371 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:48:42,371 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:48:42,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:48:42,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:48:42,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:48:42,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:48:42,372 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 226 [2019-10-03 02:48:42,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:48:42,372 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:48:42,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:48:42,373 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:48:42,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:48:42,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:48:42 BoogieIcfgContainer [2019-10-03 02:48:42,378 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:48:42,381 INFO L168 Benchmark]: Toolchain (without parser) took 57165.60 ms. Allocated memory was 132.6 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 84.9 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-10-03 02:48:42,382 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 132.6 MB. Free memory was 106.9 MB in the beginning and 106.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:48:42,383 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1122.37 ms. Allocated memory was 132.6 MB in the beginning and 201.9 MB in the end (delta: 69.2 MB). Free memory was 84.7 MB in the beginning and 136.0 MB in the end (delta: -51.4 MB). Peak memory consumption was 33.6 MB. Max. memory is 7.1 GB. [2019-10-03 02:48:42,384 INFO L168 Benchmark]: Boogie Preprocessor took 194.01 ms. Allocated memory is still 201.9 MB. Free memory was 136.0 MB in the beginning and 127.4 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 7.1 GB. [2019-10-03 02:48:42,384 INFO L168 Benchmark]: RCFGBuilder took 2486.17 ms. Allocated memory was 201.9 MB in the beginning and 266.9 MB in the end (delta: 65.0 MB). Free memory was 127.4 MB in the beginning and 175.9 MB in the end (delta: -48.5 MB). Peak memory consumption was 86.7 MB. Max. memory is 7.1 GB. [2019-10-03 02:48:42,385 INFO L168 Benchmark]: TraceAbstraction took 53358.54 ms. Allocated memory was 266.9 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 175.9 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-10-03 02:48:42,389 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.23 ms. Allocated memory is still 132.6 MB. Free memory was 106.9 MB in the beginning and 106.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1122.37 ms. Allocated memory was 132.6 MB in the beginning and 201.9 MB in the end (delta: 69.2 MB). Free memory was 84.7 MB in the beginning and 136.0 MB in the end (delta: -51.4 MB). Peak memory consumption was 33.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 194.01 ms. Allocated memory is still 201.9 MB. Free memory was 136.0 MB in the beginning and 127.4 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2486.17 ms. Allocated memory was 201.9 MB in the beginning and 266.9 MB in the end (delta: 65.0 MB). Free memory was 127.4 MB in the beginning and 175.9 MB in the end (delta: -48.5 MB). Peak memory consumption was 86.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 53358.54 ms. Allocated memory was 266.9 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 175.9 MB in the beginning and 1.3 GB in the end (delta: -1.1 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: 393]: 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 109 procedures, 737 locations, 1 error locations. SAFE Result, 53.2s OverallTime, 21 OverallIterations, 3 TraceHistogramMax, 18.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 13429 SDtfs, 5839 SDslu, 64095 SDs, 0 SdLazy, 6655 SolverSat, 550 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 470 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92778occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.968888888888889 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 23.9s AutomataMinimizationTime, 21 MinimizatonAttempts, 6870 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 4342 NumberOfCodeBlocks, 4342 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 4321 ConstructedInterpolants, 0 QuantifiedInterpolants, 1124708 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 20 PerfectInterpolantSequences, 791/794 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...