java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/product-lines/email_spec6_product16.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:41:53,707 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:41:53,710 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:41:53,722 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:41:53,722 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:41:53,724 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:41:53,725 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:41:53,727 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:41:53,729 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:41:53,730 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:41:53,731 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:41:53,732 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:41:53,732 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:41:53,733 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:41:53,734 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:41:53,735 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:41:53,736 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:41:53,737 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:41:53,738 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:41:53,740 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:41:53,742 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:41:53,743 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:41:53,744 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:41:53,744 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:41:53,746 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:41:53,746 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:41:53,747 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:41:53,751 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:41:53,752 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:41:53,753 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:41:53,753 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:41:53,754 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:41:53,756 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:41:53,757 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:41:53,759 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:41:53,759 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:41:53,760 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:41:53,760 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:41:53,760 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:41:53,764 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:41:53,765 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:41:53,766 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:41:53,792 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:41:53,793 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:41:53,793 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:41:53,794 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:41:53,795 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:41:53,795 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:41:53,795 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:41:53,795 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:41:53,795 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:41:53,796 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:41:53,798 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:41:53,798 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:41:53,798 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:41:53,798 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:41:53,799 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:41:53,799 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:41:53,799 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:41:53,799 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:41:53,799 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:41:53,800 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:41:53,800 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:41:53,800 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:41:53,801 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:41:53,801 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:41:53,801 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:41:53,801 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:41:53,801 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:41:53,802 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:41:53,802 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:41:53,802 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:41:53,832 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:41:53,844 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:41:53,848 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:41:53,850 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:41:53,850 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:41:53,853 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec6_product16.cil.c [2019-09-10 02:41:53,911 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/615f4248e/35806b604d0d4f8299ef0d3257968758/FLAG1be042a5b [2019-09-10 02:41:54,547 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:41:54,548 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec6_product16.cil.c [2019-09-10 02:41:54,568 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/615f4248e/35806b604d0d4f8299ef0d3257968758/FLAG1be042a5b [2019-09-10 02:41:54,788 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/615f4248e/35806b604d0d4f8299ef0d3257968758 [2019-09-10 02:41:54,797 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:41:54,799 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:41:54,800 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:41:54,800 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:41:54,804 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:41:54,805 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:41:54" (1/1) ... [2019-09-10 02:41:54,808 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d699f66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:41:54, skipping insertion in model container [2019-09-10 02:41:54,808 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:41:54" (1/1) ... [2019-09-10 02:41:54,817 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:41:54,910 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:41:55,702 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:41:55,731 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:41:55,912 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:41:56,059 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:41:56,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:41:56 WrapperNode [2019-09-10 02:41:56,060 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:41:56,061 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:41:56,061 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:41:56,062 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:41:56,080 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:41:56" (1/1) ... [2019-09-10 02:41:56,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:41:56" (1/1) ... [2019-09-10 02:41:56,148 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:41:56" (1/1) ... [2019-09-10 02:41:56,149 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:41:56" (1/1) ... [2019-09-10 02:41:56,236 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:41:56" (1/1) ... [2019-09-10 02:41:56,270 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:41:56" (1/1) ... [2019-09-10 02:41:56,290 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:41:56" (1/1) ... [2019-09-10 02:41:56,313 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:41:56,313 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:41:56,313 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:41:56,314 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:41:56,315 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:41:56" (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:41:56,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:41:56,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:41:56,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-10 02:41:56,389 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-10 02:41:56,390 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-10 02:41:56,390 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-10 02:41:56,390 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-10 02:41:56,390 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-10 02:41:56,390 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-10 02:41:56,391 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-10 02:41:56,391 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-10 02:41:56,392 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-10 02:41:56,392 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:41:56,393 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-10 02:41:56,393 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-10 02:41:56,394 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-10 02:41:56,394 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-10 02:41:56,394 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-10 02:41:56,394 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-10 02:41:56,395 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-10 02:41:56,395 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-10 02:41:56,395 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-10 02:41:56,395 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-09-10 02:41:56,396 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-10 02:41:56,397 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-10 02:41:56,397 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-10 02:41:56,397 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-10 02:41:56,397 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-10 02:41:56,398 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-10 02:41:56,398 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-10 02:41:56,399 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-10 02:41:56,399 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-10 02:41:56,399 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-10 02:41:56,399 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-10 02:41:56,400 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-10 02:41:56,400 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-10 02:41:56,400 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-10 02:41:56,400 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-10 02:41:56,400 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-10 02:41:56,401 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-10 02:41:56,401 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-10 02:41:56,401 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-10 02:41:56,401 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-10 02:41:56,401 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-10 02:41:56,402 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-10 02:41:56,402 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-10 02:41:56,402 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-10 02:41:56,403 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-10 02:41:56,403 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-10 02:41:56,403 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-10 02:41:56,403 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-10 02:41:56,403 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-10 02:41:56,404 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-10 02:41:56,404 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-10 02:41:56,404 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-10 02:41:56,404 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-10 02:41:56,404 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-10 02:41:56,405 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-10 02:41:56,405 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-10 02:41:56,405 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-10 02:41:56,405 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-10 02:41:56,405 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-10 02:41:56,406 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-10 02:41:56,406 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-10 02:41:56,406 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-10 02:41:56,406 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-10 02:41:56,407 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-10 02:41:56,407 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-10 02:41:56,407 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-10 02:41:56,407 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-10 02:41:56,407 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-10 02:41:56,407 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-10 02:41:56,408 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-10 02:41:56,408 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-10 02:41:56,409 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-10 02:41:56,409 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-10 02:41:56,409 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-10 02:41:56,409 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-10 02:41:56,409 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-10 02:41:56,410 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-10 02:41:56,410 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-10 02:41:56,410 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-10 02:41:56,410 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-10 02:41:56,411 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-10 02:41:56,411 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-10 02:41:56,412 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-10 02:41:56,412 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-10 02:41:56,412 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-10 02:41:56,412 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-10 02:41:56,413 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-10 02:41:56,413 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-10 02:41:56,413 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-10 02:41:56,413 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptDecrypt_spec__1 [2019-09-10 02:41:56,413 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptDecrypt_spec__2 [2019-09-10 02:41:56,413 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-10 02:41:56,414 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-10 02:41:56,414 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-10 02:41:56,414 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-10 02:41:56,414 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-09-10 02:41:56,414 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-09-10 02:41:56,414 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-10 02:41:56,414 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-10 02:41:56,415 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-10 02:41:56,415 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-10 02:41:56,415 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-10 02:41:56,415 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-10 02:41:56,415 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-10 02:41:56,415 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-10 02:41:56,416 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-10 02:41:56,416 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-09-10 02:41:56,416 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:41:56,416 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:41:56,416 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-10 02:41:56,416 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-10 02:41:56,417 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-10 02:41:56,417 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-10 02:41:56,418 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-10 02:41:56,418 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-10 02:41:56,418 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-10 02:41:56,419 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-10 02:41:56,419 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-10 02:41:56,419 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-10 02:41:56,419 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-10 02:41:56,421 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-10 02:41:56,421 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-10 02:41:56,421 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-10 02:41:56,421 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-10 02:41:56,421 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-10 02:41:56,421 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-10 02:41:56,421 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-10 02:41:56,422 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-10 02:41:56,422 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-10 02:41:56,422 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-10 02:41:56,422 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-10 02:41:56,423 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-10 02:41:56,423 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-10 02:41:56,423 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-10 02:41:56,423 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-10 02:41:56,424 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:41:56,427 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-10 02:41:56,428 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-10 02:41:56,428 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-10 02:41:56,429 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-10 02:41:56,435 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-10 02:41:56,435 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-10 02:41:56,436 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-10 02:41:56,436 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-10 02:41:56,436 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-10 02:41:56,437 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-09-10 02:41:56,437 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-10 02:41:56,437 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-10 02:41:56,437 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-10 02:41:56,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 02:41:56,438 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-10 02:41:56,438 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-10 02:41:56,438 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-10 02:41:56,438 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-10 02:41:56,438 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-10 02:41:56,438 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-10 02:41:56,438 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-10 02:41:56,439 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-10 02:41:56,439 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-10 02:41:56,439 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-10 02:41:56,439 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-10 02:41:56,439 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-10 02:41:56,439 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-10 02:41:56,439 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-10 02:41:56,440 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-10 02:41:56,440 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-10 02:41:56,440 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-10 02:41:56,440 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-10 02:41:56,440 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-10 02:41:56,440 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-10 02:41:56,440 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-10 02:41:56,440 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-10 02:41:56,441 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-10 02:41:56,441 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-10 02:41:56,441 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-10 02:41:56,441 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-10 02:41:56,441 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-10 02:41:56,441 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-10 02:41:56,441 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-10 02:41:56,441 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-10 02:41:56,442 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-10 02:41:56,442 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-10 02:41:56,442 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-10 02:41:56,442 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-10 02:41:56,442 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-10 02:41:56,442 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-10 02:41:56,442 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-10 02:41:56,443 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-10 02:41:56,443 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-10 02:41:56,443 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-10 02:41:56,443 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-10 02:41:56,443 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-10 02:41:56,443 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-10 02:41:56,443 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-10 02:41:56,443 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-10 02:41:56,444 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-10 02:41:56,444 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-10 02:41:56,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-10 02:41:56,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-10 02:41:56,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 02:41:56,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-10 02:41:56,444 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-10 02:41:56,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 02:41:56,445 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-10 02:41:56,445 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-10 02:41:56,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 02:41:56,445 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-10 02:41:56,445 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-10 02:41:56,445 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-10 02:41:56,445 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-10 02:41:56,446 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-10 02:41:56,446 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-10 02:41:56,446 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-10 02:41:56,446 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-10 02:41:56,446 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-10 02:41:56,446 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-10 02:41:56,446 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-10 02:41:56,446 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-10 02:41:56,447 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptDecrypt_spec__1 [2019-09-10 02:41:56,447 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptDecrypt_spec__2 [2019-09-10 02:41:56,447 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-10 02:41:56,447 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-10 02:41:56,447 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-10 02:41:56,447 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-10 02:41:56,447 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-10 02:41:56,448 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-09-10 02:41:56,448 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-10 02:41:56,448 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-09-10 02:41:56,448 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-09-10 02:41:56,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:41:56,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-10 02:41:56,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:41:58,526 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:41:58,527 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-10 02:41:58,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:41:58 BoogieIcfgContainer [2019-09-10 02:41:58,529 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:41:58,530 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:41:58,531 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:41:58,534 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:41:58,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:41:54" (1/3) ... [2019-09-10 02:41:58,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dbd7b02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:41:58, skipping insertion in model container [2019-09-10 02:41:58,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:41:56" (2/3) ... [2019-09-10 02:41:58,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dbd7b02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:41:58, skipping insertion in model container [2019-09-10 02:41:58,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:41:58" (3/3) ... [2019-09-10 02:41:58,540 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec6_product16.cil.c [2019-09-10 02:41:58,552 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:41:58,565 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:41:58,583 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:41:58,616 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:41:58,616 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:41:58,616 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:41:58,616 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:41:58,616 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:41:58,617 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:41:58,617 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:41:58,617 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:41:58,644 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states. [2019-09-10 02:41:58,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 02:41:58,672 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:41:58,674 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:41:58,677 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:41:58,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:41:58,683 INFO L82 PathProgramCache]: Analyzing trace with hash -610566367, now seen corresponding path program 1 times [2019-09-10 02:41:58,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:41:58,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:41:58,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:41:58,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:41:58,740 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:41:59,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:41:59,455 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-10 02:41:59,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:41:59,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-10 02:41:59,461 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:41:59,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:41:59,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:41:59,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:41:59,485 INFO L87 Difference]: Start difference. First operand 484 states. Second operand 2 states. [2019-09-10 02:41:59,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:41:59,557 INFO L93 Difference]: Finished difference Result 470 states and 622 transitions. [2019-09-10 02:41:59,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:41:59,559 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 176 [2019-09-10 02:41:59,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:41:59,597 INFO L225 Difference]: With dead ends: 470 [2019-09-10 02:41:59,597 INFO L226 Difference]: Without dead ends: 461 [2019-09-10 02:41:59,600 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:41:59,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2019-09-10 02:41:59,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 461. [2019-09-10 02:41:59,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2019-09-10 02:41:59,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 611 transitions. [2019-09-10 02:41:59,691 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 611 transitions. Word has length 176 [2019-09-10 02:41:59,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:41:59,694 INFO L475 AbstractCegarLoop]: Abstraction has 461 states and 611 transitions. [2019-09-10 02:41:59,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:41:59,694 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 611 transitions. [2019-09-10 02:41:59,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-10 02:41:59,701 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:41:59,701 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:41:59,702 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:41:59,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:41:59,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1997838255, now seen corresponding path program 1 times [2019-09-10 02:41:59,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:41:59,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:41:59,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:41:59,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:41:59,704 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:41:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:41:59,906 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-10 02:41:59,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:41:59,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:41:59,907 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:41:59,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:41:59,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:41:59,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:41:59,915 INFO L87 Difference]: Start difference. First operand 461 states and 611 transitions. Second operand 3 states. [2019-09-10 02:41:59,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:41:59,977 INFO L93 Difference]: Finished difference Result 464 states and 614 transitions. [2019-09-10 02:41:59,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:41:59,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2019-09-10 02:41:59,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:41:59,984 INFO L225 Difference]: With dead ends: 464 [2019-09-10 02:41:59,984 INFO L226 Difference]: Without dead ends: 464 [2019-09-10 02:41:59,985 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:41:59,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-09-10 02:42:00,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 463. [2019-09-10 02:42:00,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-09-10 02:42:00,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 613 transitions. [2019-09-10 02:42:00,048 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 613 transitions. Word has length 177 [2019-09-10 02:42:00,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:42:00,049 INFO L475 AbstractCegarLoop]: Abstraction has 463 states and 613 transitions. [2019-09-10 02:42:00,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:42:00,049 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 613 transitions. [2019-09-10 02:42:00,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 02:42:00,056 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:42:00,057 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:42:00,057 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:42:00,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:42:00,058 INFO L82 PathProgramCache]: Analyzing trace with hash 47308899, now seen corresponding path program 1 times [2019-09-10 02:42:00,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:42:00,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:00,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:42:00,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:00,060 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:42:00,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:42:00,366 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-10 02:42:00,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:42:00,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:42:00,367 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:42:00,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:42:00,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:42:00,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:42:00,373 INFO L87 Difference]: Start difference. First operand 463 states and 613 transitions. Second operand 3 states. [2019-09-10 02:42:00,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:42:00,407 INFO L93 Difference]: Finished difference Result 504 states and 683 transitions. [2019-09-10 02:42:00,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:42:00,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-09-10 02:42:00,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:42:00,412 INFO L225 Difference]: With dead ends: 504 [2019-09-10 02:42:00,412 INFO L226 Difference]: Without dead ends: 504 [2019-09-10 02:42:00,413 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:42:00,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-09-10 02:42:00,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 503. [2019-09-10 02:42:00,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2019-09-10 02:42:00,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 682 transitions. [2019-09-10 02:42:00,432 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 682 transitions. Word has length 183 [2019-09-10 02:42:00,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:42:00,433 INFO L475 AbstractCegarLoop]: Abstraction has 503 states and 682 transitions. [2019-09-10 02:42:00,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:42:00,434 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 682 transitions. [2019-09-10 02:42:00,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 02:42:00,439 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:42:00,439 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:42:00,440 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:42:00,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:42:00,440 INFO L82 PathProgramCache]: Analyzing trace with hash 142664055, now seen corresponding path program 1 times [2019-09-10 02:42:00,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:42:00,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:00,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:42:00,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:00,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:42:00,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:42:00,859 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-10 02:42:00,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:42:00,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 02:42:00,860 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:42:00,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 02:42:00,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 02:42:00,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:42:00,862 INFO L87 Difference]: Start difference. First operand 503 states and 682 transitions. Second operand 11 states. [2019-09-10 02:42:05,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:42:05,475 INFO L93 Difference]: Finished difference Result 2054 states and 2719 transitions. [2019-09-10 02:42:05,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 02:42:05,475 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 184 [2019-09-10 02:42:05,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:42:05,492 INFO L225 Difference]: With dead ends: 2054 [2019-09-10 02:42:05,493 INFO L226 Difference]: Without dead ends: 1788 [2019-09-10 02:42:05,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-09-10 02:42:05,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1788 states. [2019-09-10 02:42:05,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1788 to 1773. [2019-09-10 02:42:05,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1773 states. [2019-09-10 02:42:05,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2323 transitions. [2019-09-10 02:42:05,611 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2323 transitions. Word has length 184 [2019-09-10 02:42:05,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:42:05,611 INFO L475 AbstractCegarLoop]: Abstraction has 1773 states and 2323 transitions. [2019-09-10 02:42:05,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 02:42:05,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2323 transitions. [2019-09-10 02:42:05,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-10 02:42:05,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:42:05,616 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:42:05,616 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:42:05,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:42:05,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1260234417, now seen corresponding path program 1 times [2019-09-10 02:42:05,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:42:05,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:05,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:42:05,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:05,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:42:05,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:42:05,964 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-10 02:42:05,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:42:05,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 02:42:05,965 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:42:05,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 02:42:05,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 02:42:05,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:42:05,967 INFO L87 Difference]: Start difference. First operand 1773 states and 2323 transitions. Second operand 16 states. [2019-09-10 02:42:06,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:42:06,348 INFO L93 Difference]: Finished difference Result 1731 states and 2265 transitions. [2019-09-10 02:42:06,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 02:42:06,349 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 185 [2019-09-10 02:42:06,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:42:06,361 INFO L225 Difference]: With dead ends: 1731 [2019-09-10 02:42:06,361 INFO L226 Difference]: Without dead ends: 1440 [2019-09-10 02:42:06,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-09-10 02:42:06,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2019-09-10 02:42:06,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 1393. [2019-09-10 02:42:06,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1393 states. [2019-09-10 02:42:06,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1393 states and 1820 transitions. [2019-09-10 02:42:06,422 INFO L78 Accepts]: Start accepts. Automaton has 1393 states and 1820 transitions. Word has length 185 [2019-09-10 02:42:06,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:42:06,425 INFO L475 AbstractCegarLoop]: Abstraction has 1393 states and 1820 transitions. [2019-09-10 02:42:06,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 02:42:06,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 1820 transitions. [2019-09-10 02:42:06,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-10 02:42:06,429 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:42:06,430 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:42:06,430 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:42:06,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:42:06,430 INFO L82 PathProgramCache]: Analyzing trace with hash 2110369116, now seen corresponding path program 1 times [2019-09-10 02:42:06,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:42:06,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:06,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:42:06,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:06,435 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:42:06,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:42:06,689 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-10 02:42:06,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:42:06,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:42:06,689 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:42:06,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:42:06,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:42:06,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:42:06,691 INFO L87 Difference]: Start difference. First operand 1393 states and 1820 transitions. Second operand 6 states. [2019-09-10 02:42:07,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:42:07,218 INFO L93 Difference]: Finished difference Result 2777 states and 3640 transitions. [2019-09-10 02:42:07,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:42:07,219 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 194 [2019-09-10 02:42:07,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:42:07,236 INFO L225 Difference]: With dead ends: 2777 [2019-09-10 02:42:07,236 INFO L226 Difference]: Without dead ends: 2777 [2019-09-10 02:42:07,237 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:42:07,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2777 states. [2019-09-10 02:42:07,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2777 to 2706. [2019-09-10 02:42:07,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2706 states. [2019-09-10 02:42:07,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 3557 transitions. [2019-09-10 02:42:07,326 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 3557 transitions. Word has length 194 [2019-09-10 02:42:07,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:42:07,327 INFO L475 AbstractCegarLoop]: Abstraction has 2706 states and 3557 transitions. [2019-09-10 02:42:07,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:42:07,327 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 3557 transitions. [2019-09-10 02:42:07,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-10 02:42:07,333 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:42:07,334 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:42:07,334 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:42:07,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:42:07,335 INFO L82 PathProgramCache]: Analyzing trace with hash 589326950, now seen corresponding path program 1 times [2019-09-10 02:42:07,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:42:07,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:07,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:42:07,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:07,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:42:07,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:42:07,487 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-10 02:42:07,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:42:07,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:42:07,488 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:42:07,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:42:07,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:42:07,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:42:07,489 INFO L87 Difference]: Start difference. First operand 2706 states and 3557 transitions. Second operand 5 states. [2019-09-10 02:42:08,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:42:08,757 INFO L93 Difference]: Finished difference Result 7570 states and 9873 transitions. [2019-09-10 02:42:08,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:42:08,758 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2019-09-10 02:42:08,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:42:08,811 INFO L225 Difference]: With dead ends: 7570 [2019-09-10 02:42:08,811 INFO L226 Difference]: Without dead ends: 7570 [2019-09-10 02:42:08,811 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:42:08,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7570 states. [2019-09-10 02:42:09,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7570 to 7434. [2019-09-10 02:42:09,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7434 states. [2019-09-10 02:42:09,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7434 states to 7434 states and 9721 transitions. [2019-09-10 02:42:09,074 INFO L78 Accepts]: Start accepts. Automaton has 7434 states and 9721 transitions. Word has length 195 [2019-09-10 02:42:09,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:42:09,075 INFO L475 AbstractCegarLoop]: Abstraction has 7434 states and 9721 transitions. [2019-09-10 02:42:09,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:42:09,075 INFO L276 IsEmpty]: Start isEmpty. Operand 7434 states and 9721 transitions. [2019-09-10 02:42:09,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-10 02:42:09,084 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:42:09,084 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:42:09,084 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:42:09,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:42:09,085 INFO L82 PathProgramCache]: Analyzing trace with hash 2550831, now seen corresponding path program 1 times [2019-09-10 02:42:09,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:42:09,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:09,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:42:09,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:09,086 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:42:09,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:42:09,405 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-10 02:42:09,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:42:09,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 02:42:09,406 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:42:09,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:42:09,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:42:09,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:42:09,408 INFO L87 Difference]: Start difference. First operand 7434 states and 9721 transitions. Second operand 9 states. [2019-09-10 02:42:09,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:42:09,755 INFO L93 Difference]: Finished difference Result 7006 states and 9121 transitions. [2019-09-10 02:42:09,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:42:09,756 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 195 [2019-09-10 02:42:09,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:42:09,796 INFO L225 Difference]: With dead ends: 7006 [2019-09-10 02:42:09,796 INFO L226 Difference]: Without dead ends: 6302 [2019-09-10 02:42:09,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-09-10 02:42:09,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6302 states. [2019-09-10 02:42:09,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6302 to 6112. [2019-09-10 02:42:09,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6112 states. [2019-09-10 02:42:09,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6112 states to 6112 states and 8005 transitions. [2019-09-10 02:42:09,998 INFO L78 Accepts]: Start accepts. Automaton has 6112 states and 8005 transitions. Word has length 195 [2019-09-10 02:42:09,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:42:09,999 INFO L475 AbstractCegarLoop]: Abstraction has 6112 states and 8005 transitions. [2019-09-10 02:42:09,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:42:09,999 INFO L276 IsEmpty]: Start isEmpty. Operand 6112 states and 8005 transitions. [2019-09-10 02:42:10,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-09-10 02:42:10,012 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:42:10,013 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:10,013 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:42:10,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:42:10,013 INFO L82 PathProgramCache]: Analyzing trace with hash -2087107406, now seen corresponding path program 1 times [2019-09-10 02:42:10,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:42:10,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:10,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:42:10,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:10,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:42:10,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:42:10,189 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-10 02:42:10,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:42:10,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:42:10,190 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:42:10,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:42:10,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:42:10,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:42:10,192 INFO L87 Difference]: Start difference. First operand 6112 states and 8005 transitions. Second operand 3 states. [2019-09-10 02:42:10,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:42:10,228 INFO L93 Difference]: Finished difference Result 6440 states and 8606 transitions. [2019-09-10 02:42:10,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:42:10,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2019-09-10 02:42:10,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:42:10,268 INFO L225 Difference]: With dead ends: 6440 [2019-09-10 02:42:10,268 INFO L226 Difference]: Without dead ends: 6440 [2019-09-10 02:42:10,269 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:42:10,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6440 states. [2019-09-10 02:42:10,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6440 to 6436. [2019-09-10 02:42:10,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6436 states. [2019-09-10 02:42:10,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6436 states to 6436 states and 8602 transitions. [2019-09-10 02:42:10,470 INFO L78 Accepts]: Start accepts. Automaton has 6436 states and 8602 transitions. Word has length 224 [2019-09-10 02:42:10,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:42:10,471 INFO L475 AbstractCegarLoop]: Abstraction has 6436 states and 8602 transitions. [2019-09-10 02:42:10,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:42:10,471 INFO L276 IsEmpty]: Start isEmpty. Operand 6436 states and 8602 transitions. [2019-09-10 02:42:10,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 02:42:10,485 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:42:10,485 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:10,485 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:42:10,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:42:10,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1404923970, now seen corresponding path program 1 times [2019-09-10 02:42:10,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:42:10,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:10,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:42:10,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:10,487 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:42:10,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:42:10,791 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-10 02:42:10,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:42:10,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:42:10,792 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:42:10,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:42:10,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:42:10,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:42:10,795 INFO L87 Difference]: Start difference. First operand 6436 states and 8602 transitions. Second operand 3 states. [2019-09-10 02:42:10,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:42:10,842 INFO L93 Difference]: Finished difference Result 7048 states and 9728 transitions. [2019-09-10 02:42:10,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:42:10,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2019-09-10 02:42:10,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:42:10,909 INFO L225 Difference]: With dead ends: 7048 [2019-09-10 02:42:10,909 INFO L226 Difference]: Without dead ends: 7048 [2019-09-10 02:42:10,910 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:42:10,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7048 states. [2019-09-10 02:42:11,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7048 to 7044. [2019-09-10 02:42:11,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7044 states. [2019-09-10 02:42:11,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7044 states to 7044 states and 9724 transitions. [2019-09-10 02:42:11,160 INFO L78 Accepts]: Start accepts. Automaton has 7044 states and 9724 transitions. Word has length 225 [2019-09-10 02:42:11,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:42:11,161 INFO L475 AbstractCegarLoop]: Abstraction has 7044 states and 9724 transitions. [2019-09-10 02:42:11,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:42:11,161 INFO L276 IsEmpty]: Start isEmpty. Operand 7044 states and 9724 transitions. [2019-09-10 02:42:11,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-09-10 02:42:11,181 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:42:11,181 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:11,182 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:42:11,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:42:11,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1431230704, now seen corresponding path program 1 times [2019-09-10 02:42:11,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:42:11,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:11,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:42:11,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:11,185 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:42:11,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:42:11,423 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-10 02:42:11,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:42:11,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 02:42:11,424 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:42:11,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:42:11,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:42:11,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:42:11,425 INFO L87 Difference]: Start difference. First operand 7044 states and 9724 transitions. Second operand 8 states. [2019-09-10 02:42:15,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:42:15,612 INFO L93 Difference]: Finished difference Result 14519 states and 21167 transitions. [2019-09-10 02:42:15,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 02:42:15,613 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 226 [2019-09-10 02:42:15,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:42:15,696 INFO L225 Difference]: With dead ends: 14519 [2019-09-10 02:42:15,696 INFO L226 Difference]: Without dead ends: 14519 [2019-09-10 02:42:15,697 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-10 02:42:15,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14519 states. [2019-09-10 02:42:16,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14519 to 9228. [2019-09-10 02:42:16,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9228 states. [2019-09-10 02:42:16,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9228 states to 9228 states and 14128 transitions. [2019-09-10 02:42:16,065 INFO L78 Accepts]: Start accepts. Automaton has 9228 states and 14128 transitions. Word has length 226 [2019-09-10 02:42:16,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:42:16,066 INFO L475 AbstractCegarLoop]: Abstraction has 9228 states and 14128 transitions. [2019-09-10 02:42:16,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:42:16,067 INFO L276 IsEmpty]: Start isEmpty. Operand 9228 states and 14128 transitions. [2019-09-10 02:42:16,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-09-10 02:42:16,107 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:42:16,107 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:42:16,108 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:42:16,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:42:16,108 INFO L82 PathProgramCache]: Analyzing trace with hash -567939663, now seen corresponding path program 1 times [2019-09-10 02:42:16,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:42:16,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:16,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:42:16,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:16,110 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:42:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:42:16,336 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:42:16,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:42:16,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 02:42:16,336 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:42:16,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:42:16,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:42:16,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:42:16,339 INFO L87 Difference]: Start difference. First operand 9228 states and 14128 transitions. Second operand 8 states. [2019-09-10 02:42:20,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:42:20,519 INFO L93 Difference]: Finished difference Result 19423 states and 31879 transitions. [2019-09-10 02:42:20,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 02:42:20,520 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 233 [2019-09-10 02:42:20,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:42:20,651 INFO L225 Difference]: With dead ends: 19423 [2019-09-10 02:42:20,651 INFO L226 Difference]: Without dead ends: 19423 [2019-09-10 02:42:20,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-10 02:42:20,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19423 states. [2019-09-10 02:42:21,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19423 to 13716. [2019-09-10 02:42:21,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13716 states. [2019-09-10 02:42:21,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13716 states to 13716 states and 23776 transitions. [2019-09-10 02:42:21,378 INFO L78 Accepts]: Start accepts. Automaton has 13716 states and 23776 transitions. Word has length 233 [2019-09-10 02:42:21,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:42:21,378 INFO L475 AbstractCegarLoop]: Abstraction has 13716 states and 23776 transitions. [2019-09-10 02:42:21,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:42:21,378 INFO L276 IsEmpty]: Start isEmpty. Operand 13716 states and 23776 transitions. [2019-09-10 02:42:21,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-09-10 02:42:21,469 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:42:21,469 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:42:21,469 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:42:21,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:42:21,470 INFO L82 PathProgramCache]: Analyzing trace with hash 2060178440, now seen corresponding path program 1 times [2019-09-10 02:42:21,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:42:21,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:21,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:42:21,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:21,472 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:42:21,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:42:21,674 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:42:21,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:42:21,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 02:42:21,675 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:42:21,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:42:21,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:42:21,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:42:21,676 INFO L87 Difference]: Start difference. First operand 13716 states and 23776 transitions. Second operand 8 states. [2019-09-10 02:42:25,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:42:25,775 INFO L93 Difference]: Finished difference Result 29383 states and 54939 transitions. [2019-09-10 02:42:25,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 02:42:25,775 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 234 [2019-09-10 02:42:25,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:42:25,963 INFO L225 Difference]: With dead ends: 29383 [2019-09-10 02:42:25,963 INFO L226 Difference]: Without dead ends: 29383 [2019-09-10 02:42:25,964 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-10 02:42:25,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29383 states. [2019-09-10 02:42:27,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29383 to 22820. [2019-09-10 02:42:27,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22820 states. [2019-09-10 02:42:27,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22820 states to 22820 states and 44612 transitions. [2019-09-10 02:42:27,805 INFO L78 Accepts]: Start accepts. Automaton has 22820 states and 44612 transitions. Word has length 234 [2019-09-10 02:42:27,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:42:27,806 INFO L475 AbstractCegarLoop]: Abstraction has 22820 states and 44612 transitions. [2019-09-10 02:42:27,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:42:27,806 INFO L276 IsEmpty]: Start isEmpty. Operand 22820 states and 44612 transitions. [2019-09-10 02:42:27,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-09-10 02:42:27,909 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:42:27,910 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:27,910 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:42:27,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:42:27,911 INFO L82 PathProgramCache]: Analyzing trace with hash -701709576, now seen corresponding path program 1 times [2019-09-10 02:42:27,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:42:27,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:27,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:42:27,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:27,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:42:27,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:42:28,037 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-10 02:42:28,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:42:28,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:42:28,038 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:42:28,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:42:28,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:42:28,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:42:28,039 INFO L87 Difference]: Start difference. First operand 22820 states and 44612 transitions. Second operand 3 states. [2019-09-10 02:42:28,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:42:28,219 INFO L93 Difference]: Finished difference Result 32168 states and 67528 transitions. [2019-09-10 02:42:28,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:42:28,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-09-10 02:42:28,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:42:28,417 INFO L225 Difference]: With dead ends: 32168 [2019-09-10 02:42:28,417 INFO L226 Difference]: Without dead ends: 32168 [2019-09-10 02:42:28,418 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:42:28,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32168 states. [2019-09-10 02:42:29,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32168 to 32164. [2019-09-10 02:42:29,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32164 states. [2019-09-10 02:42:29,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32164 states to 32164 states and 67524 transitions. [2019-09-10 02:42:29,816 INFO L78 Accepts]: Start accepts. Automaton has 32164 states and 67524 transitions. Word has length 233 [2019-09-10 02:42:29,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:42:29,816 INFO L475 AbstractCegarLoop]: Abstraction has 32164 states and 67524 transitions. [2019-09-10 02:42:29,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:42:29,816 INFO L276 IsEmpty]: Start isEmpty. Operand 32164 states and 67524 transitions. [2019-09-10 02:42:29,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-10 02:42:29,940 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:42:29,940 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:42:29,940 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:42:29,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:42:29,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1281939217, now seen corresponding path program 1 times [2019-09-10 02:42:29,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:42:29,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:29,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:42:29,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:29,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:42:29,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:42:30,133 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:42:30,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:42:30,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 02:42:30,134 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:42:30,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 02:42:30,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 02:42:30,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:42:30,136 INFO L87 Difference]: Start difference. First operand 32164 states and 67524 transitions. Second operand 11 states. [2019-09-10 02:42:32,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:42:32,123 INFO L93 Difference]: Finished difference Result 36810 states and 73541 transitions. [2019-09-10 02:42:32,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 02:42:32,124 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 238 [2019-09-10 02:42:32,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:42:32,326 INFO L225 Difference]: With dead ends: 36810 [2019-09-10 02:42:32,326 INFO L226 Difference]: Without dead ends: 36806 [2019-09-10 02:42:32,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2019-09-10 02:42:32,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36806 states. [2019-09-10 02:42:33,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36806 to 36524. [2019-09-10 02:42:33,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36524 states. [2019-09-10 02:42:33,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36524 states to 36524 states and 73191 transitions. [2019-09-10 02:42:33,724 INFO L78 Accepts]: Start accepts. Automaton has 36524 states and 73191 transitions. Word has length 238 [2019-09-10 02:42:33,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:42:33,725 INFO L475 AbstractCegarLoop]: Abstraction has 36524 states and 73191 transitions. [2019-09-10 02:42:33,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 02:42:33,725 INFO L276 IsEmpty]: Start isEmpty. Operand 36524 states and 73191 transitions. [2019-09-10 02:42:33,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-09-10 02:42:33,833 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:42:33,833 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:33,833 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:42:33,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:42:33,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1874639360, now seen corresponding path program 1 times [2019-09-10 02:42:33,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:42:33,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:33,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:42:33,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:33,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:42:33,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:42:33,991 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-10 02:42:33,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:42:33,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:42:33,994 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:42:33,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:42:33,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:42:33,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:42:33,995 INFO L87 Difference]: Start difference. First operand 36524 states and 73191 transitions. Second operand 6 states. [2019-09-10 02:42:34,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:42:34,572 INFO L93 Difference]: Finished difference Result 36656 states and 72769 transitions. [2019-09-10 02:42:34,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:42:34,572 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 233 [2019-09-10 02:42:34,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:42:34,747 INFO L225 Difference]: With dead ends: 36656 [2019-09-10 02:42:34,747 INFO L226 Difference]: Without dead ends: 36656 [2019-09-10 02:42:34,747 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:42:34,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36656 states. [2019-09-10 02:42:35,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36656 to 36656. [2019-09-10 02:42:35,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36656 states. [2019-09-10 02:42:36,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36656 states to 36656 states and 72769 transitions. [2019-09-10 02:42:36,067 INFO L78 Accepts]: Start accepts. Automaton has 36656 states and 72769 transitions. Word has length 233 [2019-09-10 02:42:36,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:42:36,067 INFO L475 AbstractCegarLoop]: Abstraction has 36656 states and 72769 transitions. [2019-09-10 02:42:36,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:42:36,068 INFO L276 IsEmpty]: Start isEmpty. Operand 36656 states and 72769 transitions. [2019-09-10 02:42:36,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-10 02:42:36,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:42:36,180 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:42:36,181 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:42:36,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:42:36,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1845742632, now seen corresponding path program 1 times [2019-09-10 02:42:36,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:42:36,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:36,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:42:36,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:36,183 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:42:36,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:42:36,346 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-09-10 02:42:36,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:42:36,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:42:36,347 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:42:36,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:42:36,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:42:36,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:42:36,349 INFO L87 Difference]: Start difference. First operand 36656 states and 72769 transitions. Second operand 6 states. [2019-09-10 02:42:37,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:42:37,088 INFO L93 Difference]: Finished difference Result 36668 states and 67853 transitions. [2019-09-10 02:42:37,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:42:37,088 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 253 [2019-09-10 02:42:37,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:42:37,214 INFO L225 Difference]: With dead ends: 36668 [2019-09-10 02:42:37,214 INFO L226 Difference]: Without dead ends: 36668 [2019-09-10 02:42:37,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:42:37,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36668 states. [2019-09-10 02:42:39,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36668 to 36668. [2019-09-10 02:42:39,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36668 states. [2019-09-10 02:42:39,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36668 states to 36668 states and 67853 transitions. [2019-09-10 02:42:39,381 INFO L78 Accepts]: Start accepts. Automaton has 36668 states and 67853 transitions. Word has length 253 [2019-09-10 02:42:39,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:42:39,382 INFO L475 AbstractCegarLoop]: Abstraction has 36668 states and 67853 transitions. [2019-09-10 02:42:39,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:42:39,382 INFO L276 IsEmpty]: Start isEmpty. Operand 36668 states and 67853 transitions. [2019-09-10 02:42:39,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 02:42:39,507 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:42:39,507 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:42:39,507 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:42:39,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:42:39,507 INFO L82 PathProgramCache]: Analyzing trace with hash -795246507, now seen corresponding path program 1 times [2019-09-10 02:42:39,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:42:39,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:39,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:42:39,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:39,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:42:39,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:42:39,885 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:42:39,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:42:39,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 02:42:39,886 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:42:39,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 02:42:39,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 02:42:39,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=414, Unknown=0, NotChecked=0, Total=462 [2019-09-10 02:42:39,887 INFO L87 Difference]: Start difference. First operand 36668 states and 67853 transitions. Second operand 22 states. [2019-09-10 02:42:56,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:42:56,959 INFO L93 Difference]: Finished difference Result 77703 states and 135007 transitions. [2019-09-10 02:42:56,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-10 02:42:56,960 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 240 [2019-09-10 02:42:56,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:42:57,244 INFO L225 Difference]: With dead ends: 77703 [2019-09-10 02:42:57,244 INFO L226 Difference]: Without dead ends: 77703 [2019-09-10 02:42:57,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1151 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=483, Invalid=4209, Unknown=0, NotChecked=0, Total=4692 [2019-09-10 02:42:57,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77703 states. [2019-09-10 02:42:58,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77703 to 75985. [2019-09-10 02:42:58,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75985 states. [2019-09-10 02:42:59,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75985 states to 75985 states and 132178 transitions. [2019-09-10 02:42:59,473 INFO L78 Accepts]: Start accepts. Automaton has 75985 states and 132178 transitions. Word has length 240 [2019-09-10 02:42:59,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:42:59,474 INFO L475 AbstractCegarLoop]: Abstraction has 75985 states and 132178 transitions. [2019-09-10 02:42:59,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 02:42:59,474 INFO L276 IsEmpty]: Start isEmpty. Operand 75985 states and 132178 transitions. [2019-09-10 02:42:59,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-10 02:42:59,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:42:59,632 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:42:59,633 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:42:59,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:42:59,634 INFO L82 PathProgramCache]: Analyzing trace with hash -937021308, now seen corresponding path program 1 times [2019-09-10 02:42:59,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:42:59,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:59,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:42:59,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:42:59,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:42:59,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:42:59,775 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:42:59,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:42:59,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:42:59,776 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:42:59,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:42:59,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:42:59,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:42:59,783 INFO L87 Difference]: Start difference. First operand 75985 states and 132178 transitions. Second operand 5 states. [2019-09-10 02:43:00,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:43:00,081 INFO L93 Difference]: Finished difference Result 66652 states and 119262 transitions. [2019-09-10 02:43:00,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:43:00,082 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 242 [2019-09-10 02:43:00,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:43:00,291 INFO L225 Difference]: With dead ends: 66652 [2019-09-10 02:43:00,292 INFO L226 Difference]: Without dead ends: 64845 [2019-09-10 02:43:00,292 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:43:00,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64845 states. [2019-09-10 02:43:03,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64845 to 63986. [2019-09-10 02:43:03,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63986 states. [2019-09-10 02:43:03,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63986 states to 63986 states and 115801 transitions. [2019-09-10 02:43:03,835 INFO L78 Accepts]: Start accepts. Automaton has 63986 states and 115801 transitions. Word has length 242 [2019-09-10 02:43:03,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:43:03,835 INFO L475 AbstractCegarLoop]: Abstraction has 63986 states and 115801 transitions. [2019-09-10 02:43:03,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:43:03,835 INFO L276 IsEmpty]: Start isEmpty. Operand 63986 states and 115801 transitions. [2019-09-10 02:43:03,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-10 02:43:03,990 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:43:03,990 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:03,990 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:43:03,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:43:03,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1198966986, now seen corresponding path program 1 times [2019-09-10 02:43:03,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:43:03,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:03,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:43:03,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:03,992 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:43:04,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:43:04,280 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-10 02:43:04,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:43:04,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 02:43:04,281 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:43:04,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 02:43:04,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 02:43:04,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-09-10 02:43:04,282 INFO L87 Difference]: Start difference. First operand 63986 states and 115801 transitions. Second operand 18 states. [2019-09-10 02:43:14,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:43:14,628 INFO L93 Difference]: Finished difference Result 65947 states and 118972 transitions. [2019-09-10 02:43:14,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-10 02:43:14,629 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 257 [2019-09-10 02:43:14,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:43:14,991 INFO L225 Difference]: With dead ends: 65947 [2019-09-10 02:43:14,991 INFO L226 Difference]: Without dead ends: 65947 [2019-09-10 02:43:14,992 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=312, Invalid=2138, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 02:43:15,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65947 states. [2019-09-10 02:43:18,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65947 to 64823. [2019-09-10 02:43:18,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64823 states. [2019-09-10 02:43:18,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64823 states to 64823 states and 117173 transitions. [2019-09-10 02:43:18,582 INFO L78 Accepts]: Start accepts. Automaton has 64823 states and 117173 transitions. Word has length 257 [2019-09-10 02:43:18,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:43:18,583 INFO L475 AbstractCegarLoop]: Abstraction has 64823 states and 117173 transitions. [2019-09-10 02:43:18,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 02:43:18,583 INFO L276 IsEmpty]: Start isEmpty. Operand 64823 states and 117173 transitions. [2019-09-10 02:43:18,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-10 02:43:18,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:43:18,754 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:18,754 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:43:18,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:43:18,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1715622411, now seen corresponding path program 1 times [2019-09-10 02:43:18,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:43:18,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:18,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:43:18,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:18,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:43:18,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:43:18,986 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-10 02:43:18,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:43:18,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 02:43:18,987 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:43:18,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 02:43:18,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 02:43:18,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-10 02:43:18,989 INFO L87 Difference]: Start difference. First operand 64823 states and 117173 transitions. Second operand 14 states. [2019-09-10 02:43:19,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:43:19,753 INFO L93 Difference]: Finished difference Result 64641 states and 116671 transitions. [2019-09-10 02:43:19,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 02:43:19,753 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 257 [2019-09-10 02:43:19,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:43:20,086 INFO L225 Difference]: With dead ends: 64641 [2019-09-10 02:43:20,086 INFO L226 Difference]: Without dead ends: 64239 [2019-09-10 02:43:20,087 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2019-09-10 02:43:20,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64239 states. [2019-09-10 02:43:22,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64239 to 62015. [2019-09-10 02:43:22,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62015 states. [2019-09-10 02:43:22,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62015 states to 62015 states and 113091 transitions. [2019-09-10 02:43:22,315 INFO L78 Accepts]: Start accepts. Automaton has 62015 states and 113091 transitions. Word has length 257 [2019-09-10 02:43:22,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:43:22,315 INFO L475 AbstractCegarLoop]: Abstraction has 62015 states and 113091 transitions. [2019-09-10 02:43:22,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 02:43:22,315 INFO L276 IsEmpty]: Start isEmpty. Operand 62015 states and 113091 transitions. [2019-09-10 02:43:22,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-09-10 02:43:22,477 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:43:22,477 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:22,477 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:43:22,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:43:22,478 INFO L82 PathProgramCache]: Analyzing trace with hash 195076822, now seen corresponding path program 1 times [2019-09-10 02:43:22,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:43:22,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:22,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:43:22,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:22,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:43:22,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:43:22,609 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-10 02:43:22,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:43:22,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:43:22,610 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:43:22,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:43:22,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:43:22,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:43:22,611 INFO L87 Difference]: Start difference. First operand 62015 states and 113091 transitions. Second operand 5 states. [2019-09-10 02:43:22,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:43:22,945 INFO L93 Difference]: Finished difference Result 62252 states and 113214 transitions. [2019-09-10 02:43:22,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:43:22,948 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 235 [2019-09-10 02:43:22,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:43:23,309 INFO L225 Difference]: With dead ends: 62252 [2019-09-10 02:43:23,309 INFO L226 Difference]: Without dead ends: 61704 [2019-09-10 02:43:23,310 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:43:23,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61704 states. [2019-09-10 02:43:26,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61704 to 61307. [2019-09-10 02:43:26,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61307 states. [2019-09-10 02:43:26,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61307 states to 61307 states and 111976 transitions. [2019-09-10 02:43:26,807 INFO L78 Accepts]: Start accepts. Automaton has 61307 states and 111976 transitions. Word has length 235 [2019-09-10 02:43:26,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:43:26,807 INFO L475 AbstractCegarLoop]: Abstraction has 61307 states and 111976 transitions. [2019-09-10 02:43:26,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:43:26,807 INFO L276 IsEmpty]: Start isEmpty. Operand 61307 states and 111976 transitions. [2019-09-10 02:43:26,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-10 02:43:26,964 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:43:26,964 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:26,964 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:43:26,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:43:26,965 INFO L82 PathProgramCache]: Analyzing trace with hash 203289917, now seen corresponding path program 1 times [2019-09-10 02:43:26,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:43:26,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:26,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:43:26,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:26,966 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:43:27,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:43:27,297 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-10 02:43:27,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:43:27,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 02:43:27,298 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:43:27,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 02:43:27,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 02:43:27,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-09-10 02:43:27,299 INFO L87 Difference]: Start difference. First operand 61307 states and 111976 transitions. Second operand 18 states. [2019-09-10 02:43:37,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:43:37,673 INFO L93 Difference]: Finished difference Result 62279 states and 113401 transitions. [2019-09-10 02:43:37,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-10 02:43:37,673 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 236 [2019-09-10 02:43:37,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:43:37,873 INFO L225 Difference]: With dead ends: 62279 [2019-09-10 02:43:37,873 INFO L226 Difference]: Without dead ends: 62279 [2019-09-10 02:43:37,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=312, Invalid=2138, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 02:43:37,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62279 states. [2019-09-10 02:43:39,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62279 to 61327. [2019-09-10 02:43:39,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61327 states. [2019-09-10 02:43:39,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61327 states to 61327 states and 112001 transitions. [2019-09-10 02:43:39,218 INFO L78 Accepts]: Start accepts. Automaton has 61327 states and 112001 transitions. Word has length 236 [2019-09-10 02:43:39,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:43:39,219 INFO L475 AbstractCegarLoop]: Abstraction has 61327 states and 112001 transitions. [2019-09-10 02:43:39,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 02:43:39,219 INFO L276 IsEmpty]: Start isEmpty. Operand 61327 states and 112001 transitions. [2019-09-10 02:43:39,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-10 02:43:39,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:43:39,367 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:43:39,367 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:43:39,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:43:39,368 INFO L82 PathProgramCache]: Analyzing trace with hash 517948319, now seen corresponding path program 1 times [2019-09-10 02:43:39,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:43:39,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:39,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:43:39,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:39,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:43:39,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:43:39,500 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-10 02:43:39,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:43:39,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:43:39,501 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:43:39,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:43:39,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:43:39,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:43:39,502 INFO L87 Difference]: Start difference. First operand 61327 states and 112001 transitions. Second operand 6 states. [2019-09-10 02:43:40,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:43:40,733 INFO L93 Difference]: Finished difference Result 61427 states and 112102 transitions. [2019-09-10 02:43:40,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:43:40,733 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 253 [2019-09-10 02:43:40,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:43:40,931 INFO L225 Difference]: With dead ends: 61427 [2019-09-10 02:43:40,932 INFO L226 Difference]: Without dead ends: 61427 [2019-09-10 02:43:40,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:43:40,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61427 states. [2019-09-10 02:43:42,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61427 to 61403. [2019-09-10 02:43:42,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61403 states. [2019-09-10 02:43:42,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61403 states to 61403 states and 112073 transitions. [2019-09-10 02:43:42,294 INFO L78 Accepts]: Start accepts. Automaton has 61403 states and 112073 transitions. Word has length 253 [2019-09-10 02:43:42,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:43:42,294 INFO L475 AbstractCegarLoop]: Abstraction has 61403 states and 112073 transitions. [2019-09-10 02:43:42,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:43:42,295 INFO L276 IsEmpty]: Start isEmpty. Operand 61403 states and 112073 transitions. [2019-09-10 02:43:42,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-10 02:43:42,451 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:43:42,451 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:43:42,452 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:43:42,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:43:42,452 INFO L82 PathProgramCache]: Analyzing trace with hash -966542761, now seen corresponding path program 1 times [2019-09-10 02:43:42,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:43:42,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:42,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:43:42,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:42,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:43:42,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:43:42,609 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-09-10 02:43:42,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:43:42,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:43:42,610 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:43:42,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:43:42,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:43:42,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:43:42,611 INFO L87 Difference]: Start difference. First operand 61403 states and 112073 transitions. Second operand 6 states. [2019-09-10 02:43:43,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:43:43,329 INFO L93 Difference]: Finished difference Result 61583 states and 111854 transitions. [2019-09-10 02:43:43,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:43:43,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 254 [2019-09-10 02:43:43,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:43:43,541 INFO L225 Difference]: With dead ends: 61583 [2019-09-10 02:43:43,541 INFO L226 Difference]: Without dead ends: 61583 [2019-09-10 02:43:43,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:43:43,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61583 states. [2019-09-10 02:43:45,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61583 to 61583. [2019-09-10 02:43:45,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61583 states. [2019-09-10 02:43:45,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61583 states to 61583 states and 111854 transitions. [2019-09-10 02:43:45,315 INFO L78 Accepts]: Start accepts. Automaton has 61583 states and 111854 transitions. Word has length 254 [2019-09-10 02:43:45,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:43:45,316 INFO L475 AbstractCegarLoop]: Abstraction has 61583 states and 111854 transitions. [2019-09-10 02:43:45,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:43:45,316 INFO L276 IsEmpty]: Start isEmpty. Operand 61583 states and 111854 transitions. [2019-09-10 02:43:45,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-10 02:43:45,481 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:43:45,481 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:43:45,481 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:43:45,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:43:45,482 INFO L82 PathProgramCache]: Analyzing trace with hash -525494230, now seen corresponding path program 1 times [2019-09-10 02:43:45,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:43:45,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:45,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:43:45,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:45,483 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:43:45,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:43:45,631 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-09-10 02:43:45,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:43:45,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:43:45,632 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:43:45,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:43:45,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:43:45,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:43:45,633 INFO L87 Difference]: Start difference. First operand 61583 states and 111854 transitions. Second operand 6 states. [2019-09-10 02:43:46,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:43:46,339 INFO L93 Difference]: Finished difference Result 61583 states and 106760 transitions. [2019-09-10 02:43:46,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:43:46,339 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 257 [2019-09-10 02:43:46,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:43:46,562 INFO L225 Difference]: With dead ends: 61583 [2019-09-10 02:43:46,562 INFO L226 Difference]: Without dead ends: 61583 [2019-09-10 02:43:46,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:43:46,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61583 states. [2019-09-10 02:43:48,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61583 to 61583. [2019-09-10 02:43:48,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61583 states. [2019-09-10 02:43:48,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61583 states to 61583 states and 106760 transitions. [2019-09-10 02:43:48,348 INFO L78 Accepts]: Start accepts. Automaton has 61583 states and 106760 transitions. Word has length 257 [2019-09-10 02:43:48,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:43:48,348 INFO L475 AbstractCegarLoop]: Abstraction has 61583 states and 106760 transitions. [2019-09-10 02:43:48,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:43:48,348 INFO L276 IsEmpty]: Start isEmpty. Operand 61583 states and 106760 transitions. [2019-09-10 02:43:48,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-10 02:43:48,509 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:43:48,509 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:43:48,509 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:43:48,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:43:48,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1327270387, now seen corresponding path program 1 times [2019-09-10 02:43:48,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:43:48,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:48,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:43:48,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:48,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:43:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:43:48,660 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-10 02:43:48,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:43:48,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:43:48,662 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 251 with the following transitions: [2019-09-10 02:43:48,665 INFO L207 CegarAbsIntRunner]: [72], [75], [85], [123], [139], [142], [143], [146], [155], [156], [157], [159], [255], [258], [264], [269], [271], [275], [278], [279], [280], [283], [289], [326], [329], [338], [349], [351], [352], [355], [365], [368], [370], [373], [375], [377], [394], [397], [406], [507], [510], [520], [571], [573], [576], [578], [580], [581], [582], [584], [585], [586], [604], [607], [621], [624], [627], [641], [670], [671], [682], [684], [686], [689], [693], [696], [698], [712], [716], [719], [737], [740], [765], [799], [808], [812], [814], [816], [819], [822], [824], [826], [833], [836], [990], [993], [996], [1027], [1046], [1049], [1052], [1096], [1097], [1100], [1103], [1106], [1150], [1169], [1171], [1173], [1176], [1184], [1195], [1198], [1199], [1202], [1205], [1236], [1237], [1239], [1322], [1325], [1331], [1352], [1355], [1369], [1377], [1380], [1389], [1405], [1408], [1411], [1442], [1456], [1459], [1461], [1463], [1465], [1470], [1480], [1482], [1483], [1603], [1605], [1607], [1609], [1610], [1640], [1650], [1651], [1652], [1653], [1654], [1655], [1658], [1659], [1660], [1661], [1662], [1664], [1665], [1666], [1667], [1684], [1685], [1686], [1687], [1688], [1689], [1700], [1701], [1702], [1703], [1704], [1705], [1706], [1707], [1708], [1709], [1710], [1711], [1726], [1727], [1728], [1729], [1730], [1732], [1733], [1734], [1735], [1736], [1737], [1738], [1739], [1740], [1742], [1743], [1744], [1745], [1754], [1772], [1773], [1790], [1792], [1793], [1794], [1795], [1796], [1797], [1798], [1799], [1800], [1802], [1803], [1804], [1805], [1806], [1807], [1808], [1816], [1817], [1818], [1819], [1820], [1821], [1822], [1826], [1827], [1832], [1833], [1834], [1835], [1836], [1837], [1838], [1839], [1840] [2019-09-10 02:43:48,739 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:43:48,739 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:43:48,908 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 02:43:48,910 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 204 root evaluator evaluations with a maximum evaluation depth of 0. Performed 204 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 374 variables. [2019-09-10 02:43:48,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:43:48,915 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 02:43:49,031 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-10 02:43:49,032 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 02:43:49,037 INFO L420 sIntCurrentIteration]: We unified 249 AI predicates to 249 [2019-09-10 02:43:49,038 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 02:43:49,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 02:43:49,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 7 [2019-09-10 02:43:49,039 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:43:49,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:43:49,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:43:49,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:43:49,041 INFO L87 Difference]: Start difference. First operand 61583 states and 106760 transitions. Second operand 2 states. [2019-09-10 02:43:49,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:43:49,042 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-10 02:43:49,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:43:49,042 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 250 [2019-09-10 02:43:49,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:43:49,042 INFO L225 Difference]: With dead ends: 2 [2019-09-10 02:43:49,042 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 02:43:49,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 249 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:43:49,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 02:43:49,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 02:43:49,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 02:43:49,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 02:43:49,044 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 250 [2019-09-10 02:43:49,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:43:49,044 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 02:43:49,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:43:49,044 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 02:43:49,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 02:43:49,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 02:43:49 BoogieIcfgContainer [2019-09-10 02:43:49,051 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 02:43:49,054 INFO L168 Benchmark]: Toolchain (without parser) took 114254.10 ms. Allocated memory was 141.6 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 85.8 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-09-10 02:43:49,055 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 141.6 MB. Free memory was 107.7 MB in the beginning and 107.5 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:43:49,056 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1260.86 ms. Allocated memory was 141.6 MB in the beginning and 205.5 MB in the end (delta: 64.0 MB). Free memory was 85.6 MB in the beginning and 139.2 MB in the end (delta: -53.6 MB). Peak memory consumption was 28.9 MB. Max. memory is 7.1 GB. [2019-09-10 02:43:49,057 INFO L168 Benchmark]: Boogie Preprocessor took 251.67 ms. Allocated memory is still 205.5 MB. Free memory was 138.6 MB in the beginning and 130.2 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 7.1 GB. [2019-09-10 02:43:49,058 INFO L168 Benchmark]: RCFGBuilder took 2216.16 ms. Allocated memory was 205.5 MB in the beginning and 256.9 MB in the end (delta: 51.4 MB). Free memory was 130.2 MB in the beginning and 162.6 MB in the end (delta: -32.4 MB). Peak memory consumption was 85.7 MB. Max. memory is 7.1 GB. [2019-09-10 02:43:49,059 INFO L168 Benchmark]: TraceAbstraction took 110520.83 ms. Allocated memory was 256.9 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 162.6 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-09-10 02:43:49,063 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 141.6 MB. Free memory was 107.7 MB in the beginning and 107.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1260.86 ms. Allocated memory was 141.6 MB in the beginning and 205.5 MB in the end (delta: 64.0 MB). Free memory was 85.6 MB in the beginning and 139.2 MB in the end (delta: -53.6 MB). Peak memory consumption was 28.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 251.67 ms. Allocated memory is still 205.5 MB. Free memory was 138.6 MB in the beginning and 130.2 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2216.16 ms. Allocated memory was 205.5 MB in the beginning and 256.9 MB in the end (delta: 51.4 MB). Free memory was 130.2 MB in the beginning and 162.6 MB in the end (delta: -32.4 MB). Peak memory consumption was 85.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 110520.83 ms. Allocated memory was 256.9 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 162.6 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1842]: 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 110 procedures, 748 locations, 1 error locations. SAFE Result, 110.4s OverallTime, 27 OverallIterations, 4 TraceHistogramMax, 69.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 18178 SDtfs, 17224 SDslu, 63962 SDs, 0 SdLazy, 56642 SolverSat, 5388 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 46.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 735 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 362 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2515 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75985occurred 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.032128514056225 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 31.8s AutomataMinimizationTime, 27 MinimizatonAttempts, 25614 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 6069 NumberOfCodeBlocks, 6069 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 6042 ConstructedInterpolants, 0 QuantifiedInterpolants, 1813009 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 26 PerfectInterpolantSequences, 1116/1119 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...