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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/email_spec1_product33.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:58:45,193 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:58:45,195 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:58:45,206 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:58:45,207 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:58:45,208 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:58:45,209 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:58:45,211 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:58:45,213 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:58:45,214 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:58:45,215 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:58:45,216 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:58:45,216 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:58:45,217 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:58:45,218 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:58:45,219 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:58:45,220 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:58:45,221 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:58:45,222 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:58:45,224 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:58:45,226 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:58:45,227 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:58:45,228 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:58:45,229 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:58:45,231 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:58:45,231 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:58:45,232 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:58:45,232 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:58:45,233 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:58:45,234 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:58:45,234 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:58:45,235 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:58:45,236 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:58:45,237 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:58:45,238 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:58:45,238 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:58:45,238 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:58:45,239 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:58:45,239 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:58:45,240 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:58:45,240 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:58:45,241 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 12:58:45,256 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:58:45,256 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:58:45,257 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:58:45,257 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:58:45,258 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:58:45,258 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:58:45,258 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:58:45,258 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:58:45,258 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:58:45,259 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:58:45,259 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:58:45,259 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:58:45,259 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:58:45,259 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:58:45,260 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:58:45,260 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:58:45,260 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:58:45,260 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:58:45,260 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:58:45,261 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:58:45,261 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:58:45,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:58:45,261 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:58:45,261 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:58:45,262 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:58:45,262 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:58:45,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:58:45,262 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:58:45,262 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:58:45,292 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:58:45,304 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:58:45,308 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:58:45,309 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:58:45,309 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:58:45,310 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec1_product33.cil.c [2019-10-02 12:58:45,384 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/773358b04/79b173ad19cb472b9dc1a8c29c8f1fbb/FLAGc3212b294 [2019-10-02 12:58:46,005 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:58:46,010 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec1_product33.cil.c [2019-10-02 12:58:46,038 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/773358b04/79b173ad19cb472b9dc1a8c29c8f1fbb/FLAGc3212b294 [2019-10-02 12:58:46,194 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/773358b04/79b173ad19cb472b9dc1a8c29c8f1fbb [2019-10-02 12:58:46,204 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:58:46,206 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:58:46,207 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:58:46,207 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:58:46,210 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:58:46,211 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:58:46" (1/1) ... [2019-10-02 12:58:46,214 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@247dfb19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:58:46, skipping insertion in model container [2019-10-02 12:58:46,214 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:58:46" (1/1) ... [2019-10-02 12:58:46,220 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:58:46,289 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:58:47,100 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:58:47,127 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:58:47,242 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:58:47,345 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:58:47,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:58:47 WrapperNode [2019-10-02 12:58:47,346 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:58:47,346 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:58:47,347 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:58:47,347 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:58:47,360 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:58:47" (1/1) ... [2019-10-02 12:58:47,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:58:47" (1/1) ... [2019-10-02 12:58:47,392 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:58:47" (1/1) ... [2019-10-02 12:58:47,393 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:58:47" (1/1) ... [2019-10-02 12:58:47,450 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:58:47" (1/1) ... [2019-10-02 12:58:47,472 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:58:47" (1/1) ... [2019-10-02 12:58:47,486 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:58:47" (1/1) ... [2019-10-02 12:58:47,506 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:58:47,507 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:58:47,507 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:58:47,510 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:58:47,511 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:58:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:58:47,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:58:47,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:58:47,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:58:47,616 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:58:47,617 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 12:58:47,618 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 12:58:47,618 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AutoResponder [2019-10-02 12:58:47,618 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Forward [2019-10-02 12:58:47,618 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 12:58:47,618 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 12:58:47,619 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 12:58:47,619 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 12:58:47,620 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 12:58:47,620 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:58:47,621 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:58:47,621 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:58:47,624 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:58:47,624 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:58:47,624 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:58:47,624 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:58:47,625 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:58:47,625 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:58:47,626 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:58:47,626 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:58:47,626 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 12:58:47,626 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 12:58:47,626 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-10-02 12:58:47,627 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 12:58:47,627 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 12:58:47,627 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-10-02 12:58:47,627 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-10-02 12:58:47,627 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-10-02 12:58:47,627 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-10-02 12:58:47,627 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 12:58:47,628 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 12:58:47,628 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 12:58:47,628 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 12:58:47,628 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 12:58:47,628 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 12:58:47,628 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 12:58:47,628 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 12:58:47,629 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 12:58:47,629 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-02 12:58:47,629 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-02 12:58:47,629 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-02 12:58:47,630 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-02 12:58:47,630 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__AddressBookEncrypt_spec__1 [2019-10-02 12:58:47,630 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 12:58:47,630 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 12:58:47,630 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 12:58:47,630 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 12:58:47,631 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 12:58:47,631 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 12:58:47,631 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 12:58:47,631 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 12:58:47,631 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 12:58:47,631 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 12:58:47,632 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 12:58:47,632 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 12:58:47,632 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 12:58:47,632 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 12:58:47,632 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 12:58:47,632 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 12:58:47,632 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 12:58:47,633 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 12:58:47,633 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 12:58:47,633 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 12:58:47,633 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 12:58:47,633 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 12:58:47,634 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 12:58:47,634 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 12:58:47,634 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 12:58:47,634 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 12:58:47,634 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 12:58:47,635 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 12:58:47,635 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 12:58:47,635 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 12:58:47,635 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 12:58:47,636 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 12:58:47,636 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 12:58:47,636 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 12:58:47,636 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 12:58:47,637 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 12:58:47,637 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 12:58:47,637 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:58:47,637 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:58:47,637 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 12:58:47,638 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 12:58:47,638 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 12:58:47,638 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 12:58:47,638 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 12:58:47,639 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 12:58:47,639 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 12:58:47,639 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 12:58:47,640 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 12:58:47,640 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-02 12:58:47,640 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-02 12:58:47,640 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 12:58:47,640 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 12:58:47,640 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 12:58:47,640 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 12:58:47,641 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 12:58:47,641 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 12:58:47,641 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 12:58:47,641 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 12:58:47,641 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 12:58:47,641 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 12:58:47,641 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 12:58:47,642 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 12:58:47,642 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 12:58:47,642 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 12:58:47,642 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 12:58:47,642 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 12:58:47,642 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 12:58:47,642 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 12:58:47,643 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 12:58:47,643 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 12:58:47,643 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 12:58:47,644 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:58:47,644 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:58:47,644 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:58:47,644 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:58:47,645 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 12:58:47,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:58:47,646 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 12:58:47,646 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 12:58:47,646 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 12:58:47,646 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 12:58:47,646 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 12:58:47,646 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 12:58:47,647 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 12:58:47,647 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 12:58:47,647 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 12:58:47,648 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 12:58:47,648 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 12:58:47,648 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 12:58:47,648 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 12:58:47,649 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 12:58:47,649 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 12:58:47,650 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AutoResponder [2019-10-02 12:58:47,653 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Forward [2019-10-02 12:58:47,656 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 12:58:47,656 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:58:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:58:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:58:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:58:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:58:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:58:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:58:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:58:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:58:47,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:58:47,664 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:58:47,664 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:58:47,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:58:47,665 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:58:47,665 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:58:47,665 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:58:47,665 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 12:58:47,665 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-02 12:58:47,666 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 12:58:47,666 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 12:58:47,666 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 12:58:47,666 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-02 12:58:47,666 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 12:58:47,666 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 12:58:47,667 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 12:58:47,667 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 12:58:47,667 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:58:47,667 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:58:47,667 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:58:47,667 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:58:47,668 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:58:47,668 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 12:58:47,668 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 12:58:47,668 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 12:58:47,668 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 12:58:47,668 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 12:58:47,668 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 12:58:47,669 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 12:58:47,669 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 12:58:47,669 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 12:58:47,669 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 12:58:47,669 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 12:58:47,669 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 12:58:47,670 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 12:58:47,670 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 12:58:47,670 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 12:58:47,670 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 12:58:47,670 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 12:58:47,670 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 12:58:47,670 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 12:58:47,671 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 12:58:47,671 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 12:58:47,671 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 12:58:47,671 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 12:58:47,671 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 12:58:47,671 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 12:58:47,672 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-02 12:58:47,672 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-02 12:58:47,672 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-02 12:58:47,672 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-02 12:58:47,672 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__AddressBookEncrypt_spec__1 [2019-10-02 12:58:47,672 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 12:58:47,672 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-10-02 12:58:47,673 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-10-02 12:58:47,673 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-10-02 12:58:47,673 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-10-02 12:58:47,673 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-10-02 12:58:47,673 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 12:58:47,673 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 12:58:47,674 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 12:58:47,674 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 12:58:47,674 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 12:58:47,674 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 12:58:47,674 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 12:58:47,674 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 12:58:47,674 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 12:58:47,675 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 12:58:47,675 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 12:58:47,675 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 12:58:47,675 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 12:58:47,675 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 12:58:47,675 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 12:58:47,676 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 12:58:47,676 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 12:58:47,676 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 12:58:47,676 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 12:58:47,676 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 12:58:47,676 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 12:58:47,677 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 12:58:47,677 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 12:58:47,677 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 12:58:47,677 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 12:58:47,677 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 12:58:47,677 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:58:47,677 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:58:47,678 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 12:58:47,678 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 12:58:47,678 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 12:58:47,678 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 12:58:47,678 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 12:58:47,678 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 12:58:47,679 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 12:58:47,679 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 12:58:47,679 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 12:58:47,679 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 12:58:47,679 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 12:58:47,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:58:47,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:58:47,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:58:49,971 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:58:49,972 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 12:58:49,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:58:49 BoogieIcfgContainer [2019-10-02 12:58:49,974 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:58:49,975 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:58:49,976 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:58:49,979 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:58:49,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:58:46" (1/3) ... [2019-10-02 12:58:49,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a9e7a15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:58:49, skipping insertion in model container [2019-10-02 12:58:49,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:58:47" (2/3) ... [2019-10-02 12:58:49,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a9e7a15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:58:49, skipping insertion in model container [2019-10-02 12:58:49,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:58:49" (3/3) ... [2019-10-02 12:58:49,984 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec1_product33.cil.c [2019-10-02 12:58:49,995 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:58:50,011 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:58:50,029 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:58:50,080 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:58:50,081 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:58:50,081 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:58:50,081 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:58:50,081 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:58:50,085 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:58:50,085 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:58:50,085 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:58:50,085 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:58:50,124 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states. [2019-10-02 12:58:50,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-02 12:58:50,151 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:58:50,152 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-02 12:58:50,155 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:58:50,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:58:50,160 INFO L82 PathProgramCache]: Analyzing trace with hash 855060391, now seen corresponding path program 1 times [2019-10-02 12:58:50,162 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:58:50,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:58:50,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:50,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:58:50,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:58:50,823 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 12:58:50,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:58:50,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 12:58:50,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 12:58:50,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 12:58:50,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 12:58:50,848 INFO L87 Difference]: Start difference. First operand 590 states. Second operand 2 states. [2019-10-02 12:58:50,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:58:50,985 INFO L93 Difference]: Finished difference Result 911 states and 1196 transitions. [2019-10-02 12:58:50,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 12:58:50,989 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 158 [2019-10-02 12:58:50,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:58:51,025 INFO L225 Difference]: With dead ends: 911 [2019-10-02 12:58:51,026 INFO L226 Difference]: Without dead ends: 567 [2019-10-02 12:58:51,032 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 12:58:51,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2019-10-02 12:58:51,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2019-10-02 12:58:51,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2019-10-02 12:58:51,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 749 transitions. [2019-10-02 12:58:51,138 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 749 transitions. Word has length 158 [2019-10-02 12:58:51,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:58:51,140 INFO L475 AbstractCegarLoop]: Abstraction has 567 states and 749 transitions. [2019-10-02 12:58:51,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 12:58:51,141 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 749 transitions. [2019-10-02 12:58:51,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-02 12:58:51,147 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:58:51,147 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-02 12:58:51,148 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:58:51,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:58:51,150 INFO L82 PathProgramCache]: Analyzing trace with hash -66196826, now seen corresponding path program 1 times [2019-10-02 12:58:51,150 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:58:51,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:58:51,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:51,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:58:51,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:51,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:58:51,439 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 12:58:51,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:58:51,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:58:51,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:58:51,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:58:51,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:58:51,448 INFO L87 Difference]: Start difference. First operand 567 states and 749 transitions. Second operand 3 states. [2019-10-02 12:58:51,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:58:51,518 INFO L93 Difference]: Finished difference Result 894 states and 1164 transitions. [2019-10-02 12:58:51,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:58:51,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-10-02 12:58:51,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:58:51,524 INFO L225 Difference]: With dead ends: 894 [2019-10-02 12:58:51,524 INFO L226 Difference]: Without dead ends: 570 [2019-10-02 12:58:51,527 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:58:51,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-10-02 12:58:51,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 569. [2019-10-02 12:58:51,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2019-10-02 12:58:51,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 751 transitions. [2019-10-02 12:58:51,576 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 751 transitions. Word has length 159 [2019-10-02 12:58:51,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:58:51,577 INFO L475 AbstractCegarLoop]: Abstraction has 569 states and 751 transitions. [2019-10-02 12:58:51,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:58:51,577 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 751 transitions. [2019-10-02 12:58:51,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-02 12:58:51,581 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:58:51,581 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:58:51,581 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:58:51,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:58:51,582 INFO L82 PathProgramCache]: Analyzing trace with hash -868266921, now seen corresponding path program 1 times [2019-10-02 12:58:51,582 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:58:51,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:58:51,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:51,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:58:51,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:51,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:58:51,757 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 12:58:51,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:58:51,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:58:51,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:58:51,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:58:51,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:58:51,766 INFO L87 Difference]: Start difference. First operand 569 states and 751 transitions. Second operand 3 states. [2019-10-02 12:58:51,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:58:51,805 INFO L93 Difference]: Finished difference Result 1116 states and 1503 transitions. [2019-10-02 12:58:51,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:58:51,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-10-02 12:58:51,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:58:51,810 INFO L225 Difference]: With dead ends: 1116 [2019-10-02 12:58:51,810 INFO L226 Difference]: Without dead ends: 612 [2019-10-02 12:58:51,812 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:58:51,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-10-02 12:58:51,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 611. [2019-10-02 12:58:51,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-10-02 12:58:51,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 823 transitions. [2019-10-02 12:58:51,842 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 823 transitions. Word has length 171 [2019-10-02 12:58:51,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:58:51,843 INFO L475 AbstractCegarLoop]: Abstraction has 611 states and 823 transitions. [2019-10-02 12:58:51,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:58:51,843 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 823 transitions. [2019-10-02 12:58:51,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-02 12:58:51,847 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:58:51,847 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-02 12:58:51,847 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:58:51,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:58:51,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1221959654, now seen corresponding path program 1 times [2019-10-02 12:58:51,848 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:58:51,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:58:51,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:51,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:58:51,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:51,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:58:52,021 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 12:58:52,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:58:52,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:58:52,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:58:52,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:58:52,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:58:52,025 INFO L87 Difference]: Start difference. First operand 611 states and 823 transitions. Second operand 3 states. [2019-10-02 12:58:52,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:58:52,078 INFO L93 Difference]: Finished difference Result 1239 states and 1714 transitions. [2019-10-02 12:58:52,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:58:52,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-10-02 12:58:52,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:58:52,089 INFO L225 Difference]: With dead ends: 1239 [2019-10-02 12:58:52,089 INFO L226 Difference]: Without dead ends: 693 [2019-10-02 12:58:52,092 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:58:52,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2019-10-02 12:58:52,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 692. [2019-10-02 12:58:52,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 692 states. [2019-10-02 12:58:52,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 961 transitions. [2019-10-02 12:58:52,142 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 961 transitions. Word has length 172 [2019-10-02 12:58:52,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:58:52,143 INFO L475 AbstractCegarLoop]: Abstraction has 692 states and 961 transitions. [2019-10-02 12:58:52,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:58:52,144 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 961 transitions. [2019-10-02 12:58:52,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-02 12:58:52,152 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:58:52,153 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-02 12:58:52,153 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:58:52,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:58:52,154 INFO L82 PathProgramCache]: Analyzing trace with hash 946259743, now seen corresponding path program 1 times [2019-10-02 12:58:52,154 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:58:52,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:58:52,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:52,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:58:52,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:52,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:58:53,659 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:58:53,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:58:53,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2019-10-02 12:58:53,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-02 12:58:53,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-02 12:58:53,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1717, Unknown=0, NotChecked=0, Total=1806 [2019-10-02 12:58:53,662 INFO L87 Difference]: Start difference. First operand 692 states and 961 transitions. Second operand 43 states. [2019-10-02 12:59:30,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:30,458 INFO L93 Difference]: Finished difference Result 6642 states and 9325 transitions. [2019-10-02 12:59:30,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2019-10-02 12:59:30,460 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 175 [2019-10-02 12:59:30,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:30,502 INFO L225 Difference]: With dead ends: 6642 [2019-10-02 12:59:30,503 INFO L226 Difference]: Without dead ends: 5724 [2019-10-02 12:59:30,523 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17664 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=2814, Invalid=49856, Unknown=0, NotChecked=0, Total=52670 [2019-10-02 12:59:30,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5724 states. [2019-10-02 12:59:30,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5724 to 5590. [2019-10-02 12:59:30,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5590 states. [2019-10-02 12:59:30,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5590 states to 5590 states and 7796 transitions. [2019-10-02 12:59:30,912 INFO L78 Accepts]: Start accepts. Automaton has 5590 states and 7796 transitions. Word has length 175 [2019-10-02 12:59:30,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:30,913 INFO L475 AbstractCegarLoop]: Abstraction has 5590 states and 7796 transitions. [2019-10-02 12:59:30,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-02 12:59:30,913 INFO L276 IsEmpty]: Start isEmpty. Operand 5590 states and 7796 transitions. [2019-10-02 12:59:30,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-02 12:59:30,934 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:30,934 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:59:30,935 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:30,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:30,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1050161906, now seen corresponding path program 1 times [2019-10-02 12:59:30,936 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:30,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:30,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:30,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:59:30,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:31,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:31,165 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 12:59:31,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:59:31,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:59:31,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:59:31,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:59:31,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:59:31,168 INFO L87 Difference]: Start difference. First operand 5590 states and 7796 transitions. Second operand 3 states. [2019-10-02 12:59:31,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:31,372 INFO L93 Difference]: Finished difference Result 11998 states and 17144 transitions. [2019-10-02 12:59:31,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:59:31,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-10-02 12:59:31,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:31,414 INFO L225 Difference]: With dead ends: 11998 [2019-10-02 12:59:31,415 INFO L226 Difference]: Without dead ends: 6532 [2019-10-02 12:59:31,434 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:59:31,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6532 states. [2019-10-02 12:59:31,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6532 to 6526. [2019-10-02 12:59:31,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6526 states. [2019-10-02 12:59:31,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6526 states to 6526 states and 9466 transitions. [2019-10-02 12:59:31,764 INFO L78 Accepts]: Start accepts. Automaton has 6526 states and 9466 transitions. Word has length 175 [2019-10-02 12:59:31,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:31,766 INFO L475 AbstractCegarLoop]: Abstraction has 6526 states and 9466 transitions. [2019-10-02 12:59:31,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:59:31,766 INFO L276 IsEmpty]: Start isEmpty. Operand 6526 states and 9466 transitions. [2019-10-02 12:59:31,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-02 12:59:31,788 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:31,788 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:59:31,789 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:31,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:31,789 INFO L82 PathProgramCache]: Analyzing trace with hash 928116617, now seen corresponding path program 1 times [2019-10-02 12:59:31,789 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:31,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:31,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:31,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:59:31,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:31,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:32,067 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:59:32,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:59:32,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:59:32,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:59:32,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:59:32,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:59:32,069 INFO L87 Difference]: Start difference. First operand 6526 states and 9466 transitions. Second operand 11 states. [2019-10-02 12:59:32,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:32,553 INFO L93 Difference]: Finished difference Result 10236 states and 14259 transitions. [2019-10-02 12:59:32,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:59:32,554 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 178 [2019-10-02 12:59:32,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:32,600 INFO L225 Difference]: With dead ends: 10236 [2019-10-02 12:59:32,600 INFO L226 Difference]: Without dead ends: 6654 [2019-10-02 12:59:32,615 INFO L640 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-10-02 12:59:32,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6654 states. [2019-10-02 12:59:32,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6654 to 6648. [2019-10-02 12:59:32,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6648 states. [2019-10-02 12:59:33,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6648 states to 6648 states and 9662 transitions. [2019-10-02 12:59:33,011 INFO L78 Accepts]: Start accepts. Automaton has 6648 states and 9662 transitions. Word has length 178 [2019-10-02 12:59:33,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:33,012 INFO L475 AbstractCegarLoop]: Abstraction has 6648 states and 9662 transitions. [2019-10-02 12:59:33,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:59:33,012 INFO L276 IsEmpty]: Start isEmpty. Operand 6648 states and 9662 transitions. [2019-10-02 12:59:33,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-02 12:59:33,033 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:33,034 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:59:33,034 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:33,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:33,034 INFO L82 PathProgramCache]: Analyzing trace with hash -520482373, now seen corresponding path program 1 times [2019-10-02 12:59:33,035 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:33,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:33,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:33,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:59:33,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:33,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:33,192 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:59:33,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:59:33,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:59:33,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:59:33,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:59:33,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:59:33,194 INFO L87 Difference]: Start difference. First operand 6648 states and 9662 transitions. Second operand 5 states. [2019-10-02 12:59:34,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:34,436 INFO L93 Difference]: Finished difference Result 15287 states and 21640 transitions. [2019-10-02 12:59:34,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:59:34,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 178 [2019-10-02 12:59:34,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:34,529 INFO L225 Difference]: With dead ends: 15287 [2019-10-02 12:59:34,529 INFO L226 Difference]: Without dead ends: 13524 [2019-10-02 12:59:34,543 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:59:34,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13524 states. [2019-10-02 12:59:35,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13524 to 13466. [2019-10-02 12:59:35,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13466 states. [2019-10-02 12:59:35,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13466 states to 13466 states and 19247 transitions. [2019-10-02 12:59:35,267 INFO L78 Accepts]: Start accepts. Automaton has 13466 states and 19247 transitions. Word has length 178 [2019-10-02 12:59:35,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:35,267 INFO L475 AbstractCegarLoop]: Abstraction has 13466 states and 19247 transitions. [2019-10-02 12:59:35,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:59:35,268 INFO L276 IsEmpty]: Start isEmpty. Operand 13466 states and 19247 transitions. [2019-10-02 12:59:35,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-02 12:59:35,300 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:35,301 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:59:35,301 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:35,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:35,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1764381082, now seen corresponding path program 1 times [2019-10-02 12:59:35,302 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:35,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:35,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:35,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:59:35,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:35,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:35,766 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 12:59:35,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:59:35,766 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:59:35,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:59:36,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:36,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 2737 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 12:59:36,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:59:36,553 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:59:36,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:59:36,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [22] total 26 [2019-10-02 12:59:36,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 12:59:36,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 12:59:36,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2019-10-02 12:59:36,567 INFO L87 Difference]: Start difference. First operand 13466 states and 19247 transitions. Second operand 26 states. [2019-10-02 12:59:42,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:42,691 INFO L93 Difference]: Finished difference Result 23077 states and 32916 transitions. [2019-10-02 12:59:42,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-02 12:59:42,691 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 178 [2019-10-02 12:59:42,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:42,745 INFO L225 Difference]: With dead ends: 23077 [2019-10-02 12:59:42,745 INFO L226 Difference]: Without dead ends: 11145 [2019-10-02 12:59:42,784 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=366, Invalid=3666, Unknown=0, NotChecked=0, Total=4032 [2019-10-02 12:59:42,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11145 states. [2019-10-02 12:59:43,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11145 to 11113. [2019-10-02 12:59:43,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11113 states. [2019-10-02 12:59:43,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11113 states to 11113 states and 16160 transitions. [2019-10-02 12:59:43,487 INFO L78 Accepts]: Start accepts. Automaton has 11113 states and 16160 transitions. Word has length 178 [2019-10-02 12:59:43,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:43,490 INFO L475 AbstractCegarLoop]: Abstraction has 11113 states and 16160 transitions. [2019-10-02 12:59:43,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 12:59:43,490 INFO L276 IsEmpty]: Start isEmpty. Operand 11113 states and 16160 transitions. [2019-10-02 12:59:43,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-02 12:59:43,519 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:43,519 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:59:43,520 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:43,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:43,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1334189437, now seen corresponding path program 1 times [2019-10-02 12:59:43,520 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:43,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:43,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:43,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:59:43,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:43,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:43,765 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:59:43,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:59:43,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:59:43,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:59:43,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:59:43,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:59:43,768 INFO L87 Difference]: Start difference. First operand 11113 states and 16160 transitions. Second operand 11 states. [2019-10-02 12:59:44,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:44,304 INFO L93 Difference]: Finished difference Result 15406 states and 21667 transitions. [2019-10-02 12:59:44,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:59:44,305 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 179 [2019-10-02 12:59:44,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:44,340 INFO L225 Difference]: With dead ends: 15406 [2019-10-02 12:59:44,341 INFO L226 Difference]: Without dead ends: 8964 [2019-10-02 12:59:44,363 INFO L640 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-10-02 12:59:44,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8964 states. [2019-10-02 12:59:44,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8964 to 8942. [2019-10-02 12:59:44,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8942 states. [2019-10-02 12:59:44,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8942 states to 8942 states and 13309 transitions. [2019-10-02 12:59:44,795 INFO L78 Accepts]: Start accepts. Automaton has 8942 states and 13309 transitions. Word has length 179 [2019-10-02 12:59:44,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:44,796 INFO L475 AbstractCegarLoop]: Abstraction has 8942 states and 13309 transitions. [2019-10-02 12:59:44,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:59:44,796 INFO L276 IsEmpty]: Start isEmpty. Operand 8942 states and 13309 transitions. [2019-10-02 12:59:44,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-02 12:59:44,823 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:44,824 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:59:44,824 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:44,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:44,824 INFO L82 PathProgramCache]: Analyzing trace with hash 418269095, now seen corresponding path program 1 times [2019-10-02 12:59:44,825 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:44,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:44,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:44,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:59:44,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:44,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:44,957 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:59:44,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:59:44,958 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:59:45,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:59:46,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:46,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 2740 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 12:59:46,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:59:46,241 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 12:59:46,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:59:46,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-10-02 12:59:46,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:59:46,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:59:46,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:59:46,249 INFO L87 Difference]: Start difference. First operand 8942 states and 13309 transitions. Second operand 12 states. [2019-10-02 12:59:47,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:47,685 INFO L93 Difference]: Finished difference Result 16359 states and 24028 transitions. [2019-10-02 12:59:47,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:59:47,685 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 180 [2019-10-02 12:59:47,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:47,713 INFO L225 Difference]: With dead ends: 16359 [2019-10-02 12:59:47,714 INFO L226 Difference]: Without dead ends: 7483 [2019-10-02 12:59:47,737 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:59:47,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7483 states. [2019-10-02 12:59:48,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7483 to 7457. [2019-10-02 12:59:48,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7457 states. [2019-10-02 12:59:48,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7457 states to 7457 states and 10768 transitions. [2019-10-02 12:59:48,040 INFO L78 Accepts]: Start accepts. Automaton has 7457 states and 10768 transitions. Word has length 180 [2019-10-02 12:59:48,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:48,041 INFO L475 AbstractCegarLoop]: Abstraction has 7457 states and 10768 transitions. [2019-10-02 12:59:48,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:59:48,041 INFO L276 IsEmpty]: Start isEmpty. Operand 7457 states and 10768 transitions. [2019-10-02 12:59:48,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-10-02 12:59:48,059 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:48,059 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:59:48,059 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:48,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:48,060 INFO L82 PathProgramCache]: Analyzing trace with hash 375730993, now seen corresponding path program 1 times [2019-10-02 12:59:48,060 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:48,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:48,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:48,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:59:48,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:48,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:48,591 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 12:59:48,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:59:48,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-10-02 12:59:48,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 12:59:48,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 12:59:48,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2019-10-02 12:59:48,594 INFO L87 Difference]: Start difference. First operand 7457 states and 10768 transitions. Second operand 26 states. [2019-10-02 12:59:58,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:58,243 INFO L93 Difference]: Finished difference Result 19830 states and 28056 transitions. [2019-10-02 12:59:58,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-10-02 12:59:58,244 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 188 [2019-10-02 12:59:58,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:58,308 INFO L225 Difference]: With dead ends: 19830 [2019-10-02 12:59:58,308 INFO L226 Difference]: Without dead ends: 17192 [2019-10-02 12:59:58,321 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1516 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=724, Invalid=5596, Unknown=0, NotChecked=0, Total=6320 [2019-10-02 12:59:58,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17192 states. [2019-10-02 12:59:59,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17192 to 15132. [2019-10-02 12:59:59,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15132 states. [2019-10-02 12:59:59,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15132 states to 15132 states and 21966 transitions. [2019-10-02 12:59:59,110 INFO L78 Accepts]: Start accepts. Automaton has 15132 states and 21966 transitions. Word has length 188 [2019-10-02 12:59:59,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:59,113 INFO L475 AbstractCegarLoop]: Abstraction has 15132 states and 21966 transitions. [2019-10-02 12:59:59,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 12:59:59,113 INFO L276 IsEmpty]: Start isEmpty. Operand 15132 states and 21966 transitions. [2019-10-02 12:59:59,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-02 12:59:59,150 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:59,150 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:59:59,151 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:59,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:59,151 INFO L82 PathProgramCache]: Analyzing trace with hash 461469428, now seen corresponding path program 1 times [2019-10-02 12:59:59,151 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:59,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:59,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:59,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:59:59,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:59,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:59,319 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:59:59,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:59:59,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:59:59,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:59:59,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:59:59,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:59:59,322 INFO L87 Difference]: Start difference. First operand 15132 states and 21966 transitions. Second operand 5 states. [2019-10-02 12:59:59,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:59,913 INFO L93 Difference]: Finished difference Result 22156 states and 30963 transitions. [2019-10-02 12:59:59,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:59:59,914 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 189 [2019-10-02 12:59:59,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:59,979 INFO L225 Difference]: With dead ends: 22156 [2019-10-02 12:59:59,979 INFO L226 Difference]: Without dead ends: 14088 [2019-10-02 12:59:59,998 INFO L640 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-10-02 13:00:00,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14088 states. [2019-10-02 13:00:00,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14088 to 13982. [2019-10-02 13:00:00,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13982 states. [2019-10-02 13:00:00,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13982 states to 13982 states and 20345 transitions. [2019-10-02 13:00:00,601 INFO L78 Accepts]: Start accepts. Automaton has 13982 states and 20345 transitions. Word has length 189 [2019-10-02 13:00:00,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:00:00,602 INFO L475 AbstractCegarLoop]: Abstraction has 13982 states and 20345 transitions. [2019-10-02 13:00:00,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 13:00:00,602 INFO L276 IsEmpty]: Start isEmpty. Operand 13982 states and 20345 transitions. [2019-10-02 13:00:00,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-02 13:00:00,624 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:00:00,625 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:00:00,625 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:00:00,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:00:00,626 INFO L82 PathProgramCache]: Analyzing trace with hash -380274962, now seen corresponding path program 1 times [2019-10-02 13:00:00,626 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:00:00,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:00:00,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:00,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:00:00,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:00:00,858 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 13:00:00,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:00:00,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 13:00:00,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 13:00:00,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 13:00:00,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 13:00:00,860 INFO L87 Difference]: Start difference. First operand 13982 states and 20345 transitions. Second operand 9 states. [2019-10-02 13:00:01,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:00:01,252 INFO L93 Difference]: Finished difference Result 15811 states and 22697 transitions. [2019-10-02 13:00:01,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 13:00:01,253 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 189 [2019-10-02 13:00:01,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:00:01,281 INFO L225 Difference]: With dead ends: 15811 [2019-10-02 13:00:01,281 INFO L226 Difference]: Without dead ends: 7465 [2019-10-02 13:00:01,299 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-10-02 13:00:01,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7465 states. [2019-10-02 13:00:01,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7465 to 7463. [2019-10-02 13:00:01,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7463 states. [2019-10-02 13:00:01,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7463 states to 7463 states and 10765 transitions. [2019-10-02 13:00:01,605 INFO L78 Accepts]: Start accepts. Automaton has 7463 states and 10765 transitions. Word has length 189 [2019-10-02 13:00:01,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:00:01,605 INFO L475 AbstractCegarLoop]: Abstraction has 7463 states and 10765 transitions. [2019-10-02 13:00:01,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 13:00:01,605 INFO L276 IsEmpty]: Start isEmpty. Operand 7463 states and 10765 transitions. [2019-10-02 13:00:01,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-02 13:00:01,614 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:00:01,614 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:00:01,614 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:00:01,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:00:01,615 INFO L82 PathProgramCache]: Analyzing trace with hash 577908158, now seen corresponding path program 2 times [2019-10-02 13:00:01,615 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:00:01,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:00:01,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:01,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:00:01,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:01,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:00:02,201 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 13:00:02,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:00:02,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-10-02 13:00:02,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 13:00:02,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 13:00:02,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2019-10-02 13:00:02,204 INFO L87 Difference]: Start difference. First operand 7463 states and 10765 transitions. Second operand 24 states. [2019-10-02 13:00:11,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:00:11,233 INFO L93 Difference]: Finished difference Result 19572 states and 27683 transitions. [2019-10-02 13:00:11,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-10-02 13:00:11,234 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 189 [2019-10-02 13:00:11,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:00:11,303 INFO L225 Difference]: With dead ends: 19572 [2019-10-02 13:00:11,303 INFO L226 Difference]: Without dead ends: 16093 [2019-10-02 13:00:11,315 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1656 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=769, Invalid=5711, Unknown=0, NotChecked=0, Total=6480 [2019-10-02 13:00:11,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16093 states. [2019-10-02 13:00:11,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16093 to 13977. [2019-10-02 13:00:11,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13977 states. [2019-10-02 13:00:11,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13977 states to 13977 states and 20337 transitions. [2019-10-02 13:00:11,887 INFO L78 Accepts]: Start accepts. Automaton has 13977 states and 20337 transitions. Word has length 189 [2019-10-02 13:00:11,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:00:11,887 INFO L475 AbstractCegarLoop]: Abstraction has 13977 states and 20337 transitions. [2019-10-02 13:00:11,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 13:00:11,887 INFO L276 IsEmpty]: Start isEmpty. Operand 13977 states and 20337 transitions. [2019-10-02 13:00:11,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-02 13:00:11,904 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:00:11,904 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:00:11,905 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:00:11,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:00:11,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1592249857, now seen corresponding path program 2 times [2019-10-02 13:00:11,905 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:00:11,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:00:11,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:11,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 13:00:11,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:11,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:00:12,046 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 13:00:12,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:00:12,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 13:00:12,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 13:00:12,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 13:00:12,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:00:12,048 INFO L87 Difference]: Start difference. First operand 13977 states and 20337 transitions. Second operand 7 states. [2019-10-02 13:00:12,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:00:12,422 INFO L93 Difference]: Finished difference Result 15804 states and 22687 transitions. [2019-10-02 13:00:12,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 13:00:12,423 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 190 [2019-10-02 13:00:12,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:00:12,448 INFO L225 Difference]: With dead ends: 15804 [2019-10-02 13:00:12,448 INFO L226 Difference]: Without dead ends: 7463 [2019-10-02 13:00:12,465 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-02 13:00:12,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7463 states. [2019-10-02 13:00:12,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7463 to 7463. [2019-10-02 13:00:12,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7463 states. [2019-10-02 13:00:12,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7463 states to 7463 states and 10764 transitions. [2019-10-02 13:00:12,933 INFO L78 Accepts]: Start accepts. Automaton has 7463 states and 10764 transitions. Word has length 190 [2019-10-02 13:00:12,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:00:12,933 INFO L475 AbstractCegarLoop]: Abstraction has 7463 states and 10764 transitions. [2019-10-02 13:00:12,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 13:00:12,933 INFO L276 IsEmpty]: Start isEmpty. Operand 7463 states and 10764 transitions. [2019-10-02 13:00:12,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-02 13:00:12,943 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:00:12,944 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:00:12,944 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:00:12,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:00:12,944 INFO L82 PathProgramCache]: Analyzing trace with hash -986478998, now seen corresponding path program 3 times [2019-10-02 13:00:12,944 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:00:12,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:00:12,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:12,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 13:00:12,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:13,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:00:13,424 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 13:00:13,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:00:13,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-10-02 13:00:13,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 13:00:13,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 13:00:13,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2019-10-02 13:00:13,426 INFO L87 Difference]: Start difference. First operand 7463 states and 10764 transitions. Second operand 26 states. [2019-10-02 13:00:22,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:00:22,519 INFO L93 Difference]: Finished difference Result 19581 states and 27692 transitions. [2019-10-02 13:00:22,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-10-02 13:00:22,519 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 190 [2019-10-02 13:00:22,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:00:22,571 INFO L225 Difference]: With dead ends: 19581 [2019-10-02 13:00:22,572 INFO L226 Difference]: Without dead ends: 16102 [2019-10-02 13:00:22,584 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1511 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=724, Invalid=5596, Unknown=0, NotChecked=0, Total=6320 [2019-10-02 13:00:22,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16102 states. [2019-10-02 13:00:23,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16102 to 13982. [2019-10-02 13:00:23,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13982 states. [2019-10-02 13:00:23,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13982 states to 13982 states and 20342 transitions. [2019-10-02 13:00:23,035 INFO L78 Accepts]: Start accepts. Automaton has 13982 states and 20342 transitions. Word has length 190 [2019-10-02 13:00:23,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:00:23,036 INFO L475 AbstractCegarLoop]: Abstraction has 13982 states and 20342 transitions. [2019-10-02 13:00:23,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 13:00:23,036 INFO L276 IsEmpty]: Start isEmpty. Operand 13982 states and 20342 transitions. [2019-10-02 13:00:23,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-02 13:00:23,051 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:00:23,052 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:00:23,052 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:00:23,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:00:23,052 INFO L82 PathProgramCache]: Analyzing trace with hash 340888277, now seen corresponding path program 3 times [2019-10-02 13:00:23,052 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:00:23,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:00:23,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:23,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 13:00:23,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:00:23,187 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 13:00:23,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:00:23,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 13:00:23,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 13:00:23,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 13:00:23,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 13:00:23,189 INFO L87 Difference]: Start difference. First operand 13982 states and 20342 transitions. Second operand 9 states. [2019-10-02 13:00:23,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:00:23,783 INFO L93 Difference]: Finished difference Result 15813 states and 22696 transitions. [2019-10-02 13:00:23,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 13:00:23,784 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 191 [2019-10-02 13:00:23,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:00:23,812 INFO L225 Difference]: With dead ends: 15813 [2019-10-02 13:00:23,812 INFO L226 Difference]: Without dead ends: 7467 [2019-10-02 13:00:23,831 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-10-02 13:00:23,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7467 states. [2019-10-02 13:00:24,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7467 to 7463. [2019-10-02 13:00:24,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7463 states. [2019-10-02 13:00:24,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7463 states to 7463 states and 10763 transitions. [2019-10-02 13:00:24,071 INFO L78 Accepts]: Start accepts. Automaton has 7463 states and 10763 transitions. Word has length 191 [2019-10-02 13:00:24,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:00:24,071 INFO L475 AbstractCegarLoop]: Abstraction has 7463 states and 10763 transitions. [2019-10-02 13:00:24,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 13:00:24,072 INFO L276 IsEmpty]: Start isEmpty. Operand 7463 states and 10763 transitions. [2019-10-02 13:00:24,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-02 13:00:24,078 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:00:24,078 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:00:24,078 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:00:24,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:00:24,079 INFO L82 PathProgramCache]: Analyzing trace with hash -2108135044, now seen corresponding path program 1 times [2019-10-02 13:00:24,079 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:00:24,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:00:24,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:24,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 13:00:24,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:24,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:00:24,509 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 13:00:24,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:00:24,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-10-02 13:00:24,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 13:00:24,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 13:00:24,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2019-10-02 13:00:24,512 INFO L87 Difference]: Start difference. First operand 7463 states and 10763 transitions. Second operand 24 states. [2019-10-02 13:00:33,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:00:33,631 INFO L93 Difference]: Finished difference Result 24364 states and 35091 transitions. [2019-10-02 13:00:33,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-10-02 13:00:33,631 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 191 [2019-10-02 13:00:33,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:00:33,664 INFO L225 Difference]: With dead ends: 24364 [2019-10-02 13:00:33,665 INFO L226 Difference]: Without dead ends: 16131 [2019-10-02 13:00:33,680 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1709 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=781, Invalid=5861, Unknown=0, NotChecked=0, Total=6642 [2019-10-02 13:00:33,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16131 states. [2019-10-02 13:00:34,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16131 to 13979. [2019-10-02 13:00:34,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13979 states. [2019-10-02 13:00:34,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13979 states to 13979 states and 20332 transitions. [2019-10-02 13:00:34,146 INFO L78 Accepts]: Start accepts. Automaton has 13979 states and 20332 transitions. Word has length 191 [2019-10-02 13:00:34,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:00:34,146 INFO L475 AbstractCegarLoop]: Abstraction has 13979 states and 20332 transitions. [2019-10-02 13:00:34,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 13:00:34,147 INFO L276 IsEmpty]: Start isEmpty. Operand 13979 states and 20332 transitions. [2019-10-02 13:00:34,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-02 13:00:34,167 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:00:34,167 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:00:34,167 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:00:34,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:00:34,168 INFO L82 PathProgramCache]: Analyzing trace with hash -70710781, now seen corresponding path program 1 times [2019-10-02 13:00:34,168 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:00:34,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:00:34,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:34,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:00:34,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:34,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:00:34,299 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 13:00:34,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:00:34,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 13:00:34,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 13:00:34,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 13:00:34,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:00:34,301 INFO L87 Difference]: Start difference. First operand 13979 states and 20332 transitions. Second operand 7 states. [2019-10-02 13:00:34,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:00:34,648 INFO L93 Difference]: Finished difference Result 15830 states and 22706 transitions. [2019-10-02 13:00:34,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 13:00:34,649 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 192 [2019-10-02 13:00:34,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:00:34,664 INFO L225 Difference]: With dead ends: 15830 [2019-10-02 13:00:34,664 INFO L226 Difference]: Without dead ends: 7489 [2019-10-02 13:00:34,675 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-02 13:00:34,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7489 states. [2019-10-02 13:00:34,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7489 to 7465. [2019-10-02 13:00:34,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7465 states. [2019-10-02 13:00:34,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7465 states to 7465 states and 10765 transitions. [2019-10-02 13:00:34,881 INFO L78 Accepts]: Start accepts. Automaton has 7465 states and 10765 transitions. Word has length 192 [2019-10-02 13:00:34,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:00:34,882 INFO L475 AbstractCegarLoop]: Abstraction has 7465 states and 10765 transitions. [2019-10-02 13:00:34,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 13:00:34,882 INFO L276 IsEmpty]: Start isEmpty. Operand 7465 states and 10765 transitions. [2019-10-02 13:00:34,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-02 13:00:34,888 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:00:34,889 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:00:34,889 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:00:34,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:00:34,889 INFO L82 PathProgramCache]: Analyzing trace with hash 25407281, now seen corresponding path program 1 times [2019-10-02 13:00:34,889 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:00:34,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:00:34,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:34,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:00:34,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:34,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:00:35,174 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 13:00:35,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:00:35,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-02 13:00:35,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 13:00:35,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 13:00:35,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:00:35,176 INFO L87 Difference]: Start difference. First operand 7465 states and 10765 transitions. Second operand 18 states. [2019-10-02 13:00:39,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:00:39,950 INFO L93 Difference]: Finished difference Result 12114 states and 16881 transitions. [2019-10-02 13:00:39,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-02 13:00:39,951 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 192 [2019-10-02 13:00:39,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:00:39,967 INFO L225 Difference]: With dead ends: 12114 [2019-10-02 13:00:39,967 INFO L226 Difference]: Without dead ends: 8635 [2019-10-02 13:00:39,973 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1549, Unknown=0, NotChecked=0, Total=1806 [2019-10-02 13:00:39,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8635 states. [2019-10-02 13:00:40,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8635 to 8421. [2019-10-02 13:00:40,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8421 states. [2019-10-02 13:00:40,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8421 states to 8421 states and 12011 transitions. [2019-10-02 13:00:40,205 INFO L78 Accepts]: Start accepts. Automaton has 8421 states and 12011 transitions. Word has length 192 [2019-10-02 13:00:40,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:00:40,205 INFO L475 AbstractCegarLoop]: Abstraction has 8421 states and 12011 transitions. [2019-10-02 13:00:40,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 13:00:40,206 INFO L276 IsEmpty]: Start isEmpty. Operand 8421 states and 12011 transitions. [2019-10-02 13:00:40,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-02 13:00:40,212 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:00:40,212 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:00:40,213 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:00:40,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:00:40,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1644591854, now seen corresponding path program 1 times [2019-10-02 13:00:40,213 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:00:40,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:00:40,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:40,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:00:40,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:40,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:00:40,323 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:00:40,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:00:40,324 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:00:40,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:00:40,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:00:40,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 2785 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 13:00:40,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:00:40,910 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:00:40,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:00:40,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-02 13:00:40,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 13:00:40,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 13:00:40,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:00:40,921 INFO L87 Difference]: Start difference. First operand 8421 states and 12011 transitions. Second operand 5 states. [2019-10-02 13:00:41,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:00:41,208 INFO L93 Difference]: Finished difference Result 12192 states and 16878 transitions. [2019-10-02 13:00:41,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 13:00:41,212 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 193 [2019-10-02 13:00:41,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:00:41,234 INFO L225 Difference]: With dead ends: 12192 [2019-10-02 13:00:41,235 INFO L226 Difference]: Without dead ends: 8504 [2019-10-02 13:00:41,243 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:00:41,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8504 states. [2019-10-02 13:00:41,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8504 to 8494. [2019-10-02 13:00:41,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8494 states. [2019-10-02 13:00:41,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8494 states to 8494 states and 12125 transitions. [2019-10-02 13:00:41,487 INFO L78 Accepts]: Start accepts. Automaton has 8494 states and 12125 transitions. Word has length 193 [2019-10-02 13:00:41,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:00:41,488 INFO L475 AbstractCegarLoop]: Abstraction has 8494 states and 12125 transitions. [2019-10-02 13:00:41,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 13:00:41,488 INFO L276 IsEmpty]: Start isEmpty. Operand 8494 states and 12125 transitions. [2019-10-02 13:00:41,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-02 13:00:41,494 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:00:41,494 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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-10-02 13:00:41,495 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:00:41,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:00:41,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1034171042, now seen corresponding path program 1 times [2019-10-02 13:00:41,495 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:00:41,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:00:41,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:41,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:00:41,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:41,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:00:41,594 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:00:41,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:00:41,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:00:41,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:00:41,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:00:41,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:00:41,595 INFO L87 Difference]: Start difference. First operand 8494 states and 12125 transitions. Second operand 3 states. [2019-10-02 13:00:41,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:00:41,830 INFO L93 Difference]: Finished difference Result 18682 states and 27410 transitions. [2019-10-02 13:00:41,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:00:41,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 191 [2019-10-02 13:00:41,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:00:41,850 INFO L225 Difference]: With dead ends: 18682 [2019-10-02 13:00:41,850 INFO L226 Difference]: Without dead ends: 10306 [2019-10-02 13:00:41,862 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:00:41,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10306 states. [2019-10-02 13:00:42,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10306 to 10300. [2019-10-02 13:00:42,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10300 states. [2019-10-02 13:00:42,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10300 states to 10300 states and 15370 transitions. [2019-10-02 13:00:42,283 INFO L78 Accepts]: Start accepts. Automaton has 10300 states and 15370 transitions. Word has length 191 [2019-10-02 13:00:42,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:00:42,284 INFO L475 AbstractCegarLoop]: Abstraction has 10300 states and 15370 transitions. [2019-10-02 13:00:42,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:00:42,284 INFO L276 IsEmpty]: Start isEmpty. Operand 10300 states and 15370 transitions. [2019-10-02 13:00:42,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-02 13:00:42,295 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:00:42,295 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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-10-02 13:00:42,295 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:00:42,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:00:42,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1794682263, now seen corresponding path program 1 times [2019-10-02 13:00:42,296 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:00:42,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:00:42,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:42,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:00:42,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:00:42,396 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:00:42,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:00:42,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:00:42,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:00:42,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:00:42,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:00:42,397 INFO L87 Difference]: Start difference. First operand 10300 states and 15370 transitions. Second operand 3 states. [2019-10-02 13:00:42,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:00:42,696 INFO L93 Difference]: Finished difference Result 23938 states and 36836 transitions. [2019-10-02 13:00:42,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:00:42,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-10-02 13:00:42,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:00:42,724 INFO L225 Difference]: With dead ends: 23938 [2019-10-02 13:00:42,725 INFO L226 Difference]: Without dead ends: 13768 [2019-10-02 13:00:42,739 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:00:42,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13768 states. [2019-10-02 13:00:43,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13768 to 13762. [2019-10-02 13:00:43,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13762 states. [2019-10-02 13:00:43,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13762 states to 13762 states and 21519 transitions. [2019-10-02 13:00:43,157 INFO L78 Accepts]: Start accepts. Automaton has 13762 states and 21519 transitions. Word has length 192 [2019-10-02 13:00:43,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:00:43,158 INFO L475 AbstractCegarLoop]: Abstraction has 13762 states and 21519 transitions. [2019-10-02 13:00:43,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:00:43,158 INFO L276 IsEmpty]: Start isEmpty. Operand 13762 states and 21519 transitions. [2019-10-02 13:00:43,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-02 13:00:43,175 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:00:43,176 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 13:00:43,176 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:00:43,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:00:43,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1169476126, now seen corresponding path program 1 times [2019-10-02 13:00:43,176 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:00:43,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:00:43,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:43,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:00:43,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:43,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:00:43,271 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:00:43,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:00:43,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:00:43,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:00:43,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:00:43,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:00:43,273 INFO L87 Difference]: Start difference. First operand 13762 states and 21519 transitions. Second operand 3 states. [2019-10-02 13:00:43,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:00:43,708 INFO L93 Difference]: Finished difference Result 34016 states and 54878 transitions. [2019-10-02 13:00:43,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:00:43,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-10-02 13:00:43,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:00:43,754 INFO L225 Difference]: With dead ends: 34016 [2019-10-02 13:00:43,754 INFO L226 Difference]: Without dead ends: 20394 [2019-10-02 13:00:43,776 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:00:43,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20394 states. [2019-10-02 13:00:44,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20394 to 20388. [2019-10-02 13:00:44,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20388 states. [2019-10-02 13:00:44,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20388 states to 20388 states and 33328 transitions. [2019-10-02 13:00:44,610 INFO L78 Accepts]: Start accepts. Automaton has 20388 states and 33328 transitions. Word has length 193 [2019-10-02 13:00:44,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:00:44,610 INFO L475 AbstractCegarLoop]: Abstraction has 20388 states and 33328 transitions. [2019-10-02 13:00:44,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:00:44,610 INFO L276 IsEmpty]: Start isEmpty. Operand 20388 states and 33328 transitions. [2019-10-02 13:00:44,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-10-02 13:00:44,640 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:00:44,640 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:00:44,640 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:00:44,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:00:44,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1383732439, now seen corresponding path program 1 times [2019-10-02 13:00:44,640 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:00:44,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:00:44,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:44,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:00:44,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:44,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:00:44,736 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:00:44,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:00:44,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:00:44,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:00:44,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:00:44,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:00:44,738 INFO L87 Difference]: Start difference. First operand 20388 states and 33328 transitions. Second operand 3 states. [2019-10-02 13:00:45,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:00:45,468 INFO L93 Difference]: Finished difference Result 53311 states and 89144 transitions. [2019-10-02 13:00:45,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:00:45,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2019-10-02 13:00:45,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:00:45,554 INFO L225 Difference]: With dead ends: 53311 [2019-10-02 13:00:45,554 INFO L226 Difference]: Without dead ends: 33070 [2019-10-02 13:00:45,591 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:00:45,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33070 states. [2019-10-02 13:00:47,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33070 to 33064. [2019-10-02 13:00:47,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33064 states. [2019-10-02 13:00:47,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33064 states to 33064 states and 55603 transitions. [2019-10-02 13:00:47,907 INFO L78 Accepts]: Start accepts. Automaton has 33064 states and 55603 transitions. Word has length 194 [2019-10-02 13:00:47,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:00:47,908 INFO L475 AbstractCegarLoop]: Abstraction has 33064 states and 55603 transitions. [2019-10-02 13:00:47,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:00:47,908 INFO L276 IsEmpty]: Start isEmpty. Operand 33064 states and 55603 transitions. [2019-10-02 13:00:47,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-02 13:00:47,961 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:00:47,961 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 13:00:47,962 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:00:47,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:00:47,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1176239838, now seen corresponding path program 1 times [2019-10-02 13:00:47,962 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:00:47,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:00:47,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:47,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:00:47,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:47,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:00:48,055 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:00:48,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:00:48,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:00:48,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:00:48,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:00:48,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:00:48,056 INFO L87 Difference]: Start difference. First operand 33064 states and 55603 transitions. Second operand 3 states. [2019-10-02 13:00:49,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:00:49,745 INFO L93 Difference]: Finished difference Result 91711 states and 156533 transitions. [2019-10-02 13:00:49,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:00:49,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2019-10-02 13:00:49,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:00:49,908 INFO L225 Difference]: With dead ends: 91711 [2019-10-02 13:00:49,908 INFO L226 Difference]: Without dead ends: 58800 [2019-10-02 13:00:49,959 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:00:49,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58800 states. [2019-10-02 13:00:54,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58800 to 58794. [2019-10-02 13:00:54,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58794 states. [2019-10-02 13:00:54,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58794 states to 58794 states and 100340 transitions. [2019-10-02 13:00:54,201 INFO L78 Accepts]: Start accepts. Automaton has 58794 states and 100340 transitions. Word has length 195 [2019-10-02 13:00:54,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:00:54,202 INFO L475 AbstractCegarLoop]: Abstraction has 58794 states and 100340 transitions. [2019-10-02 13:00:54,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:00:54,202 INFO L276 IsEmpty]: Start isEmpty. Operand 58794 states and 100340 transitions. [2019-10-02 13:00:54,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-02 13:00:54,299 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:00:54,299 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 13:00:54,299 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:00:54,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:00:54,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1727480855, now seen corresponding path program 1 times [2019-10-02 13:00:54,300 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:00:54,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:00:54,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:54,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:00:54,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:54,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:00:54,396 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:00:54,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:00:54,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:00:54,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:00:54,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:00:54,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:00:54,398 INFO L87 Difference]: Start difference. First operand 58794 states and 100340 transitions. Second operand 3 states. [2019-10-02 13:00:57,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:00:57,465 INFO L93 Difference]: Finished difference Result 165055 states and 283055 transitions. [2019-10-02 13:00:57,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:00:57,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-10-02 13:00:57,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:00:57,768 INFO L225 Difference]: With dead ends: 165055 [2019-10-02 13:00:57,768 INFO L226 Difference]: Without dead ends: 106422 [2019-10-02 13:00:57,866 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:00:57,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106422 states. [2019-10-02 13:01:05,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106422 to 106416. [2019-10-02 13:01:05,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106416 states. [2019-10-02 13:01:05,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106416 states to 106416 states and 181369 transitions. [2019-10-02 13:01:05,607 INFO L78 Accepts]: Start accepts. Automaton has 106416 states and 181369 transitions. Word has length 196 [2019-10-02 13:01:05,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:01:05,607 INFO L475 AbstractCegarLoop]: Abstraction has 106416 states and 181369 transitions. [2019-10-02 13:01:05,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:01:05,607 INFO L276 IsEmpty]: Start isEmpty. Operand 106416 states and 181369 transitions. [2019-10-02 13:01:05,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-10-02 13:01:05,745 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:01:05,745 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:01:05,745 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:01:05,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:01:05,746 INFO L82 PathProgramCache]: Analyzing trace with hash 504384736, now seen corresponding path program 1 times [2019-10-02 13:01:05,746 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:01:05,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:01:05,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:01:05,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:01:05,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:01:05,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:01:05,849 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:01:05,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:01:05,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:01:05,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:01:05,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:01:05,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:01:05,850 INFO L87 Difference]: Start difference. First operand 106416 states and 181369 transitions. Second operand 3 states. [2019-10-02 13:01:12,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:01:12,622 INFO L93 Difference]: Finished difference Result 303290 states and 518437 transitions. [2019-10-02 13:01:12,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:01:12,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-10-02 13:01:12,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:01:13,235 INFO L225 Difference]: With dead ends: 303290 [2019-10-02 13:01:13,236 INFO L226 Difference]: Without dead ends: 197048 [2019-10-02 13:01:14,260 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:01:14,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197048 states. [2019-10-02 13:01:29,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197048 to 197042. [2019-10-02 13:01:29,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197042 states. [2019-10-02 13:01:30,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197042 states to 197042 states and 334202 transitions. [2019-10-02 13:01:30,228 INFO L78 Accepts]: Start accepts. Automaton has 197042 states and 334202 transitions. Word has length 197 [2019-10-02 13:01:30,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:01:30,228 INFO L475 AbstractCegarLoop]: Abstraction has 197042 states and 334202 transitions. [2019-10-02 13:01:30,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:01:30,228 INFO L276 IsEmpty]: Start isEmpty. Operand 197042 states and 334202 transitions. [2019-10-02 13:01:30,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-02 13:01:30,428 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:01:30,429 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:01:30,429 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:01:30,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:01:30,429 INFO L82 PathProgramCache]: Analyzing trace with hash -733977705, now seen corresponding path program 1 times [2019-10-02 13:01:30,430 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:01:30,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:01:30,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:01:30,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:01:30,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:01:30,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:01:30,518 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:01:30,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:01:30,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:01:30,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:01:30,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:01:30,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:01:30,519 INFO L87 Difference]: Start difference. First operand 197042 states and 334202 transitions. Second operand 3 states. [2019-10-02 13:01:45,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:01:45,400 INFO L93 Difference]: Finished difference Result 370956 states and 624227 transitions. [2019-10-02 13:01:45,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:01:45,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-10-02 13:01:45,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:01:46,459 INFO L225 Difference]: With dead ends: 370956 [2019-10-02 13:01:46,459 INFO L226 Difference]: Without dead ends: 365420 [2019-10-02 13:01:46,571 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:01:46,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365420 states. [2019-10-02 13:02:18,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365420 to 365414. [2019-10-02 13:02:18,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365414 states. [2019-10-02 13:02:19,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365414 states to 365414 states and 610954 transitions. [2019-10-02 13:02:19,741 INFO L78 Accepts]: Start accepts. Automaton has 365414 states and 610954 transitions. Word has length 198 [2019-10-02 13:02:19,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:02:19,742 INFO L475 AbstractCegarLoop]: Abstraction has 365414 states and 610954 transitions. [2019-10-02 13:02:19,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:02:19,742 INFO L276 IsEmpty]: Start isEmpty. Operand 365414 states and 610954 transitions. [2019-10-02 13:02:19,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-02 13:02:19,984 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:02:19,984 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:02:19,984 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:02:19,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:02:19,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1268830560, now seen corresponding path program 1 times [2019-10-02 13:02:19,985 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:02:19,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:02:19,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:02:19,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:02:19,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:02:20,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:02:20,348 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:02:20,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:02:20,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:02:20,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:02:20,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:02:20,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:02:20,350 INFO L87 Difference]: Start difference. First operand 365414 states and 610954 transitions. Second operand 3 states. [2019-10-02 13:02:38,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:02:38,762 INFO L93 Difference]: Finished difference Result 371290 states and 618542 transitions. [2019-10-02 13:02:38,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:02:38,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2019-10-02 13:02:38,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:02:39,747 INFO L225 Difference]: With dead ends: 371290 [2019-10-02 13:02:39,747 INFO L226 Difference]: Without dead ends: 365934 [2019-10-02 13:02:39,851 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:02:40,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365934 states. [2019-10-02 13:03:13,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365934 to 364270. [2019-10-02 13:03:13,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364270 states. [2019-10-02 13:03:15,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364270 states to 364270 states and 609391 transitions. [2019-10-02 13:03:15,155 INFO L78 Accepts]: Start accepts. Automaton has 364270 states and 609391 transitions. Word has length 199 [2019-10-02 13:03:15,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:03:15,156 INFO L475 AbstractCegarLoop]: Abstraction has 364270 states and 609391 transitions. [2019-10-02 13:03:15,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:03:15,156 INFO L276 IsEmpty]: Start isEmpty. Operand 364270 states and 609391 transitions. [2019-10-02 13:03:16,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2019-10-02 13:03:16,513 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:03:16,513 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:03:16,514 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:03:16,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:03:16,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1513015177, now seen corresponding path program 1 times [2019-10-02 13:03:16,514 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:03:16,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:03:16,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:03:16,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:03:16,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:03:16,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:03:16,788 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-02 13:03:16,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:03:16,789 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:03:16,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:03:17,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:03:17,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 3724 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 13:03:17,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:03:18,136 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-10-02 13:03:18,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:03:18,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2019-10-02 13:03:18,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 13:03:18,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 13:03:18,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-10-02 13:03:18,149 INFO L87 Difference]: Start difference. First operand 364270 states and 609391 transitions. Second operand 12 states. [2019-10-02 13:03:49,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:03:49,973 INFO L93 Difference]: Finished difference Result 378699 states and 628956 transitions. [2019-10-02 13:03:49,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 13:03:49,973 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 374 [2019-10-02 13:03:49,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:03:50,994 INFO L225 Difference]: With dead ends: 378699 [2019-10-02 13:03:50,995 INFO L226 Difference]: Without dead ends: 374230 [2019-10-02 13:03:51,090 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=536, Unknown=0, NotChecked=0, Total=650 [2019-10-02 13:03:51,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374230 states. [2019-10-02 13:04:22,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374230 to 373719. [2019-10-02 13:04:22,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373719 states. [2019-10-02 13:04:23,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373719 states to 373719 states and 622090 transitions. [2019-10-02 13:04:23,710 INFO L78 Accepts]: Start accepts. Automaton has 373719 states and 622090 transitions. Word has length 374 [2019-10-02 13:04:23,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:04:23,711 INFO L475 AbstractCegarLoop]: Abstraction has 373719 states and 622090 transitions. [2019-10-02 13:04:23,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 13:04:23,711 INFO L276 IsEmpty]: Start isEmpty. Operand 373719 states and 622090 transitions. [2019-10-02 13:04:26,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2019-10-02 13:04:26,787 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:04:26,788 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:04:26,788 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:04:26,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:04:26,789 INFO L82 PathProgramCache]: Analyzing trace with hash 830270502, now seen corresponding path program 1 times [2019-10-02 13:04:26,789 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:04:26,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:04:26,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:04:26,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:04:26,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:04:26,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:04:27,131 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-10-02 13:04:27,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:04:27,132 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:04:27,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:04:27,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:04:27,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 3907 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 13:04:27,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:04:27,982 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 13:04:27,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:04:27,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2019-10-02 13:04:27,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 13:04:27,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 13:04:27,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-02 13:04:27,997 INFO L87 Difference]: Start difference. First operand 373719 states and 622090 transitions. Second operand 12 states. [2019-10-02 13:04:54,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:04:54,408 INFO L93 Difference]: Finished difference Result 415193 states and 679534 transitions. [2019-10-02 13:04:54,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 13:04:54,408 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 426 [2019-10-02 13:04:54,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:04:55,480 INFO L225 Difference]: With dead ends: 415193 [2019-10-02 13:04:55,480 INFO L226 Difference]: Without dead ends: 402826 [2019-10-02 13:04:55,580 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 439 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2019-10-02 13:04:55,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402826 states. [2019-10-02 13:05:27,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402826 to 401925. [2019-10-02 13:05:27,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401925 states. [2019-10-02 13:05:35,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401925 states to 401925 states and 661014 transitions. [2019-10-02 13:05:35,169 INFO L78 Accepts]: Start accepts. Automaton has 401925 states and 661014 transitions. Word has length 426 [2019-10-02 13:05:35,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:05:35,169 INFO L475 AbstractCegarLoop]: Abstraction has 401925 states and 661014 transitions. [2019-10-02 13:05:35,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 13:05:35,169 INFO L276 IsEmpty]: Start isEmpty. Operand 401925 states and 661014 transitions. [2019-10-02 13:05:36,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-10-02 13:05:36,602 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:05:36,603 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:05:36,603 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:05:36,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:05:36,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1557809262, now seen corresponding path program 1 times [2019-10-02 13:05:36,603 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:05:36,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:05:36,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:05:36,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:05:36,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:05:36,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:05:37,402 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-10-02 13:05:37,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:05:37,402 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:05:37,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:05:38,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:05:38,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 3635 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-02 13:05:38,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:05:38,581 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 13:05:38,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:05:38,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [9] total 26 [2019-10-02 13:05:38,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 13:05:38,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 13:05:38,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2019-10-02 13:05:38,596 INFO L87 Difference]: Start difference. First operand 401925 states and 661014 transitions. Second operand 26 states. [2019-10-02 13:06:22,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:06:22,163 INFO L93 Difference]: Finished difference Result 425977 states and 692569 transitions. [2019-10-02 13:06:22,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-10-02 13:06:22,163 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 352 [2019-10-02 13:06:22,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:06:23,257 INFO L225 Difference]: With dead ends: 425977 [2019-10-02 13:06:23,257 INFO L226 Difference]: Without dead ends: 403280 [2019-10-02 13:06:23,391 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1964 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=605, Invalid=7405, Unknown=0, NotChecked=0, Total=8010 [2019-10-02 13:06:23,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403280 states. [2019-10-02 13:06:55,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403280 to 402371. [2019-10-02 13:06:55,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402371 states. [2019-10-02 13:06:57,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402371 states to 402371 states and 662008 transitions. [2019-10-02 13:06:57,009 INFO L78 Accepts]: Start accepts. Automaton has 402371 states and 662008 transitions. Word has length 352 [2019-10-02 13:06:57,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:06:57,009 INFO L475 AbstractCegarLoop]: Abstraction has 402371 states and 662008 transitions. [2019-10-02 13:06:57,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 13:06:57,010 INFO L276 IsEmpty]: Start isEmpty. Operand 402371 states and 662008 transitions. [2019-10-02 13:07:01,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2019-10-02 13:07:01,022 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:07:01,023 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:07:01,023 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:07:01,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:07:01,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1465336802, now seen corresponding path program 1 times [2019-10-02 13:07:01,023 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:07:01,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:07:01,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:07:01,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:07:01,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:07:01,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:07:01,301 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-10-02 13:07:01,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:07:01,302 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:07:01,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:07:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:07:01,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 3754 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:07:01,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:07:02,157 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-10-02 13:07:02,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:07:02,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [16] total 21 [2019-10-02 13:07:02,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-02 13:07:02,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-02 13:07:02,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2019-10-02 13:07:02,166 INFO L87 Difference]: Start difference. First operand 402371 states and 662008 transitions. Second operand 21 states. [2019-10-02 13:07:26,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:07:26,802 INFO L93 Difference]: Finished difference Result 577271 states and 945828 transitions. [2019-10-02 13:07:26,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 13:07:26,803 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 383 [2019-10-02 13:07:26,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:07:27,833 INFO L225 Difference]: With dead ends: 577271 [2019-10-02 13:07:27,833 INFO L226 Difference]: Without dead ends: 365933 [2019-10-02 13:07:28,138 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 379 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=1424, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 13:07:28,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365933 states. [2019-10-02 13:07:56,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365933 to 364715. [2019-10-02 13:07:56,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364715 states. [2019-10-02 13:07:57,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364715 states to 364715 states and 597411 transitions. [2019-10-02 13:07:57,042 INFO L78 Accepts]: Start accepts. Automaton has 364715 states and 597411 transitions. Word has length 383 [2019-10-02 13:07:57,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:07:57,043 INFO L475 AbstractCegarLoop]: Abstraction has 364715 states and 597411 transitions. [2019-10-02 13:07:57,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-02 13:07:57,043 INFO L276 IsEmpty]: Start isEmpty. Operand 364715 states and 597411 transitions. [2019-10-02 13:08:00,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-10-02 13:08:00,303 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:08:00,303 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:08:00,303 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:08:00,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:08:00,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1126371020, now seen corresponding path program 1 times [2019-10-02 13:08:00,304 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:08:00,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:08:00,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:08:00,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:08:00,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:08:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:08:00,839 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-10-02 13:08:00,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:08:00,840 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:08:00,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:08:01,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:08:01,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 3656 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-02 13:08:01,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:08:10,248 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 13:08:10,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:08:10,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [24] total 46 [2019-10-02 13:08:10,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-10-02 13:08:10,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-10-02 13:08:10,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1959, Unknown=0, NotChecked=0, Total=2070 [2019-10-02 13:08:10,258 INFO L87 Difference]: Start difference. First operand 364715 states and 597411 transitions. Second operand 46 states. [2019-10-02 13:08:26,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:08:26,758 INFO L93 Difference]: Finished difference Result 382480 states and 620835 transitions. [2019-10-02 13:08:26,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-02 13:08:26,758 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 360 [2019-10-02 13:08:26,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:08:27,807 INFO L225 Difference]: With dead ends: 382480 [2019-10-02 13:08:27,807 INFO L226 Difference]: Without dead ends: 356835 [2019-10-02 13:08:27,914 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=225, Invalid=3935, Unknown=0, NotChecked=0, Total=4160 [2019-10-02 13:08:28,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356835 states. [2019-10-02 13:08:58,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356835 to 355849. [2019-10-02 13:08:58,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355849 states. [2019-10-02 13:09:00,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355849 states to 355849 states and 585407 transitions. [2019-10-02 13:09:00,125 INFO L78 Accepts]: Start accepts. Automaton has 355849 states and 585407 transitions. Word has length 360 [2019-10-02 13:09:00,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:09:00,126 INFO L475 AbstractCegarLoop]: Abstraction has 355849 states and 585407 transitions. [2019-10-02 13:09:00,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-10-02 13:09:00,126 INFO L276 IsEmpty]: Start isEmpty. Operand 355849 states and 585407 transitions. [2019-10-02 13:09:01,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2019-10-02 13:09:01,509 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:09:01,509 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:09:01,509 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:09:01,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:09:01,510 INFO L82 PathProgramCache]: Analyzing trace with hash 2110178019, now seen corresponding path program 1 times [2019-10-02 13:09:01,510 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:09:01,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:09:01,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:09:01,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:09:01,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:09:01,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:09:01,704 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2019-10-02 13:09:01,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:09:01,704 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:09:01,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:09:02,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:09:02,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 3855 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-02 13:09:02,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:09:02,563 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 78 proven. 2 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-10-02 13:09:02,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:09:02,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11] total 14 [2019-10-02 13:09:02,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 13:09:02,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 13:09:02,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-02 13:09:02,575 INFO L87 Difference]: Start difference. First operand 355849 states and 585407 transitions. Second operand 14 states.