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_spec7_product29.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:44:55,181 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:44:55,183 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:44:55,202 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:44:55,202 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:44:55,204 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:44:55,206 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:44:55,218 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:44:55,220 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:44:55,221 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:44:55,225 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:44:55,227 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:44:55,227 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:44:55,230 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:44:55,232 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:44:55,234 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:44:55,236 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:44:55,239 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:44:55,241 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:44:55,244 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:44:55,248 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:44:55,250 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:44:55,253 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:44:55,254 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:44:55,257 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:44:55,257 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:44:55,257 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:44:55,260 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:44:55,261 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:44:55,262 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:44:55,263 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:44:55,265 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:44:55,266 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:44:55,266 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:44:55,268 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:44:55,269 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:44:55,269 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:44:55,269 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:44:55,270 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:44:55,270 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:44:55,271 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:44:55,272 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 02:44:55,295 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:44:55,296 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:44:55,297 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:44:55,297 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:44:55,298 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:44:55,298 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:44:55,298 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:44:55,298 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:44:55,299 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:44:55,299 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:44:55,301 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:44:55,301 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:44:55,301 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:44:55,302 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:44:55,302 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:44:55,302 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:44:55,302 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:44:55,303 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:44:55,303 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:44:55,303 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:44:55,303 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:44:55,303 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:44:55,304 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:44:55,304 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:44:55,304 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:44:55,304 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:44:55,305 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:44:55,305 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:44:55,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:44:55,305 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:44:55,353 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:44:55,371 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:44:55,375 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:44:55,376 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:44:55,377 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:44:55,377 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec7_product29.cil.c [2019-09-10 02:44:55,442 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1626fd8f/405248b63d01427f9f046644a7297357/FLAG3c4c7f3e8 [2019-09-10 02:44:55,955 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:44:55,956 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec7_product29.cil.c [2019-09-10 02:44:55,997 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1626fd8f/405248b63d01427f9f046644a7297357/FLAG3c4c7f3e8 [2019-09-10 02:44:56,187 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1626fd8f/405248b63d01427f9f046644a7297357 [2019-09-10 02:44:56,197 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:44:56,198 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:44:56,199 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:44:56,199 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:44:56,202 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:44:56,203 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:44:56" (1/1) ... [2019-09-10 02:44:56,206 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@272c4be6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:44:56, skipping insertion in model container [2019-09-10 02:44:56,206 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:44:56" (1/1) ... [2019-09-10 02:44:56,214 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:44:56,293 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:44:57,234 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:44:57,261 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:44:57,410 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:44:57,515 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:44:57,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:44:57 WrapperNode [2019-09-10 02:44:57,517 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:44:57,518 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:44:57,518 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:44:57,518 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:44:57,534 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:44:57" (1/1) ... [2019-09-10 02:44:57,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:44:57" (1/1) ... [2019-09-10 02:44:57,597 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:44:57" (1/1) ... [2019-09-10 02:44:57,598 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:44:57" (1/1) ... [2019-09-10 02:44:57,656 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:44:57" (1/1) ... [2019-09-10 02:44:57,697 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:44:57" (1/1) ... [2019-09-10 02:44:57,717 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:44:57" (1/1) ... [2019-09-10 02:44:57,752 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:44:57,753 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:44:57,753 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:44:57,753 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:44:57,755 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:44:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:44:57,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:44:57,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:44:57,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-10 02:44:57,835 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-10 02:44:57,835 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-10 02:44:57,836 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-10 02:44:57,836 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-10 02:44:57,836 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-10 02:44:57,836 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-10 02:44:57,836 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-10 02:44:57,837 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-10 02:44:57,837 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-10 02:44:57,837 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:44:57,837 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-10 02:44:57,838 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-10 02:44:57,838 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-10 02:44:57,838 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-10 02:44:57,838 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-10 02:44:57,839 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-10 02:44:57,839 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-10 02:44:57,839 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-10 02:44:57,839 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-10 02:44:57,839 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-09-10 02:44:57,840 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-10 02:44:57,840 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-10 02:44:57,840 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-10 02:44:57,840 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-10 02:44:57,840 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-10 02:44:57,841 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-10 02:44:57,841 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-10 02:44:57,841 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-10 02:44:57,841 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptVerify_spec__1 [2019-09-10 02:44:57,841 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-10 02:44:57,842 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-10 02:44:57,842 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2019-09-10 02:44:57,842 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AddressBook [2019-09-10 02:44:57,842 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-10 02:44:57,842 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-10 02:44:57,842 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-09-10 02:44:57,843 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-09-10 02:44:57,843 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-10 02:44:57,843 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-10 02:44:57,843 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-10 02:44:57,843 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-10 02:44:57,844 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-10 02:44:57,844 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-10 02:44:57,844 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-10 02:44:57,844 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-10 02:44:57,844 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-10 02:44:57,845 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-09-10 02:44:57,845 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-09-10 02:44:57,845 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-09-10 02:44:57,845 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-10 02:44:57,845 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-10 02:44:57,845 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-10 02:44:57,846 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-10 02:44:57,846 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-10 02:44:57,846 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-10 02:44:57,846 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-10 02:44:57,846 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-10 02:44:57,847 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-10 02:44:57,847 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-10 02:44:57,847 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-10 02:44:57,847 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-10 02:44:57,847 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-10 02:44:57,848 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-10 02:44:57,848 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-10 02:44:57,848 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-10 02:44:57,848 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-10 02:44:57,848 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-10 02:44:57,849 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-10 02:44:57,849 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-10 02:44:57,849 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-10 02:44:57,849 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-10 02:44:57,849 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-10 02:44:57,850 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-10 02:44:57,850 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-10 02:44:57,850 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-10 02:44:57,850 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-10 02:44:57,850 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-10 02:44:57,850 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-10 02:44:57,851 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-10 02:44:57,851 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AddressBook [2019-09-10 02:44:57,851 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Sign [2019-09-10 02:44:57,851 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-10 02:44:57,851 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-10 02:44:57,851 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-10 02:44:57,852 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-10 02:44:57,852 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-10 02:44:57,852 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-10 02:44:57,852 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-10 02:44:57,852 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-10 02:44:57,852 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-10 02:44:57,853 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-10 02:44:57,853 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-10 02:44:57,853 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-10 02:44:57,853 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-10 02:44:57,853 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-10 02:44:57,853 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-10 02:44:57,853 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-10 02:44:57,854 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-10 02:44:57,854 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-10 02:44:57,854 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-10 02:44:57,854 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-10 02:44:57,854 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-10 02:44:57,854 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-10 02:44:57,855 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-10 02:44:57,855 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-10 02:44:57,855 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-10 02:44:57,855 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-10 02:44:57,855 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-10 02:44:57,855 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-10 02:44:57,856 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-10 02:44:57,856 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-10 02:44:57,856 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-10 02:44:57,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:44:57,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:44:57,856 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-10 02:44:57,857 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-10 02:44:57,857 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-10 02:44:57,857 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-10 02:44:57,857 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-10 02:44:57,857 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-10 02:44:57,857 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-10 02:44:57,857 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-10 02:44:57,858 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-10 02:44:57,858 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-10 02:44:57,858 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-10 02:44:57,858 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-10 02:44:57,858 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-10 02:44:57,858 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-10 02:44:57,859 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-10 02:44:57,859 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-10 02:44:57,859 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-10 02:44:57,859 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-10 02:44:57,859 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-10 02:44:57,859 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-10 02:44:57,860 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-10 02:44:57,860 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-10 02:44:57,860 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-10 02:44:57,860 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-10 02:44:57,860 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-10 02:44:57,860 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-10 02:44:57,861 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-10 02:44:57,861 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-10 02:44:57,861 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:44:57,861 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-10 02:44:57,861 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-10 02:44:57,861 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-10 02:44:57,861 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-10 02:44:57,862 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-10 02:44:57,862 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-10 02:44:57,862 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-10 02:44:57,862 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-10 02:44:57,862 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-10 02:44:57,862 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-09-10 02:44:57,863 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-10 02:44:57,863 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-10 02:44:57,863 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-10 02:44:57,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 02:44:57,863 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-10 02:44:57,863 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-10 02:44:57,864 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-10 02:44:57,864 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-10 02:44:57,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-10 02:44:57,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-10 02:44:57,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 02:44:57,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-10 02:44:57,865 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-10 02:44:57,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 02:44:57,865 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-10 02:44:57,865 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-10 02:44:57,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 02:44:57,865 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-10 02:44:57,865 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-10 02:44:57,866 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-10 02:44:57,866 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-10 02:44:57,866 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-10 02:44:57,866 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptVerify_spec__1 [2019-09-10 02:44:57,866 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-10 02:44:57,866 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-10 02:44:57,866 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-10 02:44:57,867 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-10 02:44:57,867 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-10 02:44:57,867 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-10 02:44:57,867 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-10 02:44:57,867 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-10 02:44:57,867 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-10 02:44:57,867 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-10 02:44:57,868 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-10 02:44:57,868 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-10 02:44:57,868 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-10 02:44:57,868 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-10 02:44:57,868 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-10 02:44:57,868 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-10 02:44:57,869 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-10 02:44:57,869 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-10 02:44:57,869 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-10 02:44:57,869 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-10 02:44:57,869 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-10 02:44:57,869 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-10 02:44:57,869 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-10 02:44:57,870 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-10 02:44:57,870 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-10 02:44:57,870 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-10 02:44:57,870 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-09-10 02:44:57,870 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-09-10 02:44:57,870 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-09-10 02:44:57,870 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-10 02:44:57,871 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2019-09-10 02:44:57,871 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AddressBook [2019-09-10 02:44:57,871 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-09-10 02:44:57,871 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-09-10 02:44:57,871 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-10 02:44:57,871 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-10 02:44:57,871 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-10 02:44:57,872 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-10 02:44:57,872 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-10 02:44:57,872 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-10 02:44:57,872 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-10 02:44:57,872 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-10 02:44:57,872 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-10 02:44:57,873 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-10 02:44:57,873 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-10 02:44:57,873 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-10 02:44:57,873 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-10 02:44:57,873 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-10 02:44:57,873 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-10 02:44:57,873 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-10 02:44:57,874 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-10 02:44:57,874 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-10 02:44:57,874 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AddressBook [2019-09-10 02:44:57,874 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Sign [2019-09-10 02:44:57,874 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-10 02:44:57,874 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-10 02:44:57,874 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-10 02:44:57,875 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-10 02:44:57,875 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-10 02:44:57,875 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-10 02:44:57,875 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-10 02:44:57,875 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-10 02:44:57,875 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-10 02:44:57,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:44:57,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-10 02:44:57,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:45:00,134 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:45:00,135 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-10 02:45:00,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:45:00 BoogieIcfgContainer [2019-09-10 02:45:00,137 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:45:00,139 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:45:00,139 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:45:00,143 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:45:00,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:44:56" (1/3) ... [2019-09-10 02:45:00,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53440da3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:45:00, skipping insertion in model container [2019-09-10 02:45:00,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:44:57" (2/3) ... [2019-09-10 02:45:00,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53440da3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:45:00, skipping insertion in model container [2019-09-10 02:45:00,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:45:00" (3/3) ... [2019-09-10 02:45:00,147 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec7_product29.cil.c [2019-09-10 02:45:00,158 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:45:00,171 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:45:00,189 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:45:00,214 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:45:00,215 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:45:00,215 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:45:00,215 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:45:00,215 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:45:00,215 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:45:00,215 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:45:00,215 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:45:00,246 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states. [2019-09-10 02:45:00,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-10 02:45:00,277 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:00,278 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:00,281 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:00,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:00,287 INFO L82 PathProgramCache]: Analyzing trace with hash 2048915059, now seen corresponding path program 1 times [2019-09-10 02:45:00,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:00,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:00,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:00,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:00,342 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:00,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:01,095 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:45:01,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:01,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-10 02:45:01,098 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:01,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:45:01,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:45:01,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:45:01,126 INFO L87 Difference]: Start difference. First operand 598 states. Second operand 2 states. [2019-09-10 02:45:01,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:01,187 INFO L93 Difference]: Finished difference Result 550 states and 753 transitions. [2019-09-10 02:45:01,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:45:01,188 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 191 [2019-09-10 02:45:01,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:01,212 INFO L225 Difference]: With dead ends: 550 [2019-09-10 02:45:01,212 INFO L226 Difference]: Without dead ends: 541 [2019-09-10 02:45:01,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:45:01,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2019-09-10 02:45:01,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2019-09-10 02:45:01,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-09-10 02:45:01,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 742 transitions. [2019-09-10 02:45:01,321 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 742 transitions. Word has length 191 [2019-09-10 02:45:01,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:01,324 INFO L475 AbstractCegarLoop]: Abstraction has 541 states and 742 transitions. [2019-09-10 02:45:01,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:45:01,324 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 742 transitions. [2019-09-10 02:45:01,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 02:45:01,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:01,332 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:01,332 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:01,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:01,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1030093926, now seen corresponding path program 1 times [2019-09-10 02:45:01,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:01,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:01,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:01,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:01,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:01,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:01,594 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:45:01,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:01,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:45:01,594 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:01,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:45:01,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:45:01,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:45:01,598 INFO L87 Difference]: Start difference. First operand 541 states and 742 transitions. Second operand 3 states. [2019-09-10 02:45:01,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:01,640 INFO L93 Difference]: Finished difference Result 544 states and 745 transitions. [2019-09-10 02:45:01,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:45:01,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-09-10 02:45:01,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:01,648 INFO L225 Difference]: With dead ends: 544 [2019-09-10 02:45:01,649 INFO L226 Difference]: Without dead ends: 544 [2019-09-10 02:45:01,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:45:01,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-09-10 02:45:01,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 543. [2019-09-10 02:45:01,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-09-10 02:45:01,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 744 transitions. [2019-09-10 02:45:01,693 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 744 transitions. Word has length 192 [2019-09-10 02:45:01,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:01,694 INFO L475 AbstractCegarLoop]: Abstraction has 543 states and 744 transitions. [2019-09-10 02:45:01,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:45:01,694 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 744 transitions. [2019-09-10 02:45:01,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-10 02:45:01,702 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:01,705 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:01,706 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:01,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:01,706 INFO L82 PathProgramCache]: Analyzing trace with hash -369073018, now seen corresponding path program 1 times [2019-09-10 02:45:01,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:01,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:01,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:01,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:01,708 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:01,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:02,011 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:45:02,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:02,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:45:02,012 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:02,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:45:02,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:45:02,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:45:02,018 INFO L87 Difference]: Start difference. First operand 543 states and 744 transitions. Second operand 3 states. [2019-09-10 02:45:02,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:02,061 INFO L93 Difference]: Finished difference Result 584 states and 814 transitions. [2019-09-10 02:45:02,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:45:02,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-09-10 02:45:02,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:02,073 INFO L225 Difference]: With dead ends: 584 [2019-09-10 02:45:02,073 INFO L226 Difference]: Without dead ends: 584 [2019-09-10 02:45:02,073 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:45:02,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-09-10 02:45:02,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 583. [2019-09-10 02:45:02,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-09-10 02:45:02,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 813 transitions. [2019-09-10 02:45:02,120 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 813 transitions. Word has length 198 [2019-09-10 02:45:02,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:02,120 INFO L475 AbstractCegarLoop]: Abstraction has 583 states and 813 transitions. [2019-09-10 02:45:02,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:45:02,121 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 813 transitions. [2019-09-10 02:45:02,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-10 02:45:02,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:02,129 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:02,130 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:02,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:02,130 INFO L82 PathProgramCache]: Analyzing trace with hash -436885539, now seen corresponding path program 1 times [2019-09-10 02:45:02,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:02,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:02,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:02,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:02,132 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:02,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:02,658 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-10 02:45:02,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:02,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 02:45:02,662 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:02,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 02:45:02,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 02:45:02,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-09-10 02:45:02,674 INFO L87 Difference]: Start difference. First operand 583 states and 813 transitions. Second operand 19 states. [2019-09-10 02:45:07,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:07,990 INFO L93 Difference]: Finished difference Result 1721 states and 2417 transitions. [2019-09-10 02:45:07,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-10 02:45:07,990 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 199 [2019-09-10 02:45:07,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:08,007 INFO L225 Difference]: With dead ends: 1721 [2019-09-10 02:45:08,008 INFO L226 Difference]: Without dead ends: 1721 [2019-09-10 02:45:08,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=267, Invalid=2385, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:45:08,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2019-09-10 02:45:08,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1689. [2019-09-10 02:45:08,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1689 states. [2019-09-10 02:45:08,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1689 states to 1689 states and 2374 transitions. [2019-09-10 02:45:08,099 INFO L78 Accepts]: Start accepts. Automaton has 1689 states and 2374 transitions. Word has length 199 [2019-09-10 02:45:08,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:08,100 INFO L475 AbstractCegarLoop]: Abstraction has 1689 states and 2374 transitions. [2019-09-10 02:45:08,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 02:45:08,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1689 states and 2374 transitions. [2019-09-10 02:45:08,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-10 02:45:08,107 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:08,107 INFO L399 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] [2019-09-10 02:45:08,108 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:08,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:08,108 INFO L82 PathProgramCache]: Analyzing trace with hash 175793894, now seen corresponding path program 1 times [2019-09-10 02:45:08,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:08,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:08,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:08,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:08,110 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:08,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:08,312 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:45:08,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:08,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:45:08,313 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:08,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:45:08,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:45:08,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:45:08,315 INFO L87 Difference]: Start difference. First operand 1689 states and 2374 transitions. Second operand 5 states. [2019-09-10 02:45:08,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:08,374 INFO L93 Difference]: Finished difference Result 1410 states and 1995 transitions. [2019-09-10 02:45:08,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:45:08,378 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 202 [2019-09-10 02:45:08,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:08,388 INFO L225 Difference]: With dead ends: 1410 [2019-09-10 02:45:08,388 INFO L226 Difference]: Without dead ends: 1407 [2019-09-10 02:45:08,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:45:08,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2019-09-10 02:45:08,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 1407. [2019-09-10 02:45:08,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1407 states. [2019-09-10 02:45:08,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1407 states and 1987 transitions. [2019-09-10 02:45:08,450 INFO L78 Accepts]: Start accepts. Automaton has 1407 states and 1987 transitions. Word has length 202 [2019-09-10 02:45:08,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:08,452 INFO L475 AbstractCegarLoop]: Abstraction has 1407 states and 1987 transitions. [2019-09-10 02:45:08,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:45:08,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1407 states and 1987 transitions. [2019-09-10 02:45:08,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-10 02:45:08,458 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:08,458 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:08,458 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:08,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:08,459 INFO L82 PathProgramCache]: Analyzing trace with hash 603543550, now seen corresponding path program 1 times [2019-09-10 02:45:08,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:08,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:08,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:08,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:08,462 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:08,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:08,822 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-10 02:45:08,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:08,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 02:45:08,823 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:08,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 02:45:08,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 02:45:08,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-09-10 02:45:08,824 INFO L87 Difference]: Start difference. First operand 1407 states and 1987 transitions. Second operand 15 states. [2019-09-10 02:45:12,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:12,101 INFO L93 Difference]: Finished difference Result 1473 states and 2090 transitions. [2019-09-10 02:45:12,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 02:45:12,101 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 200 [2019-09-10 02:45:12,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:12,112 INFO L225 Difference]: With dead ends: 1473 [2019-09-10 02:45:12,112 INFO L226 Difference]: Without dead ends: 1473 [2019-09-10 02:45:12,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=1035, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 02:45:12,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2019-09-10 02:45:12,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 1443. [2019-09-10 02:45:12,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1443 states. [2019-09-10 02:45:12,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 2046 transitions. [2019-09-10 02:45:12,173 INFO L78 Accepts]: Start accepts. Automaton has 1443 states and 2046 transitions. Word has length 200 [2019-09-10 02:45:12,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:12,173 INFO L475 AbstractCegarLoop]: Abstraction has 1443 states and 2046 transitions. [2019-09-10 02:45:12,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 02:45:12,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 2046 transitions. [2019-09-10 02:45:12,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-10 02:45:12,179 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:12,179 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:12,180 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:12,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:12,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1383640434, now seen corresponding path program 1 times [2019-09-10 02:45:12,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:12,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:12,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:12,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:12,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:12,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:12,514 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-10 02:45:12,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:12,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 02:45:12,515 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:12,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 02:45:12,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 02:45:12,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-09-10 02:45:12,517 INFO L87 Difference]: Start difference. First operand 1443 states and 2046 transitions. Second operand 18 states. [2019-09-10 02:45:13,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:13,040 INFO L93 Difference]: Finished difference Result 1573 states and 2235 transitions. [2019-09-10 02:45:13,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 02:45:13,041 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 200 [2019-09-10 02:45:13,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:13,053 INFO L225 Difference]: With dead ends: 1573 [2019-09-10 02:45:13,053 INFO L226 Difference]: Without dead ends: 1561 [2019-09-10 02:45:13,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2019-09-10 02:45:13,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1561 states. [2019-09-10 02:45:13,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1561 to 1561. [2019-09-10 02:45:13,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2019-09-10 02:45:13,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 2218 transitions. [2019-09-10 02:45:13,192 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 2218 transitions. Word has length 200 [2019-09-10 02:45:13,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:13,192 INFO L475 AbstractCegarLoop]: Abstraction has 1561 states and 2218 transitions. [2019-09-10 02:45:13,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 02:45:13,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 2218 transitions. [2019-09-10 02:45:13,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-10 02:45:13,204 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:13,205 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:13,205 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:13,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:13,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1967915888, now seen corresponding path program 1 times [2019-09-10 02:45:13,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:13,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:13,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:13,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:13,208 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:13,392 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:45:13,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:13,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:45:13,393 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:13,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:45:13,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:45:13,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:45:13,395 INFO L87 Difference]: Start difference. First operand 1561 states and 2218 transitions. Second operand 5 states. [2019-09-10 02:45:14,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:14,401 INFO L93 Difference]: Finished difference Result 3450 states and 4922 transitions. [2019-09-10 02:45:14,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:45:14,402 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 200 [2019-09-10 02:45:14,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:14,424 INFO L225 Difference]: With dead ends: 3450 [2019-09-10 02:45:14,424 INFO L226 Difference]: Without dead ends: 3450 [2019-09-10 02:45:14,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:45:14,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3450 states. [2019-09-10 02:45:14,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3450 to 3432. [2019-09-10 02:45:14,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3432 states. [2019-09-10 02:45:14,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3432 states to 3432 states and 4894 transitions. [2019-09-10 02:45:14,576 INFO L78 Accepts]: Start accepts. Automaton has 3432 states and 4894 transitions. Word has length 200 [2019-09-10 02:45:14,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:14,577 INFO L475 AbstractCegarLoop]: Abstraction has 3432 states and 4894 transitions. [2019-09-10 02:45:14,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:45:14,578 INFO L276 IsEmpty]: Start isEmpty. Operand 3432 states and 4894 transitions. [2019-09-10 02:45:14,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-10 02:45:14,590 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:14,591 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:14,591 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:14,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:14,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1947578513, now seen corresponding path program 1 times [2019-09-10 02:45:14,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:14,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:14,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:14,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:14,594 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:14,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:15,024 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:45:15,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:15,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:45:15,025 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:15,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:45:15,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:45:15,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:45:15,027 INFO L87 Difference]: Start difference. First operand 3432 states and 4894 transitions. Second operand 7 states. [2019-09-10 02:45:16,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:16,884 INFO L93 Difference]: Finished difference Result 8654 states and 12968 transitions. [2019-09-10 02:45:16,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 02:45:16,885 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 200 [2019-09-10 02:45:16,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:16,947 INFO L225 Difference]: With dead ends: 8654 [2019-09-10 02:45:16,947 INFO L226 Difference]: Without dead ends: 8654 [2019-09-10 02:45:16,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-10 02:45:16,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8654 states. [2019-09-10 02:45:17,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8654 to 8644. [2019-09-10 02:45:17,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8644 states. [2019-09-10 02:45:17,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8644 states to 8644 states and 12956 transitions. [2019-09-10 02:45:17,388 INFO L78 Accepts]: Start accepts. Automaton has 8644 states and 12956 transitions. Word has length 200 [2019-09-10 02:45:17,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:17,389 INFO L475 AbstractCegarLoop]: Abstraction has 8644 states and 12956 transitions. [2019-09-10 02:45:17,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:45:17,389 INFO L276 IsEmpty]: Start isEmpty. Operand 8644 states and 12956 transitions. [2019-09-10 02:45:17,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-10 02:45:17,400 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:17,400 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:17,400 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:17,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:17,401 INFO L82 PathProgramCache]: Analyzing trace with hash 212373713, now seen corresponding path program 1 times [2019-09-10 02:45:17,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:17,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:17,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:17,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:17,404 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:17,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:17,968 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:45:17,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:17,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-09-10 02:45:17,968 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:17,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 02:45:17,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 02:45:17,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-09-10 02:45:17,970 INFO L87 Difference]: Start difference. First operand 8644 states and 12956 transitions. Second operand 28 states. [2019-09-10 02:45:19,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:19,019 INFO L93 Difference]: Finished difference Result 8989 states and 13488 transitions. [2019-09-10 02:45:19,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 02:45:19,019 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 201 [2019-09-10 02:45:19,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:19,083 INFO L225 Difference]: With dead ends: 8989 [2019-09-10 02:45:19,084 INFO L226 Difference]: Without dead ends: 8989 [2019-09-10 02:45:19,084 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=1459, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 02:45:19,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8989 states. [2019-09-10 02:45:19,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8989 to 8972. [2019-09-10 02:45:19,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8972 states. [2019-09-10 02:45:19,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8972 states to 8972 states and 13455 transitions. [2019-09-10 02:45:19,507 INFO L78 Accepts]: Start accepts. Automaton has 8972 states and 13455 transitions. Word has length 201 [2019-09-10 02:45:19,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:19,508 INFO L475 AbstractCegarLoop]: Abstraction has 8972 states and 13455 transitions. [2019-09-10 02:45:19,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 02:45:19,508 INFO L276 IsEmpty]: Start isEmpty. Operand 8972 states and 13455 transitions. [2019-09-10 02:45:19,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-10 02:45:19,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:19,516 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:19,516 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:19,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:19,517 INFO L82 PathProgramCache]: Analyzing trace with hash -469886620, now seen corresponding path program 1 times [2019-09-10 02:45:19,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:19,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:19,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:19,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:19,519 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:19,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:19,728 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:45:19,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:19,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:45:19,729 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:19,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:45:19,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:45:19,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:45:19,731 INFO L87 Difference]: Start difference. First operand 8972 states and 13455 transitions. Second operand 10 states. [2019-09-10 02:45:19,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:19,860 INFO L93 Difference]: Finished difference Result 9068 states and 13583 transitions. [2019-09-10 02:45:19,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 02:45:19,860 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 205 [2019-09-10 02:45:19,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:19,922 INFO L225 Difference]: With dead ends: 9068 [2019-09-10 02:45:19,922 INFO L226 Difference]: Without dead ends: 9068 [2019-09-10 02:45:19,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:45:19,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9068 states. [2019-09-10 02:45:20,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9068 to 9068. [2019-09-10 02:45:20,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9068 states. [2019-09-10 02:45:20,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9068 states to 9068 states and 13583 transitions. [2019-09-10 02:45:20,222 INFO L78 Accepts]: Start accepts. Automaton has 9068 states and 13583 transitions. Word has length 205 [2019-09-10 02:45:20,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:20,223 INFO L475 AbstractCegarLoop]: Abstraction has 9068 states and 13583 transitions. [2019-09-10 02:45:20,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:45:20,223 INFO L276 IsEmpty]: Start isEmpty. Operand 9068 states and 13583 transitions. [2019-09-10 02:45:20,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-10 02:45:20,232 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:20,232 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:20,232 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:20,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:20,233 INFO L82 PathProgramCache]: Analyzing trace with hash -208674281, now seen corresponding path program 1 times [2019-09-10 02:45:20,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:20,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:20,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:20,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:20,234 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:20,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:20,361 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:45:20,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:20,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:45:20,362 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:20,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:45:20,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:45:20,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:45:20,363 INFO L87 Difference]: Start difference. First operand 9068 states and 13583 transitions. Second operand 5 states. [2019-09-10 02:45:20,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:20,438 INFO L93 Difference]: Finished difference Result 9397 states and 14344 transitions. [2019-09-10 02:45:20,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:45:20,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-09-10 02:45:20,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:20,478 INFO L225 Difference]: With dead ends: 9397 [2019-09-10 02:45:20,478 INFO L226 Difference]: Without dead ends: 9397 [2019-09-10 02:45:20,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:45:20,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9397 states. [2019-09-10 02:45:21,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9397 to 9234. [2019-09-10 02:45:21,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9234 states. [2019-09-10 02:45:21,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9234 states to 9234 states and 13823 transitions. [2019-09-10 02:45:21,360 INFO L78 Accepts]: Start accepts. Automaton has 9234 states and 13823 transitions. Word has length 210 [2019-09-10 02:45:21,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:21,360 INFO L475 AbstractCegarLoop]: Abstraction has 9234 states and 13823 transitions. [2019-09-10 02:45:21,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:45:21,361 INFO L276 IsEmpty]: Start isEmpty. Operand 9234 states and 13823 transitions. [2019-09-10 02:45:21,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-10 02:45:21,370 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:21,370 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:21,370 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:21,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:21,371 INFO L82 PathProgramCache]: Analyzing trace with hash 952522831, now seen corresponding path program 1 times [2019-09-10 02:45:21,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:21,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:21,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:21,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:21,373 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:21,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:21,658 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:45:21,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:21,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 02:45:21,658 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:21,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 02:45:21,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 02:45:21,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-10 02:45:21,661 INFO L87 Difference]: Start difference. First operand 9234 states and 13823 transitions. Second operand 13 states. [2019-09-10 02:45:22,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:22,295 INFO L93 Difference]: Finished difference Result 9238 states and 13827 transitions. [2019-09-10 02:45:22,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 02:45:22,295 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 210 [2019-09-10 02:45:22,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:22,335 INFO L225 Difference]: With dead ends: 9238 [2019-09-10 02:45:22,336 INFO L226 Difference]: Without dead ends: 9238 [2019-09-10 02:45:22,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2019-09-10 02:45:22,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9238 states. [2019-09-10 02:45:22,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9238 to 9206. [2019-09-10 02:45:22,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9206 states. [2019-09-10 02:45:22,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9206 states to 9206 states and 13770 transitions. [2019-09-10 02:45:22,674 INFO L78 Accepts]: Start accepts. Automaton has 9206 states and 13770 transitions. Word has length 210 [2019-09-10 02:45:22,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:22,674 INFO L475 AbstractCegarLoop]: Abstraction has 9206 states and 13770 transitions. [2019-09-10 02:45:22,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 02:45:22,675 INFO L276 IsEmpty]: Start isEmpty. Operand 9206 states and 13770 transitions. [2019-09-10 02:45:22,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-10 02:45:22,683 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:22,684 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:22,684 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:22,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:22,685 INFO L82 PathProgramCache]: Analyzing trace with hash -438718559, now seen corresponding path program 1 times [2019-09-10 02:45:22,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:22,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:22,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:22,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:22,687 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:22,983 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:45:22,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:22,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:45:22,984 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:22,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:45:22,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:45:22,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:45:22,986 INFO L87 Difference]: Start difference. First operand 9206 states and 13770 transitions. Second operand 6 states. [2019-09-10 02:45:23,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:23,612 INFO L93 Difference]: Finished difference Result 18541 states and 28061 transitions. [2019-09-10 02:45:23,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:45:23,613 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 211 [2019-09-10 02:45:23,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:23,705 INFO L225 Difference]: With dead ends: 18541 [2019-09-10 02:45:23,705 INFO L226 Difference]: Without dead ends: 18541 [2019-09-10 02:45:23,707 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:45:23,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18541 states. [2019-09-10 02:45:24,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18541 to 18189. [2019-09-10 02:45:24,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18189 states. [2019-09-10 02:45:24,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18189 states to 18189 states and 27203 transitions. [2019-09-10 02:45:24,491 INFO L78 Accepts]: Start accepts. Automaton has 18189 states and 27203 transitions. Word has length 211 [2019-09-10 02:45:24,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:24,492 INFO L475 AbstractCegarLoop]: Abstraction has 18189 states and 27203 transitions. [2019-09-10 02:45:24,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:45:24,492 INFO L276 IsEmpty]: Start isEmpty. Operand 18189 states and 27203 transitions. [2019-09-10 02:45:24,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-10 02:45:24,513 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:24,513 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:24,514 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:24,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:24,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1807527184, now seen corresponding path program 1 times [2019-09-10 02:45:24,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:24,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:24,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:24,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:24,517 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:24,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:24,859 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-10 02:45:24,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:24,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 02:45:24,860 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:24,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:45:24,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:45:24,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:45:24,861 INFO L87 Difference]: Start difference. First operand 18189 states and 27203 transitions. Second operand 8 states. [2019-09-10 02:45:26,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:26,264 INFO L93 Difference]: Finished difference Result 37786 states and 57024 transitions. [2019-09-10 02:45:26,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 02:45:26,265 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 230 [2019-09-10 02:45:26,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:26,447 INFO L225 Difference]: With dead ends: 37786 [2019-09-10 02:45:26,447 INFO L226 Difference]: Without dead ends: 37786 [2019-09-10 02:45:26,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-10 02:45:26,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37786 states. [2019-09-10 02:45:27,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37786 to 37635. [2019-09-10 02:45:27,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37635 states. [2019-09-10 02:45:27,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37635 states to 37635 states and 56799 transitions. [2019-09-10 02:45:27,708 INFO L78 Accepts]: Start accepts. Automaton has 37635 states and 56799 transitions. Word has length 230 [2019-09-10 02:45:27,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:27,709 INFO L475 AbstractCegarLoop]: Abstraction has 37635 states and 56799 transitions. [2019-09-10 02:45:27,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:45:27,709 INFO L276 IsEmpty]: Start isEmpty. Operand 37635 states and 56799 transitions. [2019-09-10 02:45:27,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-10 02:45:27,745 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:27,745 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:27,746 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:27,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:27,746 INFO L82 PathProgramCache]: Analyzing trace with hash 879585434, now seen corresponding path program 1 times [2019-09-10 02:45:27,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:27,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:27,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:27,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:27,748 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:27,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:28,007 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-10 02:45:28,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:28,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 02:45:28,010 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:28,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 02:45:28,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 02:45:28,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-09-10 02:45:28,012 INFO L87 Difference]: Start difference. First operand 37635 states and 56799 transitions. Second operand 15 states. [2019-09-10 02:45:31,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:31,583 INFO L93 Difference]: Finished difference Result 37770 states and 56929 transitions. [2019-09-10 02:45:31,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 02:45:31,584 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 231 [2019-09-10 02:45:31,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:31,728 INFO L225 Difference]: With dead ends: 37770 [2019-09-10 02:45:31,729 INFO L226 Difference]: Without dead ends: 37770 [2019-09-10 02:45:31,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=1035, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 02:45:31,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37770 states. [2019-09-10 02:45:33,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37770 to 36828. [2019-09-10 02:45:33,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36828 states. [2019-09-10 02:45:33,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36828 states to 36828 states and 55115 transitions. [2019-09-10 02:45:33,964 INFO L78 Accepts]: Start accepts. Automaton has 36828 states and 55115 transitions. Word has length 231 [2019-09-10 02:45:33,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:33,964 INFO L475 AbstractCegarLoop]: Abstraction has 36828 states and 55115 transitions. [2019-09-10 02:45:33,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 02:45:33,965 INFO L276 IsEmpty]: Start isEmpty. Operand 36828 states and 55115 transitions. [2019-09-10 02:45:34,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-10 02:45:34,000 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:34,000 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:34,001 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:34,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:34,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1955624845, now seen corresponding path program 1 times [2019-09-10 02:45:34,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:34,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:34,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:34,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:34,003 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:34,178 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 02:45:34,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:34,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:45:34,179 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:34,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:45:34,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:45:34,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:45:34,180 INFO L87 Difference]: Start difference. First operand 36828 states and 55115 transitions. Second operand 7 states. [2019-09-10 02:45:39,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:39,324 INFO L93 Difference]: Finished difference Result 75236 states and 112762 transitions. [2019-09-10 02:45:39,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 02:45:39,325 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 231 [2019-09-10 02:45:39,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:39,620 INFO L225 Difference]: With dead ends: 75236 [2019-09-10 02:45:39,620 INFO L226 Difference]: Without dead ends: 75236 [2019-09-10 02:45:39,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-09-10 02:45:39,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75236 states. [2019-09-10 02:45:41,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75236 to 73625. [2019-09-10 02:45:41,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73625 states. [2019-09-10 02:45:41,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73625 states to 73625 states and 109932 transitions. [2019-09-10 02:45:41,474 INFO L78 Accepts]: Start accepts. Automaton has 73625 states and 109932 transitions. Word has length 231 [2019-09-10 02:45:41,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:41,474 INFO L475 AbstractCegarLoop]: Abstraction has 73625 states and 109932 transitions. [2019-09-10 02:45:41,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:45:41,475 INFO L276 IsEmpty]: Start isEmpty. Operand 73625 states and 109932 transitions. [2019-09-10 02:45:41,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-10 02:45:41,537 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:41,538 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:41,538 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:41,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:41,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1155224183, now seen corresponding path program 2 times [2019-09-10 02:45:41,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:41,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:41,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:41,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:41,540 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:41,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:41,725 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-10 02:45:41,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:45:41,725 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:45:41,726 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:45:41,727 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:45:41,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:45:41,727 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:45:41,747 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:45:41,747 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:45:42,382 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-10 02:45:42,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:45:42,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 2834 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 02:45:42,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:45:42,694 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-10 02:45:42,694 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:45:43,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:45:43,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:45:44,973 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:45:44,982 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 02:45:44,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [11] total 21 [2019-09-10 02:45:44,983 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:44,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:45:44,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:45:44,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-09-10 02:45:44,985 INFO L87 Difference]: Start difference. First operand 73625 states and 109932 transitions. Second operand 7 states. [2019-09-10 02:45:46,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:46,337 INFO L93 Difference]: Finished difference Result 73695 states and 110021 transitions. [2019-09-10 02:45:46,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:45:46,338 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 231 [2019-09-10 02:45:46,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:46,799 INFO L225 Difference]: With dead ends: 73695 [2019-09-10 02:45:46,799 INFO L226 Difference]: Without dead ends: 73691 [2019-09-10 02:45:46,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 451 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2019-09-10 02:45:46,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73691 states. [2019-09-10 02:45:50,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73691 to 73691. [2019-09-10 02:45:50,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73691 states. [2019-09-10 02:45:51,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73691 states to 73691 states and 110015 transitions. [2019-09-10 02:45:51,006 INFO L78 Accepts]: Start accepts. Automaton has 73691 states and 110015 transitions. Word has length 231 [2019-09-10 02:45:51,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:51,007 INFO L475 AbstractCegarLoop]: Abstraction has 73691 states and 110015 transitions. [2019-09-10 02:45:51,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:45:51,007 INFO L276 IsEmpty]: Start isEmpty. Operand 73691 states and 110015 transitions. [2019-09-10 02:45:51,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-10 02:45:51,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:51,076 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:51,077 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:51,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:51,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1514444913, now seen corresponding path program 1 times [2019-09-10 02:45:51,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:51,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:51,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:45:51,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:51,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:51,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:51,310 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 02:45:51,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:45:51,311 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:45:51,312 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 233 with the following transitions: [2019-09-10 02:45:51,316 INFO L207 CegarAbsIntRunner]: [59], [62], [63], [66], [72], [103], [106], [116], [117], [133], [135], [140], [144], [147], [148], [151], [160], [161], [162], [164], [246], [249], [255], [274], [276], [280], [283], [284], [285], [288], [294], [321], [324], [333], [344], [346], [349], [353], [354], [356], [357], [360], [370], [406], [444], [447], [456], [463], [632], [634], [635], [636], [672], [675], [689], [718], [719], [730], [732], [735], [738], [744], [745], [747], [750], [754], [768], [772], [775], [793], [796], [821], [823], [826], [828], [831], [833], [835], [838], [854], [863], [867], [869], [871], [874], [881], [888], [891], [1027], [1029], [1046], [1175], [1229], [1251], [1262], [1265], [1266], [1269], [1273], [1277], [1303], [1304], [1306], [1308], [1315], [1321], [1323], [1392], [1395], [1401], [1436], [1439], [1441], [1444], [1453], [1459], [1462], [1471], [1665], [1667], [1669], [1671], [1672], [1700], [1710], [1711], [1712], [1714], [1715], [1716], [1717], [1718], [1719], [1722], [1723], [1724], [1725], [1726], [1728], [1729], [1730], [1731], [1744], [1745], [1748], [1749], [1760], [1776], [1796], [1797], [1810], [1811], [1812], [1814], [1815], [1820], [1821], [1822], [1823], [1824], [1825], [1826], [1827], [1828], [1830], [1831], [1832], [1833], [1842], [1843], [1844], [1845], [1846], [1847], [1848], [1849], [1850], [1851], [1852], [1853], [1854], [1876], [1878], [1879], [1896], [1898], [1899], [1900], [1902], [1903], [1904], [1905], [1906], [1907], [1908], [1909], [1914], [1916], [1917], [1918], [1938], [1939], [1940], [1941], [1942], [1943], [1944], [1945], [1946] [2019-09-10 02:45:51,378 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:45:51,378 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:45:51,519 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 02:45:51,520 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 203 root evaluator evaluations with a maximum evaluation depth of 0. Performed 203 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 372 variables. [2019-09-10 02:45:51,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:51,525 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 02:45:51,642 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-10 02:45:51,643 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 02:45:51,650 INFO L420 sIntCurrentIteration]: We unified 231 AI predicates to 231 [2019-09-10 02:45:51,650 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 02:45:51,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 02:45:51,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2019-09-10 02:45:51,652 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:51,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:45:51,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:45:51,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:45:51,654 INFO L87 Difference]: Start difference. First operand 73691 states and 110015 transitions. Second operand 2 states. [2019-09-10 02:45:51,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:51,655 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-10 02:45:51,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:45:51,655 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 232 [2019-09-10 02:45:51,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:51,656 INFO L225 Difference]: With dead ends: 2 [2019-09-10 02:45:51,656 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 02:45:51,656 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:45:51,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 02:45:51,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 02:45:51,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 02:45:51,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 02:45:51,657 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 232 [2019-09-10 02:45:51,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:51,657 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 02:45:51,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:45:51,658 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 02:45:51,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 02:45:51,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 02:45:51 BoogieIcfgContainer [2019-09-10 02:45:51,664 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 02:45:51,670 INFO L168 Benchmark]: Toolchain (without parser) took 55468.17 ms. Allocated memory was 133.2 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 86.4 MB in the beginning and 792.4 MB in the end (delta: -706.0 MB). Peak memory consumption was 937.6 MB. Max. memory is 7.1 GB. [2019-09-10 02:45:51,676 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 133.2 MB. Free memory was 107.8 MB in the beginning and 107.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 02:45:51,677 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1318.46 ms. Allocated memory was 133.2 MB in the beginning and 201.3 MB in the end (delta: 68.2 MB). Free memory was 86.2 MB in the beginning and 134.6 MB in the end (delta: -48.4 MB). Peak memory consumption was 37.4 MB. Max. memory is 7.1 GB. [2019-09-10 02:45:51,678 INFO L168 Benchmark]: Boogie Preprocessor took 235.12 ms. Allocated memory is still 201.3 MB. Free memory was 134.6 MB in the beginning and 125.8 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. [2019-09-10 02:45:51,679 INFO L168 Benchmark]: RCFGBuilder took 2384.45 ms. Allocated memory was 201.3 MB in the beginning and 263.7 MB in the end (delta: 62.4 MB). Free memory was 125.8 MB in the beginning and 158.8 MB in the end (delta: -33.0 MB). Peak memory consumption was 85.5 MB. Max. memory is 7.1 GB. [2019-09-10 02:45:51,682 INFO L168 Benchmark]: TraceAbstraction took 51525.75 ms. Allocated memory was 263.7 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 158.8 MB in the beginning and 792.4 MB in the end (delta: -633.7 MB). Peak memory consumption was 879.4 MB. Max. memory is 7.1 GB. [2019-09-10 02:45:51,694 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.17 ms. Allocated memory is still 133.2 MB. Free memory was 107.8 MB in the beginning and 107.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1318.46 ms. Allocated memory was 133.2 MB in the beginning and 201.3 MB in the end (delta: 68.2 MB). Free memory was 86.2 MB in the beginning and 134.6 MB in the end (delta: -48.4 MB). Peak memory consumption was 37.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 235.12 ms. Allocated memory is still 201.3 MB. Free memory was 134.6 MB in the beginning and 125.8 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2384.45 ms. Allocated memory was 201.3 MB in the beginning and 263.7 MB in the end (delta: 62.4 MB). Free memory was 125.8 MB in the beginning and 158.8 MB in the end (delta: -33.0 MB). Peak memory consumption was 85.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 51525.75 ms. Allocated memory was 263.7 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 158.8 MB in the beginning and 792.4 MB in the end (delta: -633.7 MB). Peak memory consumption was 879.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 729]: 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 115 procedures, 799 locations, 1 error locations. SAFE Result, 51.4s OverallTime, 19 OverallIterations, 3 TraceHistogramMax, 27.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 16655 SDtfs, 11461 SDslu, 108223 SDs, 0 SdLazy, 18170 SolverSat, 2003 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1059 GetRequests, 776 SyntacticMatches, 2 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1177 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73691occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 2.0995670995670994 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 13.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 3360 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 4205 NumberOfCodeBlocks, 4186 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 4415 ConstructedInterpolants, 0 QuantifiedInterpolants, 1294758 SizeOfPredicates, 3 NumberOfNonLiveVariables, 2834 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 21 InterpolantComputations, 19 PerfectInterpolantSequences, 817/822 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...