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_product31.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:43:05,571 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:43:05,573 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:43:05,592 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:43:05,592 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:43:05,594 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:43:05,597 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:43:05,606 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:43:05,614 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:43:05,614 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:43:05,617 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:43:05,619 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:43:05,620 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:43:05,621 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:43:05,622 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:43:05,626 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:43:05,627 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:43:05,628 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:43:05,631 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:43:05,633 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:43:05,638 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:43:05,640 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:43:05,640 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:43:05,641 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:43:05,645 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:43:05,646 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:43:05,646 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:43:05,648 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:43:05,650 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:43:05,651 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:43:05,651 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:43:05,654 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:43:05,655 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:43:05,655 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:43:05,658 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:43:05,658 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:43:05,659 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:43:05,659 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:43:05,659 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:43:05,660 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:43:05,661 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:43:05,663 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:43:05,689 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:43:05,689 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:43:05,690 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:43:05,690 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:43:05,691 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:43:05,691 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:43:05,691 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:43:05,692 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:43:05,692 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:43:05,692 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:43:05,694 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:43:05,695 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:43:05,695 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:43:05,695 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:43:05,695 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:43:05,696 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:43:05,696 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:43:05,696 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:43:05,696 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:43:05,696 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:43:05,697 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:43:05,697 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:43:05,697 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:43:05,697 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:43:05,698 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:43:05,698 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:43:05,698 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:43:05,698 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:43:05,698 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:43:05,698 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:43:05,752 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:43:05,770 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:43:05,773 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:43:05,775 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:43:05,775 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:43:05,777 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec6_product31.cil.c [2019-09-10 02:43:05,840 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aee15d53c/b71a48b5ad34411aa8be6ad1cdae5c29/FLAG3afa44309 [2019-09-10 02:43:06,462 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:43:06,463 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec6_product31.cil.c [2019-09-10 02:43:06,495 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aee15d53c/b71a48b5ad34411aa8be6ad1cdae5c29/FLAG3afa44309 [2019-09-10 02:43:06,602 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aee15d53c/b71a48b5ad34411aa8be6ad1cdae5c29 [2019-09-10 02:43:06,610 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:43:06,611 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:43:06,612 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:43:06,613 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:43:06,616 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:43:06,617 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:43:06" (1/1) ... [2019-09-10 02:43:06,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@491f9684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:43:06, skipping insertion in model container [2019-09-10 02:43:06,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:43:06" (1/1) ... [2019-09-10 02:43:06,628 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:43:06,720 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:43:07,497 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:43:07,527 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:43:07,713 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:43:07,833 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:43:07,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:43:07 WrapperNode [2019-09-10 02:43:07,834 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:43:07,835 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:43:07,835 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:43:07,835 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:43:07,851 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:43:07" (1/1) ... [2019-09-10 02:43:07,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:43:07" (1/1) ... [2019-09-10 02:43:07,919 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:43:07" (1/1) ... [2019-09-10 02:43:07,922 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:43:07" (1/1) ... [2019-09-10 02:43:08,016 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:43:07" (1/1) ... [2019-09-10 02:43:08,049 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:43:07" (1/1) ... [2019-09-10 02:43:08,060 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:43:07" (1/1) ... [2019-09-10 02:43:08,080 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:43:08,081 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:43:08,081 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:43:08,081 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:43:08,082 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:43:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:43:08,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:43:08,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:43:08,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-10 02:43:08,147 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-10 02:43:08,147 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-10 02:43:08,147 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Encrypt [2019-09-10 02:43:08,147 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Forward [2019-09-10 02:43:08,148 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-10 02:43:08,148 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-10 02:43:08,148 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-10 02:43:08,148 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-10 02:43:08,148 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-10 02:43:08,149 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-10 02:43:08,149 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-10 02:43:08,149 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-10 02:43:08,149 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-10 02:43:08,149 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-10 02:43:08,150 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-10 02:43:08,150 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-10 02:43:08,150 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-10 02:43:08,150 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-10 02:43:08,150 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-10 02:43:08,151 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-10 02:43:08,151 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-10 02:43:08,151 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-10 02:43:08,151 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-10 02:43:08,151 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-10 02:43:08,151 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-10 02:43:08,152 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-10 02:43:08,152 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-10 02:43:08,152 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-10 02:43:08,152 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-10 02:43:08,152 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-10 02:43:08,152 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-10 02:43:08,153 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-10 02:43:08,153 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-10 02:43:08,153 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-10 02:43:08,153 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-10 02:43:08,153 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-10 02:43:08,153 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-10 02:43:08,154 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-10 02:43:08,154 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-10 02:43:08,154 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-10 02:43:08,154 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-10 02:43:08,154 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-10 02:43:08,154 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-10 02:43:08,155 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-10 02:43:08,155 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-10 02:43:08,155 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-10 02:43:08,155 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-10 02:43:08,155 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-10 02:43:08,155 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-10 02:43:08,155 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-10 02:43:08,156 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-10 02:43:08,156 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-10 02:43:08,156 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-10 02:43:08,156 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-10 02:43:08,156 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-10 02:43:08,156 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:43:08,157 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-10 02:43:08,157 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-10 02:43:08,157 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-10 02:43:08,157 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-10 02:43:08,157 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-10 02:43:08,157 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-10 02:43:08,157 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-10 02:43:08,158 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-10 02:43:08,158 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-10 02:43:08,158 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-09-10 02:43:08,158 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-10 02:43:08,158 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-10 02:43:08,158 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2019-09-10 02:43:08,159 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-10 02:43:08,159 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-10 02:43:08,159 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-09-10 02:43:08,159 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-09-10 02:43:08,159 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-09-10 02:43:08,159 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-10 02:43:08,159 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-10 02:43:08,160 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-10 02:43:08,160 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-10 02:43:08,160 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-10 02:43:08,160 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-10 02:43:08,160 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-10 02:43:08,160 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-10 02:43:08,161 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-10 02:43:08,161 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-09-10 02:43:08,161 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-09-10 02:43:08,161 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-09-10 02:43:08,161 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptDecrypt_spec__1 [2019-09-10 02:43:08,161 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptDecrypt_spec__2 [2019-09-10 02:43:08,161 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-10 02:43:08,162 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-10 02:43:08,162 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-10 02:43:08,162 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-10 02:43:08,162 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-10 02:43:08,162 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-10 02:43:08,162 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-10 02:43:08,163 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-10 02:43:08,163 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-10 02:43:08,163 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-10 02:43:08,163 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-10 02:43:08,163 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-10 02:43:08,163 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-10 02:43:08,163 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-10 02:43:08,164 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-10 02:43:08,164 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-10 02:43:08,164 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-10 02:43:08,164 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-10 02:43:08,164 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-10 02:43:08,164 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-10 02:43:08,164 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-10 02:43:08,165 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-10 02:43:08,165 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-10 02:43:08,165 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-10 02:43:08,165 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-10 02:43:08,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:43:08,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:43:08,166 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-10 02:43:08,166 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-10 02:43:08,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 02:43:08,166 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-10 02:43:08,166 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-10 02:43:08,166 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-10 02:43:08,166 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-10 02:43:08,167 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-10 02:43:08,167 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-10 02:43:08,167 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-10 02:43:08,167 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-10 02:43:08,167 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-10 02:43:08,167 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-10 02:43:08,168 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-10 02:43:08,168 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-10 02:43:08,168 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-10 02:43:08,168 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-10 02:43:08,168 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-10 02:43:08,168 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Encrypt [2019-09-10 02:43:08,169 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Forward [2019-09-10 02:43:08,169 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-10 02:43:08,169 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-10 02:43:08,169 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-10 02:43:08,169 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-10 02:43:08,170 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-10 02:43:08,170 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-10 02:43:08,170 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-10 02:43:08,170 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-10 02:43:08,170 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-10 02:43:08,170 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-10 02:43:08,171 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-10 02:43:08,171 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-10 02:43:08,171 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-10 02:43:08,171 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-10 02:43:08,171 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-10 02:43:08,171 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-10 02:43:08,172 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-10 02:43:08,172 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-10 02:43:08,172 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-10 02:43:08,172 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-10 02:43:08,172 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-10 02:43:08,172 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-10 02:43:08,173 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-10 02:43:08,173 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-10 02:43:08,173 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-10 02:43:08,173 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-10 02:43:08,173 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-10 02:43:08,173 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-10 02:43:08,174 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-10 02:43:08,174 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-10 02:43:08,174 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-10 02:43:08,174 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-10 02:43:08,174 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-10 02:43:08,174 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-10 02:43:08,175 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-10 02:43:08,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-10 02:43:08,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-10 02:43:08,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 02:43:08,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-10 02:43:08,175 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-10 02:43:08,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 02:43:08,176 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-10 02:43:08,176 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-10 02:43:08,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 02:43:08,176 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-10 02:43:08,176 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-10 02:43:08,176 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-10 02:43:08,177 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-10 02:43:08,177 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-10 02:43:08,177 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-10 02:43:08,177 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-10 02:43:08,177 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-09-10 02:43:08,177 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-10 02:43:08,177 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-10 02:43:08,178 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-10 02:43:08,178 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-10 02:43:08,178 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-10 02:43:08,178 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-10 02:43:08,178 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-10 02:43:08,178 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-10 02:43:08,179 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-10 02:43:08,179 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-10 02:43:08,179 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-10 02:43:08,179 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-10 02:43:08,179 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-10 02:43:08,179 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-10 02:43:08,179 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-10 02:43:08,180 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-10 02:43:08,180 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-10 02:43:08,180 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-10 02:43:08,180 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-10 02:43:08,180 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-10 02:43:08,181 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:43:08,181 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-10 02:43:08,181 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-10 02:43:08,181 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-10 02:43:08,181 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-10 02:43:08,181 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-10 02:43:08,182 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-10 02:43:08,182 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-10 02:43:08,182 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-10 02:43:08,182 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-10 02:43:08,182 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-10 02:43:08,182 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-10 02:43:08,183 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-10 02:43:08,183 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-10 02:43:08,183 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-10 02:43:08,183 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-10 02:43:08,183 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-10 02:43:08,183 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-09-10 02:43:08,184 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-09-10 02:43:08,184 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-09-10 02:43:08,184 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptDecrypt_spec__1 [2019-09-10 02:43:08,184 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-10 02:43:08,184 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2019-09-10 02:43:08,184 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-09-10 02:43:08,184 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-09-10 02:43:08,185 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-09-10 02:43:08,185 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptDecrypt_spec__2 [2019-09-10 02:43:08,185 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-10 02:43:08,185 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-10 02:43:08,185 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-10 02:43:08,185 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-10 02:43:08,186 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-10 02:43:08,186 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-10 02:43:08,186 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-10 02:43:08,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:43:08,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-10 02:43:08,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:43:10,256 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:43:10,257 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-10 02:43:10,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:43:10 BoogieIcfgContainer [2019-09-10 02:43:10,260 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:43:10,261 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:43:10,261 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:43:10,264 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:43:10,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:43:06" (1/3) ... [2019-09-10 02:43:10,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@122e46f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:43:10, skipping insertion in model container [2019-09-10 02:43:10,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:43:07" (2/3) ... [2019-09-10 02:43:10,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@122e46f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:43:10, skipping insertion in model container [2019-09-10 02:43:10,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:43:10" (3/3) ... [2019-09-10 02:43:10,269 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec6_product31.cil.c [2019-09-10 02:43:10,279 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:43:10,297 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:43:10,315 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:43:10,348 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:43:10,349 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:43:10,349 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:43:10,349 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:43:10,352 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:43:10,352 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:43:10,353 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:43:10,353 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:43:10,398 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states. [2019-09-10 02:43:10,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-10 02:43:10,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:43:10,445 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:43:10,448 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:43:10,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:43:10,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1627872487, now seen corresponding path program 1 times [2019-09-10 02:43:10,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:43:10,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:10,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:43:10,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:10,506 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:43:10,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:43:11,080 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:43:11,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:43:11,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-10 02:43:11,083 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:43:11,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:43:11,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:43:11,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:43:11,108 INFO L87 Difference]: Start difference. First operand 566 states. Second operand 2 states. [2019-09-10 02:43:11,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:43:11,164 INFO L93 Difference]: Finished difference Result 552 states and 728 transitions. [2019-09-10 02:43:11,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:43:11,165 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 189 [2019-09-10 02:43:11,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:43:11,190 INFO L225 Difference]: With dead ends: 552 [2019-09-10 02:43:11,190 INFO L226 Difference]: Without dead ends: 543 [2019-09-10 02:43:11,192 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:43:11,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-09-10 02:43:11,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 543. [2019-09-10 02:43:11,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-09-10 02:43:11,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 717 transitions. [2019-09-10 02:43:11,289 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 717 transitions. Word has length 189 [2019-09-10 02:43:11,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:43:11,292 INFO L475 AbstractCegarLoop]: Abstraction has 543 states and 717 transitions. [2019-09-10 02:43:11,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:43:11,293 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 717 transitions. [2019-09-10 02:43:11,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-10 02:43:11,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:43:11,299 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:43:11,300 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:43:11,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:43:11,301 INFO L82 PathProgramCache]: Analyzing trace with hash -43680010, now seen corresponding path program 1 times [2019-09-10 02:43:11,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:43:11,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:11,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:43:11,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:11,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:43:11,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:43:11,579 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:43:11,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:43:11,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:43:11,579 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:43:11,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:43:11,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:43:11,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:43:11,585 INFO L87 Difference]: Start difference. First operand 543 states and 717 transitions. Second operand 3 states. [2019-09-10 02:43:11,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:43:11,653 INFO L93 Difference]: Finished difference Result 546 states and 720 transitions. [2019-09-10 02:43:11,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:43:11,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2019-09-10 02:43:11,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:43:11,667 INFO L225 Difference]: With dead ends: 546 [2019-09-10 02:43:11,667 INFO L226 Difference]: Without dead ends: 546 [2019-09-10 02:43:11,668 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:43:11,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-09-10 02:43:11,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 545. [2019-09-10 02:43:11,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-09-10 02:43:11,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 719 transitions. [2019-09-10 02:43:11,730 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 719 transitions. Word has length 190 [2019-09-10 02:43:11,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:43:11,731 INFO L475 AbstractCegarLoop]: Abstraction has 545 states and 719 transitions. [2019-09-10 02:43:11,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:43:11,731 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 719 transitions. [2019-09-10 02:43:11,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-10 02:43:11,738 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:43:11,738 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:43:11,739 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:43:11,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:43:11,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1696045406, now seen corresponding path program 1 times [2019-09-10 02:43:11,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:43:11,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:11,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:43:11,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:11,741 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:43:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:43:12,007 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:43:12,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:43:12,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:43:12,008 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:43:12,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:43:12,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:43:12,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:43:12,013 INFO L87 Difference]: Start difference. First operand 545 states and 719 transitions. Second operand 3 states. [2019-09-10 02:43:12,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:43:12,050 INFO L93 Difference]: Finished difference Result 586 states and 789 transitions. [2019-09-10 02:43:12,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:43:12,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-09-10 02:43:12,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:43:12,060 INFO L225 Difference]: With dead ends: 586 [2019-09-10 02:43:12,060 INFO L226 Difference]: Without dead ends: 586 [2019-09-10 02:43:12,060 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:43:12,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-09-10 02:43:12,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 585. [2019-09-10 02:43:12,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-09-10 02:43:12,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 788 transitions. [2019-09-10 02:43:12,095 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 788 transitions. Word has length 196 [2019-09-10 02:43:12,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:43:12,096 INFO L475 AbstractCegarLoop]: Abstraction has 585 states and 788 transitions. [2019-09-10 02:43:12,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:43:12,096 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 788 transitions. [2019-09-10 02:43:12,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-10 02:43:12,103 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:43:12,104 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:43:12,104 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:43:12,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:43:12,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1296301565, now seen corresponding path program 1 times [2019-09-10 02:43:12,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:43:12,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:12,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:43:12,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:12,106 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:43:12,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:43:12,451 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:43:12,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:43:12,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 02:43:12,452 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:43:12,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 02:43:12,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 02:43:12,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:43:12,454 INFO L87 Difference]: Start difference. First operand 585 states and 788 transitions. Second operand 11 states. [2019-09-10 02:43:18,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:43:18,101 INFO L93 Difference]: Finished difference Result 2774 states and 3689 transitions. [2019-09-10 02:43:18,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 02:43:18,101 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 197 [2019-09-10 02:43:18,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:43:18,116 INFO L225 Difference]: With dead ends: 2774 [2019-09-10 02:43:18,116 INFO L226 Difference]: Without dead ends: 2362 [2019-09-10 02:43:18,117 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-09-10 02:43:18,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2019-09-10 02:43:18,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 2347. [2019-09-10 02:43:18,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2347 states. [2019-09-10 02:43:18,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2347 states to 2347 states and 3065 transitions. [2019-09-10 02:43:18,200 INFO L78 Accepts]: Start accepts. Automaton has 2347 states and 3065 transitions. Word has length 197 [2019-09-10 02:43:18,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:43:18,201 INFO L475 AbstractCegarLoop]: Abstraction has 2347 states and 3065 transitions. [2019-09-10 02:43:18,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 02:43:18,201 INFO L276 IsEmpty]: Start isEmpty. Operand 2347 states and 3065 transitions. [2019-09-10 02:43:18,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-10 02:43:18,205 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:43:18,206 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:43:18,206 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:43:18,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:43:18,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1739210456, now seen corresponding path program 1 times [2019-09-10 02:43:18,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:43:18,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:18,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:43:18,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:18,208 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:43:18,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:43:18,578 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:43:18,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:43:18,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 02:43:18,579 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:43:18,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 02:43:18,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 02:43:18,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-09-10 02:43:18,580 INFO L87 Difference]: Start difference. First operand 2347 states and 3065 transitions. Second operand 18 states. [2019-09-10 02:43:19,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:43:19,032 INFO L93 Difference]: Finished difference Result 2292 states and 2996 transitions. [2019-09-10 02:43:19,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 02:43:19,033 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 198 [2019-09-10 02:43:19,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:43:19,043 INFO L225 Difference]: With dead ends: 2292 [2019-09-10 02:43:19,043 INFO L226 Difference]: Without dead ends: 1888 [2019-09-10 02:43:19,044 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2019-09-10 02:43:19,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1888 states. [2019-09-10 02:43:19,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1888 to 1848. [2019-09-10 02:43:19,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-09-10 02:43:19,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2408 transitions. [2019-09-10 02:43:19,113 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2408 transitions. Word has length 198 [2019-09-10 02:43:19,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:43:19,115 INFO L475 AbstractCegarLoop]: Abstraction has 1848 states and 2408 transitions. [2019-09-10 02:43:19,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 02:43:19,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2408 transitions. [2019-09-10 02:43:19,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-10 02:43:19,119 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:43:19,120 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:43:19,120 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:43:19,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:43:19,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1608111805, now seen corresponding path program 1 times [2019-09-10 02:43:19,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:43:19,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:19,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:43:19,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:19,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:43:19,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:43:19,309 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:43:19,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:43:19,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:43:19,310 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:43:19,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:43:19,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:43:19,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:43:19,311 INFO L87 Difference]: Start difference. First operand 1848 states and 2408 transitions. Second operand 6 states. [2019-09-10 02:43:19,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:43:19,990 INFO L93 Difference]: Finished difference Result 3687 states and 4826 transitions. [2019-09-10 02:43:19,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:43:19,990 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 207 [2019-09-10 02:43:19,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:43:20,010 INFO L225 Difference]: With dead ends: 3687 [2019-09-10 02:43:20,010 INFO L226 Difference]: Without dead ends: 3687 [2019-09-10 02:43:20,010 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:43:20,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3687 states. [2019-09-10 02:43:20,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3687 to 3616. [2019-09-10 02:43:20,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3616 states. [2019-09-10 02:43:20,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3616 states to 3616 states and 4738 transitions. [2019-09-10 02:43:20,135 INFO L78 Accepts]: Start accepts. Automaton has 3616 states and 4738 transitions. Word has length 207 [2019-09-10 02:43:20,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:43:20,137 INFO L475 AbstractCegarLoop]: Abstraction has 3616 states and 4738 transitions. [2019-09-10 02:43:20,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:43:20,140 INFO L276 IsEmpty]: Start isEmpty. Operand 3616 states and 4738 transitions. [2019-09-10 02:43:20,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-10 02:43:20,148 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:43:20,149 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:43:20,149 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:43:20,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:43:20,150 INFO L82 PathProgramCache]: Analyzing trace with hash 529447440, now seen corresponding path program 1 times [2019-09-10 02:43:20,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:43:20,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:20,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:43:20,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:20,155 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:43:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:43:20,512 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:43:20,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:43:20,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 02:43:20,513 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:43:20,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 02:43:20,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 02:43:20,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:43:20,515 INFO L87 Difference]: Start difference. First operand 3616 states and 4738 transitions. Second operand 11 states. [2019-09-10 02:43:20,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:43:20,888 INFO L93 Difference]: Finished difference Result 3652 states and 4786 transitions. [2019-09-10 02:43:20,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:43:20,889 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 208 [2019-09-10 02:43:20,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:43:20,910 INFO L225 Difference]: With dead ends: 3652 [2019-09-10 02:43:20,911 INFO L226 Difference]: Without dead ends: 3634 [2019-09-10 02:43:20,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-09-10 02:43:20,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3634 states. [2019-09-10 02:43:21,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3634 to 3604. [2019-09-10 02:43:21,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3604 states. [2019-09-10 02:43:21,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3604 states to 3604 states and 4712 transitions. [2019-09-10 02:43:21,053 INFO L78 Accepts]: Start accepts. Automaton has 3604 states and 4712 transitions. Word has length 208 [2019-09-10 02:43:21,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:43:21,057 INFO L475 AbstractCegarLoop]: Abstraction has 3604 states and 4712 transitions. [2019-09-10 02:43:21,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 02:43:21,057 INFO L276 IsEmpty]: Start isEmpty. Operand 3604 states and 4712 transitions. [2019-09-10 02:43:21,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-10 02:43:21,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:43:21,066 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:43:21,066 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:43:21,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:43:21,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1116223559, now seen corresponding path program 1 times [2019-09-10 02:43:21,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:43:21,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:21,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:43:21,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:21,069 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:43:21,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:43:21,362 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:43:21,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:43:21,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:43:21,363 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:43:21,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:43:21,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:43:21,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:43:21,366 INFO L87 Difference]: Start difference. First operand 3604 states and 4712 transitions. Second operand 5 states. [2019-09-10 02:43:22,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:43:22,568 INFO L93 Difference]: Finished difference Result 9680 states and 12672 transitions. [2019-09-10 02:43:22,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:43:22,569 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 208 [2019-09-10 02:43:22,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:43:22,618 INFO L225 Difference]: With dead ends: 9680 [2019-09-10 02:43:22,618 INFO L226 Difference]: Without dead ends: 8562 [2019-09-10 02:43:22,619 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:43:22,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8562 states. [2019-09-10 02:43:22,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8562 to 8282. [2019-09-10 02:43:22,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8282 states. [2019-09-10 02:43:22,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8282 states to 8282 states and 10870 transitions. [2019-09-10 02:43:22,895 INFO L78 Accepts]: Start accepts. Automaton has 8282 states and 10870 transitions. Word has length 208 [2019-09-10 02:43:22,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:43:22,895 INFO L475 AbstractCegarLoop]: Abstraction has 8282 states and 10870 transitions. [2019-09-10 02:43:22,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:43:22,896 INFO L276 IsEmpty]: Start isEmpty. Operand 8282 states and 10870 transitions. [2019-09-10 02:43:22,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-10 02:43:22,907 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:43:22,907 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:43:22,908 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:43:22,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:43:22,908 INFO L82 PathProgramCache]: Analyzing trace with hash 416033079, now seen corresponding path program 1 times [2019-09-10 02:43:22,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:43:22,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:22,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:43:22,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:22,909 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:43:22,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:43:23,134 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:43:23,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:43:23,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:43:23,135 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:43:23,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:43:23,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:43:23,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:43:23,136 INFO L87 Difference]: Start difference. First operand 8282 states and 10870 transitions. Second operand 3 states. [2019-09-10 02:43:23,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:43:23,184 INFO L93 Difference]: Finished difference Result 8610 states and 11471 transitions. [2019-09-10 02:43:23,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:43:23,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 237 [2019-09-10 02:43:23,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:43:23,228 INFO L225 Difference]: With dead ends: 8610 [2019-09-10 02:43:23,228 INFO L226 Difference]: Without dead ends: 8610 [2019-09-10 02:43:23,229 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:43:23,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8610 states. [2019-09-10 02:43:23,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8610 to 8606. [2019-09-10 02:43:23,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8606 states. [2019-09-10 02:43:23,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8606 states to 8606 states and 11467 transitions. [2019-09-10 02:43:23,529 INFO L78 Accepts]: Start accepts. Automaton has 8606 states and 11467 transitions. Word has length 237 [2019-09-10 02:43:23,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:43:23,529 INFO L475 AbstractCegarLoop]: Abstraction has 8606 states and 11467 transitions. [2019-09-10 02:43:23,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:43:23,530 INFO L276 IsEmpty]: Start isEmpty. Operand 8606 states and 11467 transitions. [2019-09-10 02:43:23,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-10 02:43:23,545 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:43:23,545 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:43:23,545 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:43:23,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:43:23,546 INFO L82 PathProgramCache]: Analyzing trace with hash 636431702, now seen corresponding path program 1 times [2019-09-10 02:43:23,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:43:23,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:23,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:43:23,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:23,547 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:43:23,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:43:23,692 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:43:23,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:43:23,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:43:23,692 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:43:23,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:43:23,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:43:23,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:43:23,694 INFO L87 Difference]: Start difference. First operand 8606 states and 11467 transitions. Second operand 3 states. [2019-09-10 02:43:23,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:43:23,743 INFO L93 Difference]: Finished difference Result 9218 states and 12593 transitions. [2019-09-10 02:43:23,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:43:23,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 238 [2019-09-10 02:43:23,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:43:23,783 INFO L225 Difference]: With dead ends: 9218 [2019-09-10 02:43:23,784 INFO L226 Difference]: Without dead ends: 9218 [2019-09-10 02:43:23,784 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:43:23,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9218 states. [2019-09-10 02:43:24,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9218 to 9214. [2019-09-10 02:43:24,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9214 states. [2019-09-10 02:43:24,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9214 states to 9214 states and 12589 transitions. [2019-09-10 02:43:24,077 INFO L78 Accepts]: Start accepts. Automaton has 9214 states and 12589 transitions. Word has length 238 [2019-09-10 02:43:24,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:43:24,077 INFO L475 AbstractCegarLoop]: Abstraction has 9214 states and 12589 transitions. [2019-09-10 02:43:24,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:43:24,078 INFO L276 IsEmpty]: Start isEmpty. Operand 9214 states and 12589 transitions. [2019-09-10 02:43:24,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-10 02:43:24,095 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:43:24,096 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:43:24,096 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:43:24,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:43:24,097 INFO L82 PathProgramCache]: Analyzing trace with hash -2128411399, now seen corresponding path program 1 times [2019-09-10 02:43:24,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:43:24,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:24,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:43:24,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:24,098 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:43:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:43:24,418 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:43:24,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:43:24,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 02:43:24,419 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:43:24,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:43:24,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:43:24,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:43:24,420 INFO L87 Difference]: Start difference. First operand 9214 states and 12589 transitions. Second operand 8 states. [2019-09-10 02:43:29,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:43:29,751 INFO L93 Difference]: Finished difference Result 18859 states and 26897 transitions. [2019-09-10 02:43:29,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 02:43:29,752 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 239 [2019-09-10 02:43:29,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:43:29,832 INFO L225 Difference]: With dead ends: 18859 [2019-09-10 02:43:29,832 INFO L226 Difference]: Without dead ends: 18859 [2019-09-10 02:43:29,833 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:43:29,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18859 states. [2019-09-10 02:43:30,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18859 to 11398. [2019-09-10 02:43:30,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11398 states. [2019-09-10 02:43:30,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11398 states to 11398 states and 16993 transitions. [2019-09-10 02:43:30,316 INFO L78 Accepts]: Start accepts. Automaton has 11398 states and 16993 transitions. Word has length 239 [2019-09-10 02:43:30,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:43:30,316 INFO L475 AbstractCegarLoop]: Abstraction has 11398 states and 16993 transitions. [2019-09-10 02:43:30,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:43:30,317 INFO L276 IsEmpty]: Start isEmpty. Operand 11398 states and 16993 transitions. [2019-09-10 02:43:30,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 02:43:30,354 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:43:30,354 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:43:30,354 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:43:30,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:43:30,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1945468677, now seen corresponding path program 1 times [2019-09-10 02:43:30,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:43:30,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:30,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:43:30,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:30,356 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:43:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:43:30,668 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:43:30,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:43:30,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 02:43:30,669 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:43:30,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:43:30,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:43:30,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:43:30,670 INFO L87 Difference]: Start difference. First operand 11398 states and 16993 transitions. Second operand 8 states. [2019-09-10 02:43:35,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:43:35,355 INFO L93 Difference]: Finished difference Result 23763 states and 37609 transitions. [2019-09-10 02:43:35,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 02:43:35,356 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 240 [2019-09-10 02:43:35,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:43:35,452 INFO L225 Difference]: With dead ends: 23763 [2019-09-10 02:43:35,452 INFO L226 Difference]: Without dead ends: 23763 [2019-09-10 02:43:35,453 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:43:35,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23763 states. [2019-09-10 02:43:35,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23763 to 15886. [2019-09-10 02:43:35,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15886 states. [2019-09-10 02:43:35,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15886 states to 15886 states and 26641 transitions. [2019-09-10 02:43:35,999 INFO L78 Accepts]: Start accepts. Automaton has 15886 states and 26641 transitions. Word has length 240 [2019-09-10 02:43:35,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:43:35,999 INFO L475 AbstractCegarLoop]: Abstraction has 15886 states and 26641 transitions. [2019-09-10 02:43:36,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:43:36,000 INFO L276 IsEmpty]: Start isEmpty. Operand 15886 states and 26641 transitions. [2019-09-10 02:43:36,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-10 02:43:36,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:43:36,117 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:43:36,118 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:43:36,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:43:36,118 INFO L82 PathProgramCache]: Analyzing trace with hash -280404159, now seen corresponding path program 1 times [2019-09-10 02:43:36,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:43:36,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:36,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:43:36,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:36,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:43:36,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:43:36,552 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-10 02:43:36,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:43:36,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 02:43:36,553 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:43:36,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:43:36,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:43:36,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:43:36,554 INFO L87 Difference]: Start difference. First operand 15886 states and 26641 transitions. Second operand 8 states. [2019-09-10 02:43:42,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:43:42,155 INFO L93 Difference]: Finished difference Result 33723 states and 60669 transitions. [2019-09-10 02:43:42,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 02:43:42,156 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 247 [2019-09-10 02:43:42,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:43:42,377 INFO L225 Difference]: With dead ends: 33723 [2019-09-10 02:43:42,378 INFO L226 Difference]: Without dead ends: 33723 [2019-09-10 02:43:42,378 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:43:42,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33723 states. [2019-09-10 02:43:43,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33723 to 24990. [2019-09-10 02:43:43,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24990 states. [2019-09-10 02:43:43,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24990 states to 24990 states and 47477 transitions. [2019-09-10 02:43:43,762 INFO L78 Accepts]: Start accepts. Automaton has 24990 states and 47477 transitions. Word has length 247 [2019-09-10 02:43:43,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:43:43,763 INFO L475 AbstractCegarLoop]: Abstraction has 24990 states and 47477 transitions. [2019-09-10 02:43:43,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:43:43,763 INFO L276 IsEmpty]: Start isEmpty. Operand 24990 states and 47477 transitions. [2019-09-10 02:43:43,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-10 02:43:43,944 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:43:43,945 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:43:43,945 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:43:43,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:43:43,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1231138441, now seen corresponding path program 1 times [2019-09-10 02:43:43,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:43:43,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:43,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:43:43,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:43,947 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:43:43,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:43:44,191 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:43:44,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:43:44,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 02:43:44,192 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:43:44,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 02:43:44,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 02:43:44,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:43:44,193 INFO L87 Difference]: Start difference. First operand 24990 states and 47477 transitions. Second operand 11 states. [2019-09-10 02:43:45,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:43:45,793 INFO L93 Difference]: Finished difference Result 31392 states and 55853 transitions. [2019-09-10 02:43:45,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 02:43:45,793 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 245 [2019-09-10 02:43:45,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:43:45,948 INFO L225 Difference]: With dead ends: 31392 [2019-09-10 02:43:45,949 INFO L226 Difference]: Without dead ends: 31388 [2019-09-10 02:43:45,949 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:43:45,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31388 states. [2019-09-10 02:43:46,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31388 to 31078. [2019-09-10 02:43:46,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31078 states. [2019-09-10 02:43:47,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31078 states to 31078 states and 55445 transitions. [2019-09-10 02:43:47,051 INFO L78 Accepts]: Start accepts. Automaton has 31078 states and 55445 transitions. Word has length 245 [2019-09-10 02:43:47,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:43:47,052 INFO L475 AbstractCegarLoop]: Abstraction has 31078 states and 55445 transitions. [2019-09-10 02:43:47,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 02:43:47,052 INFO L276 IsEmpty]: Start isEmpty. Operand 31078 states and 55445 transitions. [2019-09-10 02:43:47,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-10 02:43:47,150 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:43:47,151 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:43:47,151 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:43:47,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:43:47,152 INFO L82 PathProgramCache]: Analyzing trace with hash 921094426, now seen corresponding path program 1 times [2019-09-10 02:43:47,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:43:47,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:47,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:43:47,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:47,153 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:43:47,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:43:48,623 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-10 02:43:48,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:43:48,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:43:48,625 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:43:48,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:43:48,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:43:48,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:43:48,626 INFO L87 Difference]: Start difference. First operand 31078 states and 55445 transitions. Second operand 6 states. [2019-09-10 02:43:49,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:43:49,299 INFO L93 Difference]: Finished difference Result 31210 states and 55023 transitions. [2019-09-10 02:43:49,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:43:49,299 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 252 [2019-09-10 02:43:49,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:43:49,444 INFO L225 Difference]: With dead ends: 31210 [2019-09-10 02:43:49,444 INFO L226 Difference]: Without dead ends: 31210 [2019-09-10 02:43:49,445 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:49,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31210 states. [2019-09-10 02:43:50,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31210 to 31210. [2019-09-10 02:43:50,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31210 states. [2019-09-10 02:43:50,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31210 states to 31210 states and 55023 transitions. [2019-09-10 02:43:50,385 INFO L78 Accepts]: Start accepts. Automaton has 31210 states and 55023 transitions. Word has length 252 [2019-09-10 02:43:50,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:43:50,385 INFO L475 AbstractCegarLoop]: Abstraction has 31210 states and 55023 transitions. [2019-09-10 02:43:50,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:43:50,386 INFO L276 IsEmpty]: Start isEmpty. Operand 31210 states and 55023 transitions. [2019-09-10 02:43:50,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-09-10 02:43:50,464 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:43:50,464 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:43:50,464 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:43:50,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:43:50,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1566932886, now seen corresponding path program 1 times [2019-09-10 02:43:50,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:43:50,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:50,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:43:50,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:50,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:43:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:43:50,942 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-10 02:43:50,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:43:50,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:43:50,945 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:43:50,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:43:50,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:43:50,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:43:50,947 INFO L87 Difference]: Start difference. First operand 31210 states and 55023 transitions. Second operand 3 states. [2019-09-10 02:43:51,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:43:51,188 INFO L93 Difference]: Finished difference Result 40558 states and 77939 transitions. [2019-09-10 02:43:51,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:43:51,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 264 [2019-09-10 02:43:51,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:43:51,340 INFO L225 Difference]: With dead ends: 40558 [2019-09-10 02:43:51,340 INFO L226 Difference]: Without dead ends: 40558 [2019-09-10 02:43:51,341 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:43:51,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40558 states. [2019-09-10 02:43:52,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40558 to 40554. [2019-09-10 02:43:52,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40554 states. [2019-09-10 02:43:52,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40554 states to 40554 states and 77935 transitions. [2019-09-10 02:43:52,496 INFO L78 Accepts]: Start accepts. Automaton has 40554 states and 77935 transitions. Word has length 264 [2019-09-10 02:43:52,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:43:52,496 INFO L475 AbstractCegarLoop]: Abstraction has 40554 states and 77935 transitions. [2019-09-10 02:43:52,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:43:52,497 INFO L276 IsEmpty]: Start isEmpty. Operand 40554 states and 77935 transitions. [2019-09-10 02:43:54,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-10 02:43:54,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:43:54,337 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:43:54,338 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:43:54,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:43:54,338 INFO L82 PathProgramCache]: Analyzing trace with hash -384896842, now seen corresponding path program 1 times [2019-09-10 02:43:54,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:43:54,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:54,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:43:54,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:43:54,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:43:54,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:43:54,735 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-10 02:43:54,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:43:54,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 02:43:54,736 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:43:54,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 02:43:54,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 02:43:54,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=414, Unknown=0, NotChecked=0, Total=462 [2019-09-10 02:43:54,737 INFO L87 Difference]: Start difference. First operand 40554 states and 77935 transitions. Second operand 22 states. [2019-09-10 02:44:13,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:44:13,747 INFO L93 Difference]: Finished difference Result 91507 states and 173415 transitions. [2019-09-10 02:44:13,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-10 02:44:13,748 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 247 [2019-09-10 02:44:13,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:44:14,197 INFO L225 Difference]: With dead ends: 91507 [2019-09-10 02:44:14,198 INFO L226 Difference]: Without dead ends: 91507 [2019-09-10 02:44:14,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1158 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=483, Invalid=4209, Unknown=0, NotChecked=0, Total=4692 [2019-09-10 02:44:14,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91507 states. [2019-09-10 02:44:16,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91507 to 89796. [2019-09-10 02:44:16,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89796 states. [2019-09-10 02:44:16,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89796 states to 89796 states and 170300 transitions. [2019-09-10 02:44:16,740 INFO L78 Accepts]: Start accepts. Automaton has 89796 states and 170300 transitions. Word has length 247 [2019-09-10 02:44:16,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:44:16,741 INFO L475 AbstractCegarLoop]: Abstraction has 89796 states and 170300 transitions. [2019-09-10 02:44:16,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 02:44:16,741 INFO L276 IsEmpty]: Start isEmpty. Operand 89796 states and 170300 transitions. [2019-09-10 02:44:19,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-10 02:44:19,904 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:44:19,904 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:44:19,904 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:44:19,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:44:19,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1069882748, now seen corresponding path program 1 times [2019-09-10 02:44:19,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:44:19,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:19,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:44:19,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:19,906 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:44:19,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:44:20,079 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-10 02:44:20,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:44:20,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:44:20,079 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:44:20,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:44:20,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:44:20,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:44:20,081 INFO L87 Difference]: Start difference. First operand 89796 states and 170300 transitions. Second operand 6 states. [2019-09-10 02:44:21,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:44:21,098 INFO L93 Difference]: Finished difference Result 89540 states and 150778 transitions. [2019-09-10 02:44:21,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:44:21,099 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 255 [2019-09-10 02:44:21,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:44:21,385 INFO L225 Difference]: With dead ends: 89540 [2019-09-10 02:44:21,386 INFO L226 Difference]: Without dead ends: 89540 [2019-09-10 02:44:21,386 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:44:21,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89540 states. [2019-09-10 02:44:23,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89540 to 89509. [2019-09-10 02:44:23,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89509 states. [2019-09-10 02:44:23,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89509 states to 89509 states and 150741 transitions. [2019-09-10 02:44:23,635 INFO L78 Accepts]: Start accepts. Automaton has 89509 states and 150741 transitions. Word has length 255 [2019-09-10 02:44:23,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:44:23,635 INFO L475 AbstractCegarLoop]: Abstraction has 89509 states and 150741 transitions. [2019-09-10 02:44:23,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:44:23,635 INFO L276 IsEmpty]: Start isEmpty. Operand 89509 states and 150741 transitions. [2019-09-10 02:44:23,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-09-10 02:44:23,796 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:44:23,796 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1] [2019-09-10 02:44:23,796 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:44:23,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:44:23,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1389361589, now seen corresponding path program 1 times [2019-09-10 02:44:23,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:44:23,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:23,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:44:23,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:23,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:44:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:44:24,186 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-10 02:44:24,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:44:24,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 02:44:24,187 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:44:24,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 02:44:24,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 02:44:24,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-09-10 02:44:24,188 INFO L87 Difference]: Start difference. First operand 89509 states and 150741 transitions. Second operand 18 states. [2019-09-10 02:44:43,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:44:43,380 INFO L93 Difference]: Finished difference Result 93593 states and 157833 transitions. [2019-09-10 02:44:43,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-10 02:44:43,381 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 270 [2019-09-10 02:44:43,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:44:43,674 INFO L225 Difference]: With dead ends: 93593 [2019-09-10 02:44:43,674 INFO L226 Difference]: Without dead ends: 93593 [2019-09-10 02:44:43,675 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 977 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=423, Invalid=3483, Unknown=0, NotChecked=0, Total=3906 [2019-09-10 02:44:43,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93593 states. [2019-09-10 02:44:45,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93593 to 91932. [2019-09-10 02:44:45,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91932 states. [2019-09-10 02:44:46,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91932 states to 91932 states and 155031 transitions. [2019-09-10 02:44:46,004 INFO L78 Accepts]: Start accepts. Automaton has 91932 states and 155031 transitions. Word has length 270 [2019-09-10 02:44:46,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:44:46,004 INFO L475 AbstractCegarLoop]: Abstraction has 91932 states and 155031 transitions. [2019-09-10 02:44:46,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 02:44:46,004 INFO L276 IsEmpty]: Start isEmpty. Operand 91932 states and 155031 transitions. [2019-09-10 02:44:46,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-10 02:44:46,173 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:44:46,174 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:44:46,174 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:44:46,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:44:46,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1618087055, now seen corresponding path program 1 times [2019-09-10 02:44:46,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:44:46,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:46,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:44:46,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:46,176 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:44:46,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:44:46,452 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-10 02:44:46,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:44:46,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 02:44:46,453 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:44:46,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 02:44:46,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 02:44:46,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:44:46,455 INFO L87 Difference]: Start difference. First operand 91932 states and 155031 transitions. Second operand 16 states. [2019-09-10 02:44:47,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:44:47,108 INFO L93 Difference]: Finished difference Result 89940 states and 150946 transitions. [2019-09-10 02:44:47,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 02:44:47,109 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 248 [2019-09-10 02:44:47,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:44:47,438 INFO L225 Difference]: With dead ends: 89940 [2019-09-10 02:44:47,438 INFO L226 Difference]: Without dead ends: 87082 [2019-09-10 02:44:47,439 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-09-10 02:44:47,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87082 states. [2019-09-10 02:44:52,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87082 to 86427. [2019-09-10 02:44:52,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86427 states. [2019-09-10 02:44:52,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86427 states to 86427 states and 145590 transitions. [2019-09-10 02:44:52,374 INFO L78 Accepts]: Start accepts. Automaton has 86427 states and 145590 transitions. Word has length 248 [2019-09-10 02:44:52,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:44:52,375 INFO L475 AbstractCegarLoop]: Abstraction has 86427 states and 145590 transitions. [2019-09-10 02:44:52,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 02:44:52,375 INFO L276 IsEmpty]: Start isEmpty. Operand 86427 states and 145590 transitions. [2019-09-10 02:44:52,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-10 02:44:52,530 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:44:52,530 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:44:52,530 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:44:52,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:44:52,531 INFO L82 PathProgramCache]: Analyzing trace with hash 744215601, now seen corresponding path program 1 times [2019-09-10 02:44:52,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:44:52,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:52,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:44:52,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:52,532 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:44:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:44:52,693 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-10 02:44:52,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:44:52,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:44:52,694 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:44:52,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:44:52,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:44:52,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:44:52,695 INFO L87 Difference]: Start difference. First operand 86427 states and 145590 transitions. Second operand 5 states. [2019-09-10 02:44:53,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:44:53,257 INFO L93 Difference]: Finished difference Result 87001 states and 146159 transitions. [2019-09-10 02:44:53,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:44:53,258 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 254 [2019-09-10 02:44:53,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:44:53,633 INFO L225 Difference]: With dead ends: 87001 [2019-09-10 02:44:53,633 INFO L226 Difference]: Without dead ends: 86103 [2019-09-10 02:44:53,634 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:44:53,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86103 states. [2019-09-10 02:44:55,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86103 to 85607. [2019-09-10 02:44:55,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85607 states. [2019-09-10 02:44:56,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85607 states to 85607 states and 144169 transitions. [2019-09-10 02:44:56,090 INFO L78 Accepts]: Start accepts. Automaton has 85607 states and 144169 transitions. Word has length 254 [2019-09-10 02:44:56,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:44:56,090 INFO L475 AbstractCegarLoop]: Abstraction has 85607 states and 144169 transitions. [2019-09-10 02:44:56,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:44:56,090 INFO L276 IsEmpty]: Start isEmpty. Operand 85607 states and 144169 transitions. [2019-09-10 02:44:56,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-09-10 02:44:56,245 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:44:56,245 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2019-09-10 02:44:56,245 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:44:56,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:44:56,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1626223319, now seen corresponding path program 1 times [2019-09-10 02:44:56,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:44:56,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:56,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:44:56,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:44:56,247 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:44:56,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:44:56,630 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-10 02:44:56,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:44:56,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 02:44:56,630 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:44:56,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 02:44:56,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 02:44:56,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-09-10 02:44:56,632 INFO L87 Difference]: Start difference. First operand 85607 states and 144169 transitions. Second operand 18 states. [2019-09-10 02:45:13,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:13,586 INFO L93 Difference]: Finished difference Result 87143 states and 146467 transitions. [2019-09-10 02:45:13,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-10 02:45:13,587 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 271 [2019-09-10 02:45:13,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:13,847 INFO L225 Difference]: With dead ends: 87143 [2019-09-10 02:45:13,847 INFO L226 Difference]: Without dead ends: 87143 [2019-09-10 02:45:13,848 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 975 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=423, Invalid=3483, Unknown=0, NotChecked=0, Total=3906 [2019-09-10 02:45:13,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87143 states. [2019-09-10 02:45:15,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87143 to 85594. [2019-09-10 02:45:15,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85594 states. [2019-09-10 02:45:15,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85594 states to 85594 states and 144155 transitions. [2019-09-10 02:45:15,856 INFO L78 Accepts]: Start accepts. Automaton has 85594 states and 144155 transitions. Word has length 271 [2019-09-10 02:45:15,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:15,856 INFO L475 AbstractCegarLoop]: Abstraction has 85594 states and 144155 transitions. [2019-09-10 02:45:15,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 02:45:15,857 INFO L276 IsEmpty]: Start isEmpty. Operand 85594 states and 144155 transitions. [2019-09-10 02:45:16,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-10 02:45:16,011 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:16,011 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:16,012 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:16,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:16,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1922545251, now seen corresponding path program 1 times [2019-09-10 02:45:16,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:16,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:16,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:16,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:16,013 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:16,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:16,158 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-10 02:45:16,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:16,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:45:16,159 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:16,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:45:16,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:45:16,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:45:16,160 INFO L87 Difference]: Start difference. First operand 85594 states and 144155 transitions. Second operand 6 states. [2019-09-10 02:45:16,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:16,960 INFO L93 Difference]: Finished difference Result 85774 states and 143936 transitions. [2019-09-10 02:45:16,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:45:16,960 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 255 [2019-09-10 02:45:16,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:17,199 INFO L225 Difference]: With dead ends: 85774 [2019-09-10 02:45:17,199 INFO L226 Difference]: Without dead ends: 85774 [2019-09-10 02:45:17,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:45:17,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85774 states. [2019-09-10 02:45:19,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85774 to 85686. [2019-09-10 02:45:19,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85686 states. [2019-09-10 02:45:19,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85686 states to 85686 states and 143828 transitions. [2019-09-10 02:45:19,483 INFO L78 Accepts]: Start accepts. Automaton has 85686 states and 143828 transitions. Word has length 255 [2019-09-10 02:45:19,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:19,484 INFO L475 AbstractCegarLoop]: Abstraction has 85686 states and 143828 transitions. [2019-09-10 02:45:19,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:45:19,485 INFO L276 IsEmpty]: Start isEmpty. Operand 85686 states and 143828 transitions. [2019-09-10 02:45:19,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-09-10 02:45:19,656 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:19,657 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:19,657 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:19,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:19,658 INFO L82 PathProgramCache]: Analyzing trace with hash 101291153, now seen corresponding path program 1 times [2019-09-10 02:45:19,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:19,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:19,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:19,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:19,659 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:19,810 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-10 02:45:19,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:19,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:45:19,811 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:19,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:45:19,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:45:19,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:45:19,812 INFO L87 Difference]: Start difference. First operand 85686 states and 143828 transitions. Second operand 5 states. [2019-09-10 02:45:20,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:20,134 INFO L93 Difference]: Finished difference Result 75496 states and 130080 transitions. [2019-09-10 02:45:20,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:45:20,135 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 270 [2019-09-10 02:45:20,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:20,361 INFO L225 Difference]: With dead ends: 75496 [2019-09-10 02:45:20,361 INFO L226 Difference]: Without dead ends: 75478 [2019-09-10 02:45:20,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:45:20,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75478 states. [2019-09-10 02:45:22,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75478 to 72369. [2019-09-10 02:45:22,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72369 states. [2019-09-10 02:45:22,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72369 states to 72369 states and 125969 transitions. [2019-09-10 02:45:22,540 INFO L78 Accepts]: Start accepts. Automaton has 72369 states and 125969 transitions. Word has length 270 [2019-09-10 02:45:22,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:22,541 INFO L475 AbstractCegarLoop]: Abstraction has 72369 states and 125969 transitions. [2019-09-10 02:45:22,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:45:22,541 INFO L276 IsEmpty]: Start isEmpty. Operand 72369 states and 125969 transitions. [2019-09-10 02:45:22,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-10 02:45:22,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:22,701 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:22,701 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:22,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:22,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1780371785, now seen corresponding path program 1 times [2019-09-10 02:45:22,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:22,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:22,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:22,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:22,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:22,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:22,854 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:45:22,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:22,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:45:22,855 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:22,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:45:22,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:45:22,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:45:22,856 INFO L87 Difference]: Start difference. First operand 72369 states and 125969 transitions. Second operand 6 states. [2019-09-10 02:45:23,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:23,641 INFO L93 Difference]: Finished difference Result 72369 states and 120875 transitions. [2019-09-10 02:45:23,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:45:23,642 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 252 [2019-09-10 02:45:23,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:23,852 INFO L225 Difference]: With dead ends: 72369 [2019-09-10 02:45:23,853 INFO L226 Difference]: Without dead ends: 72369 [2019-09-10 02:45:23,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:45:23,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72369 states. [2019-09-10 02:45:25,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72369 to 72369. [2019-09-10 02:45:25,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72369 states. [2019-09-10 02:45:25,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72369 states to 72369 states and 120875 transitions. [2019-09-10 02:45:25,733 INFO L78 Accepts]: Start accepts. Automaton has 72369 states and 120875 transitions. Word has length 252 [2019-09-10 02:45:25,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:25,734 INFO L475 AbstractCegarLoop]: Abstraction has 72369 states and 120875 transitions. [2019-09-10 02:45:25,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:45:25,734 INFO L276 IsEmpty]: Start isEmpty. Operand 72369 states and 120875 transitions. [2019-09-10 02:45:25,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-09-10 02:45:25,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:25,881 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:25,881 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:25,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:25,881 INFO L82 PathProgramCache]: Analyzing trace with hash -474105200, now seen corresponding path program 1 times [2019-09-10 02:45:25,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:25,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:25,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:25,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:25,883 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:25,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:26,117 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-10 02:45:26,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:45:26,118 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:45:26,120 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 264 with the following transitions: [2019-09-10 02:45:26,126 INFO L207 CegarAbsIntRunner]: [72], [75], [85], [123], [139], [142], [143], [146], [155], [156], [157], [159], [241], [244], [250], [269], [271], [275], [278], [279], [280], [283], [289], [316], [319], [328], [349], [351], [352], [355], [365], [368], [370], [373], [375], [377], [431], [434], [443], [548], [551], [561], [612], [614], [617], [619], [621], [622], [623], [625], [626], [627], [645], [648], [662], [672], [675], [689], [728], [729], [730], [732], [734], [737], [741], [744], [746], [747], [749], [752], [756], [780], [784], [787], [795], [798], [830], [864], [873], [877], [879], [881], [884], [887], [889], [891], [898], [901], [1073], [1076], [1079], [1110], [1111], [1114], [1117], [1161], [1162], [1165], [1168], [1171], [1215], [1234], [1238], [1249], [1252], [1253], [1256], [1259], [1290], [1291], [1293], [1295], [1298], [1306], [1308], [1377], [1380], [1386], [1421], [1424], [1438], [1444], [1447], [1456], [1472], [1475], [1478], [1509], [1523], [1526], [1528], [1530], [1532], [1537], [1547], [1549], [1550], [1670], [1672], [1674], [1676], [1677], [1707], [1717], [1718], [1719], [1720], [1721], [1722], [1725], [1726], [1727], [1728], [1729], [1731], [1732], [1733], [1734], [1751], [1752], [1753], [1754], [1755], [1756], [1785], [1786], [1787], [1788], [1789], [1790], [1791], [1792], [1793], [1794], [1795], [1796], [1817], [1818], [1819], [1820], [1821], [1823], [1824], [1829], [1830], [1831], [1832], [1833], [1834], [1835], [1836], [1837], [1839], [1840], [1841], [1842], [1857], [1875], [1876], [1893], [1895], [1896], [1897], [1899], [1900], [1901], [1902], [1903], [1904], [1905], [1906], [1907], [1908], [1909], [1910], [1911], [1913], [1914], [1915], [1921], [1922], [1923], [1924], [1925], [1926], [1927], [1931], [1932], [1937], [1938], [1939], [1940], [1941], [1942], [1943], [1944], [1945] [2019-09-10 02:45:26,211 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:45:26,212 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:45:26,361 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 02:45:26,363 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 196 root evaluator evaluations with a maximum evaluation depth of 0. Performed 196 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 386 variables. [2019-09-10 02:45:26,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:26,368 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 02:45:26,519 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-10 02:45:26,519 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 02:45:26,527 INFO L420 sIntCurrentIteration]: We unified 262 AI predicates to 262 [2019-09-10 02:45:26,528 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 02:45:26,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 02:45:26,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 7 [2019-09-10 02:45:26,530 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:26,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:45:26,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:45:26,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:45:26,532 INFO L87 Difference]: Start difference. First operand 72369 states and 120875 transitions. Second operand 2 states. [2019-09-10 02:45:26,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:26,533 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-10 02:45:26,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:45:26,534 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 263 [2019-09-10 02:45:26,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:26,534 INFO L225 Difference]: With dead ends: 2 [2019-09-10 02:45:26,534 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 02:45:26,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:45:26,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 02:45:26,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 02:45:26,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 02:45:26,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 02:45:26,535 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 263 [2019-09-10 02:45:26,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:26,535 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 02:45:26,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:45:26,536 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 02:45:26,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 02:45:26,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 02:45:26 BoogieIcfgContainer [2019-09-10 02:45:26,542 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 02:45:26,545 INFO L168 Benchmark]: Toolchain (without parser) took 139932.25 ms. Allocated memory was 134.7 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 86.5 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-09-10 02:45:26,546 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 134.7 MB. Free memory was 109.2 MB in the beginning and 109.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 02:45:26,548 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1222.30 ms. Allocated memory was 134.7 MB in the beginning and 202.4 MB in the end (delta: 67.6 MB). Free memory was 86.3 MB in the beginning and 128.8 MB in the end (delta: -42.5 MB). Peak memory consumption was 33.6 MB. Max. memory is 7.1 GB. [2019-09-10 02:45:26,554 INFO L168 Benchmark]: Boogie Preprocessor took 245.59 ms. Allocated memory is still 202.4 MB. Free memory was 128.8 MB in the beginning and 119.8 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. [2019-09-10 02:45:26,555 INFO L168 Benchmark]: RCFGBuilder took 2178.69 ms. Allocated memory was 202.4 MB in the beginning and 259.5 MB in the end (delta: 57.1 MB). Free memory was 119.8 MB in the beginning and 140.4 MB in the end (delta: -20.6 MB). Peak memory consumption was 78.2 MB. Max. memory is 7.1 GB. [2019-09-10 02:45:26,556 INFO L168 Benchmark]: TraceAbstraction took 136281.55 ms. Allocated memory was 259.5 MB in the beginning and 2.9 GB in the end (delta: 2.6 GB). Free memory was 138.4 MB in the beginning and 1.7 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-09-10 02:45:26,569 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.22 ms. Allocated memory is still 134.7 MB. Free memory was 109.2 MB in the beginning and 109.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1222.30 ms. Allocated memory was 134.7 MB in the beginning and 202.4 MB in the end (delta: 67.6 MB). Free memory was 86.3 MB in the beginning and 128.8 MB in the end (delta: -42.5 MB). Peak memory consumption was 33.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 245.59 ms. Allocated memory is still 202.4 MB. Free memory was 128.8 MB in the beginning and 119.8 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2178.69 ms. Allocated memory was 202.4 MB in the beginning and 259.5 MB in the end (delta: 57.1 MB). Free memory was 119.8 MB in the beginning and 140.4 MB in the end (delta: -20.6 MB). Peak memory consumption was 78.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 136281.55 ms. Allocated memory was 259.5 MB in the beginning and 2.9 GB in the end (delta: 2.6 GB). Free memory was 138.4 MB in the beginning and 1.7 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1300]: 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 116 procedures, 800 locations, 1 error locations. SAFE Result, 136.2s OverallTime, 26 OverallIterations, 4 TraceHistogramMax, 89.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 21187 SDtfs, 20724 SDslu, 78804 SDs, 0 SdLazy, 73848 SolverSat, 7337 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 62.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 793 GetRequests, 403 SyntacticMatches, 0 SemanticMatches, 390 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3539 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91932occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 2.0229007633587788 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 29.9s AutomataMinimizationTime, 26 MinimizatonAttempts, 34131 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 6140 NumberOfCodeBlocks, 6140 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 6114 ConstructedInterpolants, 0 QuantifiedInterpolants, 1921616 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 25 PerfectInterpolantSequences, 1142/1145 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...