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_product35.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 04:48:31,538 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 04:48:31,540 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 04:48:31,554 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 04:48:31,554 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 04:48:31,556 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 04:48:31,557 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 04:48:31,559 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 04:48:31,561 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 04:48:31,562 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 04:48:31,563 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 04:48:31,564 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 04:48:31,564 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 04:48:31,565 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 04:48:31,566 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 04:48:31,567 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 04:48:31,568 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 04:48:31,569 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 04:48:31,571 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 04:48:31,573 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 04:48:31,574 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 04:48:31,575 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 04:48:31,576 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 04:48:31,577 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 04:48:31,579 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 04:48:31,579 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 04:48:31,579 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 04:48:31,580 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 04:48:31,581 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 04:48:31,582 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 04:48:31,582 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 04:48:31,583 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 04:48:31,583 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 04:48:31,584 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 04:48:31,585 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 04:48:31,585 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 04:48:31,586 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 04:48:31,586 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 04:48:31,586 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 04:48:31,587 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 04:48:31,588 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 04:48:31,589 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-09-08 04:48:31,604 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 04:48:31,605 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 04:48:31,606 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 04:48:31,606 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 04:48:31,606 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 04:48:31,607 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 04:48:31,607 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 04:48:31,607 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 04:48:31,607 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 04:48:31,607 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 04:48:31,608 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 04:48:31,608 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 04:48:31,608 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 04:48:31,608 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 04:48:31,609 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 04:48:31,609 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 04:48:31,609 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 04:48:31,609 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 04:48:31,609 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 04:48:31,610 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 04:48:31,610 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 04:48:31,610 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:48:31,610 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 04:48:31,611 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 04:48:31,611 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 04:48:31,611 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 04:48:31,611 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 04:48:31,612 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 04:48:31,612 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 04:48:31,641 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 04:48:31,655 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 04:48:31,659 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 04:48:31,660 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 04:48:31,661 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 04:48:31,662 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec1_product35.cil.c [2019-09-08 04:48:31,727 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a80d9589/7a7b282e68874676b44917e90e724ec2/FLAG9b9d23276 [2019-09-08 04:48:32,459 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 04:48:32,460 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec1_product35.cil.c [2019-09-08 04:48:32,506 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a80d9589/7a7b282e68874676b44917e90e724ec2/FLAG9b9d23276 [2019-09-08 04:48:32,611 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a80d9589/7a7b282e68874676b44917e90e724ec2 [2019-09-08 04:48:32,625 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 04:48:32,627 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 04:48:32,629 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 04:48:32,630 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 04:48:32,634 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 04:48:32,636 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:48:32" (1/1) ... [2019-09-08 04:48:32,640 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a306b65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:48:32, skipping insertion in model container [2019-09-08 04:48:32,640 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:48:32" (1/1) ... [2019-09-08 04:48:32,650 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 04:48:32,746 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 04:48:33,558 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:48:33,579 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 04:48:33,718 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:48:33,857 INFO L192 MainTranslator]: Completed translation [2019-09-08 04:48:33,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:48:33 WrapperNode [2019-09-08 04:48:33,858 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 04:48:33,859 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 04:48:33,859 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 04:48:33,860 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 04:48:33,875 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:48:33" (1/1) ... [2019-09-08 04:48:33,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:48:33" (1/1) ... [2019-09-08 04:48:33,945 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:48:33" (1/1) ... [2019-09-08 04:48:33,946 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:48:33" (1/1) ... [2019-09-08 04:48:34,021 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:48:33" (1/1) ... [2019-09-08 04:48:34,038 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:48:33" (1/1) ... [2019-09-08 04:48:34,050 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:48:33" (1/1) ... [2019-09-08 04:48:34,069 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 04:48:34,069 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 04:48:34,070 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 04:48:34,070 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 04:48:34,075 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:48:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:48:34,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 04:48:34,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 04:48:34,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 04:48:34,151 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-08 04:48:34,152 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-08 04:48:34,152 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-08 04:48:34,152 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-08 04:48:34,152 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-08 04:48:34,152 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-08 04:48:34,153 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-08 04:48:34,153 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-08 04:48:34,153 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 04:48:34,153 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 04:48:34,153 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-08 04:48:34,154 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-08 04:48:34,154 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-08 04:48:34,154 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-08 04:48:34,154 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-08 04:48:34,154 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-08 04:48:34,155 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-08 04:48:34,156 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-08 04:48:34,156 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-08 04:48:34,156 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-09-08 04:48:34,156 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-09-08 04:48:34,156 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-09-08 04:48:34,156 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 04:48:34,156 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 04:48:34,156 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 04:48:34,156 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 04:48:34,156 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 04:48:34,157 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 04:48:34,157 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__AddressBookEncrypt_spec__1 [2019-09-08 04:48:34,157 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-08 04:48:34,157 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-08 04:48:34,157 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-09-08 04:48:34,157 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AddressBook [2019-09-08 04:48:34,158 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-08 04:48:34,158 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-08 04:48:34,158 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-09-08 04:48:34,158 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-09-08 04:48:34,158 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-09-08 04:48:34,158 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-09-08 04:48:34,159 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-08 04:48:34,159 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-08 04:48:34,159 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-08 04:48:34,159 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-08 04:48:34,159 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-08 04:48:34,160 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-08 04:48:34,160 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-08 04:48:34,160 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-08 04:48:34,160 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-08 04:48:34,160 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-09-08 04:48:34,160 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-09-08 04:48:34,161 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-09-08 04:48:34,161 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-09-08 04:48:34,161 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-09-08 04:48:34,161 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-08 04:48:34,161 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-08 04:48:34,161 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-08 04:48:34,162 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-08 04:48:34,162 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-08 04:48:34,162 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-08 04:48:34,162 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-08 04:48:34,162 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-08 04:48:34,162 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-08 04:48:34,163 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-08 04:48:34,163 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-08 04:48:34,163 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-08 04:48:34,163 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-08 04:48:34,163 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-08 04:48:34,164 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-08 04:48:34,164 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-08 04:48:34,164 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-08 04:48:34,164 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-08 04:48:34,164 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-08 04:48:34,164 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-08 04:48:34,165 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-08 04:48:34,165 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-08 04:48:34,165 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-08 04:48:34,165 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-08 04:48:34,165 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-08 04:48:34,165 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-08 04:48:34,166 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-08 04:48:34,166 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-08 04:48:34,166 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-08 04:48:34,166 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-08 04:48:34,166 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 04:48:34,167 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-08 04:48:34,167 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AddressBook [2019-09-08 04:48:34,167 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Forward [2019-09-08 04:48:34,167 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-08 04:48:34,167 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-08 04:48:34,168 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-08 04:48:34,168 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-08 04:48:34,168 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-08 04:48:34,168 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 04:48:34,168 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 04:48:34,168 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 04:48:34,169 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 04:48:34,169 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-08 04:48:34,169 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-08 04:48:34,169 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-08 04:48:34,169 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-08 04:48:34,169 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-08 04:48:34,170 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-08 04:48:34,170 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-08 04:48:34,170 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-08 04:48:34,170 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-08 04:48:34,170 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-08 04:48:34,171 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-08 04:48:34,171 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-08 04:48:34,171 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-08 04:48:34,171 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-08 04:48:34,171 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-08 04:48:34,171 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-08 04:48:34,172 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-08 04:48:34,172 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-08 04:48:34,172 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-08 04:48:34,172 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-08 04:48:34,172 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-08 04:48:34,172 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 04:48:34,173 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 04:48:34,173 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 04:48:34,173 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 04:48:34,173 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-08 04:48:34,173 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-08 04:48:34,174 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-08 04:48:34,174 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-08 04:48:34,174 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-08 04:48:34,174 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-08 04:48:34,174 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-08 04:48:34,175 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-08 04:48:34,175 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-08 04:48:34,175 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-08 04:48:34,175 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-08 04:48:34,175 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-08 04:48:34,175 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-08 04:48:34,176 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 04:48:34,176 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 04:48:34,176 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 04:48:34,176 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-08 04:48:34,176 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-08 04:48:34,177 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-08 04:48:34,177 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-08 04:48:34,177 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-08 04:48:34,177 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-08 04:48:34,177 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-08 04:48:34,177 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-08 04:48:34,178 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-08 04:48:34,178 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-08 04:48:34,178 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-08 04:48:34,178 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 04:48:34,178 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 04:48:34,179 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 04:48:34,179 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-08 04:48:34,179 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-08 04:48:34,179 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-08 04:48:34,179 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-08 04:48:34,180 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-08 04:48:34,180 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-08 04:48:34,180 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-08 04:48:34,180 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-08 04:48:34,180 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-08 04:48:34,180 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-09-08 04:48:34,181 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-09-08 04:48:34,181 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-09-08 04:48:34,181 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-08 04:48:34,181 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-08 04:48:34,181 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-08 04:48:34,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 04:48:34,182 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 04:48:34,182 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 04:48:34,182 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 04:48:34,182 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 04:48:34,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 04:48:34,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 04:48:34,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 04:48:34,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 04:48:34,183 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 04:48:34,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 04:48:34,183 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 04:48:34,183 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 04:48:34,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 04:48:34,184 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 04:48:34,184 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 04:48:34,184 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 04:48:34,184 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 04:48:34,184 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-08 04:48:34,185 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__AddressBookEncrypt_spec__1 [2019-09-08 04:48:34,185 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-08 04:48:34,185 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-08 04:48:34,185 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-08 04:48:34,185 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-08 04:48:34,185 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-08 04:48:34,186 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-08 04:48:34,186 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-08 04:48:34,186 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-08 04:48:34,186 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-08 04:48:34,186 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-08 04:48:34,186 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-08 04:48:34,186 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-08 04:48:34,187 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-08 04:48:34,187 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-08 04:48:34,187 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-08 04:48:34,187 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-08 04:48:34,187 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-08 04:48:34,187 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-08 04:48:34,188 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-08 04:48:34,188 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-08 04:48:34,188 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-08 04:48:34,188 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-08 04:48:34,188 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-08 04:48:34,188 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-08 04:48:34,189 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-08 04:48:34,189 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-08 04:48:34,189 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-08 04:48:34,189 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-08 04:48:34,189 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-08 04:48:34,189 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-09-08 04:48:34,190 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-09-08 04:48:34,190 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-09-08 04:48:34,190 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-09-08 04:48:34,190 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-09-08 04:48:34,190 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-08 04:48:34,191 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-09-08 04:48:34,191 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AddressBook [2019-09-08 04:48:34,191 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-09-08 04:48:34,191 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-09-08 04:48:34,191 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-09-08 04:48:34,191 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-09-08 04:48:34,192 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-08 04:48:34,192 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-08 04:48:34,192 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-08 04:48:34,192 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-08 04:48:34,192 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-08 04:48:34,192 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-08 04:48:34,193 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-08 04:48:34,193 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-08 04:48:34,193 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-08 04:48:34,193 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-08 04:48:34,193 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-08 04:48:34,193 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-08 04:48:34,194 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-08 04:48:34,194 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-08 04:48:34,194 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AddressBook [2019-09-08 04:48:34,194 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Forward [2019-09-08 04:48:34,194 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-08 04:48:34,194 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 04:48:34,194 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-08 04:48:34,195 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-08 04:48:34,195 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-08 04:48:34,195 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-08 04:48:34,195 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-08 04:48:34,195 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-08 04:48:34,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 04:48:34,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 04:48:34,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 04:48:36,961 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 04:48:36,962 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 04:48:36,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:48:36 BoogieIcfgContainer [2019-09-08 04:48:36,966 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 04:48:36,969 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 04:48:36,970 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 04:48:36,974 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 04:48:36,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 04:48:32" (1/3) ... [2019-09-08 04:48:36,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b184ca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:48:36, skipping insertion in model container [2019-09-08 04:48:36,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:48:33" (2/3) ... [2019-09-08 04:48:36,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b184ca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:48:36, skipping insertion in model container [2019-09-08 04:48:36,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:48:36" (3/3) ... [2019-09-08 04:48:36,982 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec1_product35.cil.c [2019-09-08 04:48:36,995 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 04:48:37,006 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 04:48:37,024 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 04:48:37,061 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 04:48:37,061 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 04:48:37,062 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 04:48:37,062 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 04:48:37,062 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 04:48:37,062 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 04:48:37,062 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 04:48:37,062 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 04:48:37,063 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 04:48:37,097 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states. [2019-09-08 04:48:37,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 04:48:37,119 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:48:37,121 INFO L399 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] [2019-09-08 04:48:37,124 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:48:37,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:48:37,131 INFO L82 PathProgramCache]: Analyzing trace with hash 2000254707, now seen corresponding path program 1 times [2019-09-08 04:48:37,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:48:37,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:48:37,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:48:37,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:48:37,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:48:37,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:48:37,800 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 04:48:37,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:48:37,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 04:48:37,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 04:48:37,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 04:48:37,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 04:48:37,825 INFO L87 Difference]: Start difference. First operand 683 states. Second operand 2 states. [2019-09-08 04:48:37,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:48:37,943 INFO L93 Difference]: Finished difference Result 1041 states and 1401 transitions. [2019-09-08 04:48:37,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 04:48:37,945 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 167 [2019-09-08 04:48:37,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:48:37,977 INFO L225 Difference]: With dead ends: 1041 [2019-09-08 04:48:37,977 INFO L226 Difference]: Without dead ends: 654 [2019-09-08 04:48:37,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 04:48:38,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2019-09-08 04:48:38,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 654. [2019-09-08 04:48:38,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2019-09-08 04:48:38,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 886 transitions. [2019-09-08 04:48:38,102 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 886 transitions. Word has length 167 [2019-09-08 04:48:38,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:48:38,105 INFO L475 AbstractCegarLoop]: Abstraction has 654 states and 886 transitions. [2019-09-08 04:48:38,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 04:48:38,105 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 886 transitions. [2019-09-08 04:48:38,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 04:48:38,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:48:38,120 INFO L399 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] [2019-09-08 04:48:38,120 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:48:38,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:48:38,121 INFO L82 PathProgramCache]: Analyzing trace with hash -113986778, now seen corresponding path program 1 times [2019-09-08 04:48:38,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:48:38,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:48:38,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:48:38,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:48:38,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:48:38,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:48:38,455 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 04:48:38,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:48:38,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:48:38,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:48:38,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:48:38,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:48:38,459 INFO L87 Difference]: Start difference. First operand 654 states and 886 transitions. Second operand 3 states. [2019-09-08 04:48:38,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:48:38,510 INFO L93 Difference]: Finished difference Result 1024 states and 1366 transitions. [2019-09-08 04:48:38,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:48:38,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-09-08 04:48:38,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:48:38,516 INFO L225 Difference]: With dead ends: 1024 [2019-09-08 04:48:38,517 INFO L226 Difference]: Without dead ends: 657 [2019-09-08 04:48:38,519 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:48:38,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-09-08 04:48:38,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 656. [2019-09-08 04:48:38,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2019-09-08 04:48:38,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 888 transitions. [2019-09-08 04:48:38,553 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 888 transitions. Word has length 168 [2019-09-08 04:48:38,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:48:38,554 INFO L475 AbstractCegarLoop]: Abstraction has 656 states and 888 transitions. [2019-09-08 04:48:38,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:48:38,554 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 888 transitions. [2019-09-08 04:48:38,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 04:48:38,559 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:48:38,559 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:48:38,559 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:48:38,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:48:38,560 INFO L82 PathProgramCache]: Analyzing trace with hash 956315413, now seen corresponding path program 1 times [2019-09-08 04:48:38,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:48:38,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:48:38,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:48:38,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:48:38,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:48:38,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:48:38,805 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 04:48:38,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:48:38,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:48:38,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:48:38,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:48:38,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:48:38,807 INFO L87 Difference]: Start difference. First operand 656 states and 888 transitions. Second operand 3 states. [2019-09-08 04:48:38,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:48:38,845 INFO L93 Difference]: Finished difference Result 1292 states and 1780 transitions. [2019-09-08 04:48:38,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:48:38,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-08 04:48:38,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:48:38,852 INFO L225 Difference]: With dead ends: 1292 [2019-09-08 04:48:38,852 INFO L226 Difference]: Without dead ends: 701 [2019-09-08 04:48:38,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:48:38,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2019-09-08 04:48:38,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 700. [2019-09-08 04:48:38,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2019-09-08 04:48:38,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 963 transitions. [2019-09-08 04:48:38,886 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 963 transitions. Word has length 180 [2019-09-08 04:48:38,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:48:38,887 INFO L475 AbstractCegarLoop]: Abstraction has 700 states and 963 transitions. [2019-09-08 04:48:38,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:48:38,887 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 963 transitions. [2019-09-08 04:48:38,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 04:48:38,892 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:48:38,892 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:48:38,892 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:48:38,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:48:38,893 INFO L82 PathProgramCache]: Analyzing trace with hash 2106221254, now seen corresponding path program 1 times [2019-09-08 04:48:38,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:48:38,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:48:38,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:48:38,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:48:38,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:48:38,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:48:39,037 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 04:48:39,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:48:39,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:48:39,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:48:39,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:48:39,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:48:39,040 INFO L87 Difference]: Start difference. First operand 700 states and 963 transitions. Second operand 3 states. [2019-09-08 04:48:39,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:48:39,087 INFO L93 Difference]: Finished difference Result 1421 states and 2000 transitions. [2019-09-08 04:48:39,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:48:39,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-09-08 04:48:39,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:48:39,094 INFO L225 Difference]: With dead ends: 1421 [2019-09-08 04:48:39,095 INFO L226 Difference]: Without dead ends: 786 [2019-09-08 04:48:39,097 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:48:39,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2019-09-08 04:48:39,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 785. [2019-09-08 04:48:39,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2019-09-08 04:48:39,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1107 transitions. [2019-09-08 04:48:39,134 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1107 transitions. Word has length 181 [2019-09-08 04:48:39,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:48:39,134 INFO L475 AbstractCegarLoop]: Abstraction has 785 states and 1107 transitions. [2019-09-08 04:48:39,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:48:39,135 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1107 transitions. [2019-09-08 04:48:39,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-08 04:48:39,139 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:48:39,139 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:48:39,139 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:48:39,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:48:39,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1485976180, now seen corresponding path program 1 times [2019-09-08 04:48:39,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:48:39,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:48:39,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:48:39,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:48:39,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:48:39,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:48:39,385 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 04:48:39,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:48:39,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:48:39,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:48:39,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:48:39,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:48:39,388 INFO L87 Difference]: Start difference. First operand 785 states and 1107 transitions. Second operand 6 states. [2019-09-08 04:48:40,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:48:40,291 INFO L93 Difference]: Finished difference Result 1519 states and 2161 transitions. [2019-09-08 04:48:40,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:48:40,292 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 184 [2019-09-08 04:48:40,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:48:40,300 INFO L225 Difference]: With dead ends: 1519 [2019-09-08 04:48:40,300 INFO L226 Difference]: Without dead ends: 797 [2019-09-08 04:48:40,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:48:40,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2019-09-08 04:48:40,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 797. [2019-09-08 04:48:40,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-09-08 04:48:40,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1122 transitions. [2019-09-08 04:48:40,373 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1122 transitions. Word has length 184 [2019-09-08 04:48:40,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:48:40,374 INFO L475 AbstractCegarLoop]: Abstraction has 797 states and 1122 transitions. [2019-09-08 04:48:40,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:48:40,374 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1122 transitions. [2019-09-08 04:48:40,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-08 04:48:40,380 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:48:40,380 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:48:40,381 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:48:40,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:48:40,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1378315157, now seen corresponding path program 1 times [2019-09-08 04:48:40,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:48:40,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:48:40,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:48:40,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:48:40,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:48:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:48:40,572 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 04:48:40,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:48:40,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:48:40,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:48:40,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:48:40,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:48:40,575 INFO L87 Difference]: Start difference. First operand 797 states and 1122 transitions. Second operand 3 states. [2019-09-08 04:48:40,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:48:40,638 INFO L93 Difference]: Finished difference Result 1682 states and 2436 transitions. [2019-09-08 04:48:40,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:48:40,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-09-08 04:48:40,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:48:40,646 INFO L225 Difference]: With dead ends: 1682 [2019-09-08 04:48:40,646 INFO L226 Difference]: Without dead ends: 962 [2019-09-08 04:48:40,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:48:40,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2019-09-08 04:48:40,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 961. [2019-09-08 04:48:40,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 961 states. [2019-09-08 04:48:40,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1398 transitions. [2019-09-08 04:48:40,704 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1398 transitions. Word has length 182 [2019-09-08 04:48:40,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:48:40,708 INFO L475 AbstractCegarLoop]: Abstraction has 961 states and 1398 transitions. [2019-09-08 04:48:40,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:48:40,709 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1398 transitions. [2019-09-08 04:48:40,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-08 04:48:40,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:48:40,714 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:48:40,714 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:48:40,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:48:40,715 INFO L82 PathProgramCache]: Analyzing trace with hash -76096234, now seen corresponding path program 1 times [2019-09-08 04:48:40,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:48:40,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:48:40,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:48:40,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:48:40,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:48:40,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:48:40,967 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 04:48:40,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:48:40,968 INFO L223 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-09-08 04:48:40,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:48:41,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:48:41,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 3019 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 04:48:41,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:48:41,700 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-09-08 04:48:41,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:48:41,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 13 [2019-09-08 04:48:41,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 04:48:41,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 04:48:41,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:48:41,717 INFO L87 Difference]: Start difference. First operand 961 states and 1398 transitions. Second operand 13 states. [2019-09-08 04:48:44,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:48:44,332 INFO L93 Difference]: Finished difference Result 1880 states and 2756 transitions. [2019-09-08 04:48:44,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 04:48:44,333 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 185 [2019-09-08 04:48:44,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:48:44,342 INFO L225 Difference]: With dead ends: 1880 [2019-09-08 04:48:44,342 INFO L226 Difference]: Without dead ends: 967 [2019-09-08 04:48:44,349 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2019-09-08 04:48:44,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2019-09-08 04:48:44,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 965. [2019-09-08 04:48:44,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-09-08 04:48:44,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1403 transitions. [2019-09-08 04:48:44,412 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1403 transitions. Word has length 185 [2019-09-08 04:48:44,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:48:44,413 INFO L475 AbstractCegarLoop]: Abstraction has 965 states and 1403 transitions. [2019-09-08 04:48:44,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 04:48:44,413 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1403 transitions. [2019-09-08 04:48:44,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-08 04:48:44,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:48:44,423 INFO L399 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] [2019-09-08 04:48:44,424 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:48:44,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:48:44,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1137013450, now seen corresponding path program 1 times [2019-09-08 04:48:44,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:48:44,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:48:44,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:48:44,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:48:44,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:48:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:48:44,667 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 04:48:44,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:48:44,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:48:44,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:48:44,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:48:44,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:48:44,670 INFO L87 Difference]: Start difference. First operand 965 states and 1403 transitions. Second operand 7 states. [2019-09-08 04:48:45,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:48:45,023 INFO L93 Difference]: Finished difference Result 1878 states and 2743 transitions. [2019-09-08 04:48:45,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:48:45,023 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 187 [2019-09-08 04:48:45,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:48:45,030 INFO L225 Difference]: With dead ends: 1878 [2019-09-08 04:48:45,031 INFO L226 Difference]: Without dead ends: 979 [2019-09-08 04:48:45,034 INFO L628 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-09-08 04:48:45,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2019-09-08 04:48:45,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 975. [2019-09-08 04:48:45,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 975 states. [2019-09-08 04:48:45,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1414 transitions. [2019-09-08 04:48:45,083 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1414 transitions. Word has length 187 [2019-09-08 04:48:45,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:48:45,084 INFO L475 AbstractCegarLoop]: Abstraction has 975 states and 1414 transitions. [2019-09-08 04:48:45,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:48:45,084 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1414 transitions. [2019-09-08 04:48:45,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-08 04:48:45,089 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:48:45,090 INFO L399 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] [2019-09-08 04:48:45,090 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:48:45,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:48:45,091 INFO L82 PathProgramCache]: Analyzing trace with hash -702856405, now seen corresponding path program 2 times [2019-09-08 04:48:45,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:48:45,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:48:45,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:48:45,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:48:45,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:48:45,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:48:45,421 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 04:48:45,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:48:45,422 INFO L223 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-09-08 04:48:45,458 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 04:48:46,187 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 04:48:46,187 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 04:48:46,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 3022 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 04:48:46,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:48:46,383 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 04:48:46,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:48:46,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2019-09-08 04:48:46,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 04:48:46,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 04:48:46,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-09-08 04:48:46,404 INFO L87 Difference]: Start difference. First operand 975 states and 1414 transitions. Second operand 15 states. [2019-09-08 04:49:03,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:49:03,347 INFO L93 Difference]: Finished difference Result 3737 states and 5539 transitions. [2019-09-08 04:49:03,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-08 04:49:03,348 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 188 [2019-09-08 04:49:03,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:49:03,370 INFO L225 Difference]: With dead ends: 3737 [2019-09-08 04:49:03,371 INFO L226 Difference]: Without dead ends: 2840 [2019-09-08 04:49:03,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=392, Invalid=2058, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 04:49:03,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2840 states. [2019-09-08 04:49:03,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2840 to 2828. [2019-09-08 04:49:03,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2828 states. [2019-09-08 04:49:03,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 4197 transitions. [2019-09-08 04:49:03,534 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 4197 transitions. Word has length 188 [2019-09-08 04:49:03,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:49:03,534 INFO L475 AbstractCegarLoop]: Abstraction has 2828 states and 4197 transitions. [2019-09-08 04:49:03,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 04:49:03,535 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 4197 transitions. [2019-09-08 04:49:03,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-08 04:49:03,548 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:49:03,548 INFO L399 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] [2019-09-08 04:49:03,549 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:49:03,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:49:03,549 INFO L82 PathProgramCache]: Analyzing trace with hash -749635605, now seen corresponding path program 1 times [2019-09-08 04:49:03,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:49:03,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:49:03,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:49:03,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 04:49:03,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:49:03,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:49:03,764 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-08 04:49:03,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:49:03,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 04:49:03,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 04:49:03,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 04:49:03,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:49:03,768 INFO L87 Difference]: Start difference. First operand 2828 states and 4197 transitions. Second operand 11 states. [2019-09-08 04:49:04,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:49:04,200 INFO L93 Difference]: Finished difference Result 3603 states and 5210 transitions. [2019-09-08 04:49:04,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:49:04,200 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 190 [2019-09-08 04:49:04,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:49:04,217 INFO L225 Difference]: With dead ends: 3603 [2019-09-08 04:49:04,217 INFO L226 Difference]: Without dead ends: 2505 [2019-09-08 04:49:04,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-09-08 04:49:04,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2505 states. [2019-09-08 04:49:04,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2505 to 2503. [2019-09-08 04:49:04,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2503 states. [2019-09-08 04:49:04,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2503 states to 2503 states and 3768 transitions. [2019-09-08 04:49:04,338 INFO L78 Accepts]: Start accepts. Automaton has 2503 states and 3768 transitions. Word has length 190 [2019-09-08 04:49:04,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:49:04,339 INFO L475 AbstractCegarLoop]: Abstraction has 2503 states and 3768 transitions. [2019-09-08 04:49:04,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 04:49:04,339 INFO L276 IsEmpty]: Start isEmpty. Operand 2503 states and 3768 transitions. [2019-09-08 04:49:04,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-08 04:49:04,350 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:49:04,350 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:49:04,350 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:49:04,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:49:04,351 INFO L82 PathProgramCache]: Analyzing trace with hash 2147136926, now seen corresponding path program 1 times [2019-09-08 04:49:04,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:49:04,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:49:04,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:49:04,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:49:04,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:49:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:49:04,493 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 04:49:04,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:49:04,494 INFO L223 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) [2019-09-08 04:49:04,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:49:04,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:49:04,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 3024 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 04:49:04,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:49:05,116 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 04:49:05,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:49:05,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-09-08 04:49:05,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:49:05,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:49:05,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:49:05,138 INFO L87 Difference]: Start difference. First operand 2503 states and 3768 transitions. Second operand 12 states. [2019-09-08 04:49:07,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:49:07,160 INFO L93 Difference]: Finished difference Result 3804 states and 5631 transitions. [2019-09-08 04:49:07,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:49:07,162 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 190 [2019-09-08 04:49:07,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:49:07,175 INFO L225 Difference]: With dead ends: 3804 [2019-09-08 04:49:07,175 INFO L226 Difference]: Without dead ends: 1918 [2019-09-08 04:49:07,182 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 188 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-09-08 04:49:07,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1918 states. [2019-09-08 04:49:07,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1918 to 1910. [2019-09-08 04:49:07,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1910 states. [2019-09-08 04:49:07,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 2822 transitions. [2019-09-08 04:49:07,275 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 2822 transitions. Word has length 190 [2019-09-08 04:49:07,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:49:07,275 INFO L475 AbstractCegarLoop]: Abstraction has 1910 states and 2822 transitions. [2019-09-08 04:49:07,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:49:07,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 2822 transitions. [2019-09-08 04:49:07,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-08 04:49:07,283 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:49:07,284 INFO L399 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, 1, 1, 1, 1, 1, 1] [2019-09-08 04:49:07,284 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:49:07,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:49:07,284 INFO L82 PathProgramCache]: Analyzing trace with hash -990219484, now seen corresponding path program 1 times [2019-09-08 04:49:07,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:49:07,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:49:07,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:49:07,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:49:07,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:49:07,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:49:07,477 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 04:49:07,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:49:07,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:49:07,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:49:07,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:49:07,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:49:07,479 INFO L87 Difference]: Start difference. First operand 1910 states and 2822 transitions. Second operand 9 states. [2019-09-08 04:49:07,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:49:07,891 INFO L93 Difference]: Finished difference Result 3749 states and 5563 transitions. [2019-09-08 04:49:07,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:49:07,892 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 199 [2019-09-08 04:49:07,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:49:07,903 INFO L225 Difference]: With dead ends: 3749 [2019-09-08 04:49:07,903 INFO L226 Difference]: Without dead ends: 1912 [2019-09-08 04:49:07,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-09-08 04:49:07,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1912 states. [2019-09-08 04:49:07,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1912 to 1910. [2019-09-08 04:49:07,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1910 states. [2019-09-08 04:49:07,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 2821 transitions. [2019-09-08 04:49:07,990 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 2821 transitions. Word has length 199 [2019-09-08 04:49:07,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:49:07,991 INFO L475 AbstractCegarLoop]: Abstraction has 1910 states and 2821 transitions. [2019-09-08 04:49:07,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:49:07,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 2821 transitions. [2019-09-08 04:49:07,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-08 04:49:07,998 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:49:07,998 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:49:07,999 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:49:07,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:49:07,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1802236685, now seen corresponding path program 2 times [2019-09-08 04:49:07,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:49:08,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:49:08,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:49:08,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:49:08,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:49:08,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:49:08,257 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 04:49:08,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:49:08,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:49:08,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:49:08,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:49:08,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:49:08,259 INFO L87 Difference]: Start difference. First operand 1910 states and 2821 transitions. Second operand 9 states. [2019-09-08 04:49:08,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:49:08,576 INFO L93 Difference]: Finished difference Result 3751 states and 5564 transitions. [2019-09-08 04:49:08,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:49:08,577 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 200 [2019-09-08 04:49:08,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:49:08,589 INFO L225 Difference]: With dead ends: 3751 [2019-09-08 04:49:08,589 INFO L226 Difference]: Without dead ends: 1914 [2019-09-08 04:49:08,596 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-09-08 04:49:08,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1914 states. [2019-09-08 04:49:08,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 1910. [2019-09-08 04:49:08,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1910 states. [2019-09-08 04:49:08,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 2820 transitions. [2019-09-08 04:49:08,675 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 2820 transitions. Word has length 200 [2019-09-08 04:49:08,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:49:08,675 INFO L475 AbstractCegarLoop]: Abstraction has 1910 states and 2820 transitions. [2019-09-08 04:49:08,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:49:08,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 2820 transitions. [2019-09-08 04:49:08,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-08 04:49:08,682 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:49:08,682 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:49:08,683 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:49:08,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:49:08,683 INFO L82 PathProgramCache]: Analyzing trace with hash -917269047, now seen corresponding path program 1 times [2019-09-08 04:49:08,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:49:08,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:49:08,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:49:08,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 04:49:08,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:49:08,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:49:09,108 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 04:49:09,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:49:09,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 04:49:09,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 04:49:09,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 04:49:09,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-09-08 04:49:09,115 INFO L87 Difference]: Start difference. First operand 1910 states and 2820 transitions. Second operand 18 states. [2019-09-08 04:49:15,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:49:15,557 INFO L93 Difference]: Finished difference Result 5267 states and 7705 transitions. [2019-09-08 04:49:15,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 04:49:15,558 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 201 [2019-09-08 04:49:15,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:49:15,584 INFO L225 Difference]: With dead ends: 5267 [2019-09-08 04:49:15,584 INFO L226 Difference]: Without dead ends: 4544 [2019-09-08 04:49:15,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=257, Invalid=1549, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 04:49:15,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4544 states. [2019-09-08 04:49:15,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4544 to 4504. [2019-09-08 04:49:15,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4504 states. [2019-09-08 04:49:15,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4504 states to 4504 states and 6686 transitions. [2019-09-08 04:49:15,803 INFO L78 Accepts]: Start accepts. Automaton has 4504 states and 6686 transitions. Word has length 201 [2019-09-08 04:49:15,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:49:15,805 INFO L475 AbstractCegarLoop]: Abstraction has 4504 states and 6686 transitions. [2019-09-08 04:49:15,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 04:49:15,805 INFO L276 IsEmpty]: Start isEmpty. Operand 4504 states and 6686 transitions. [2019-09-08 04:49:15,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-08 04:49:15,820 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:49:15,821 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:49:15,821 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:49:15,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:49:15,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1632989750, now seen corresponding path program 1 times [2019-09-08 04:49:15,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:49:15,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:49:15,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:49:15,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:49:15,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:49:15,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:49:16,094 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 04:49:16,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:49:16,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 04:49:16,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 04:49:16,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 04:49:16,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-08 04:49:16,096 INFO L87 Difference]: Start difference. First operand 4504 states and 6686 transitions. Second operand 14 states. [2019-09-08 04:49:16,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:49:16,515 INFO L93 Difference]: Finished difference Result 6889 states and 9954 transitions. [2019-09-08 04:49:16,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 04:49:16,515 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 202 [2019-09-08 04:49:16,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:49:16,544 INFO L225 Difference]: With dead ends: 6889 [2019-09-08 04:49:16,544 INFO L226 Difference]: Without dead ends: 4684 [2019-09-08 04:49:16,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2019-09-08 04:49:16,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4684 states. [2019-09-08 04:49:16,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4684 to 4684. [2019-09-08 04:49:16,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4684 states. [2019-09-08 04:49:16,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4684 states to 4684 states and 6968 transitions. [2019-09-08 04:49:16,822 INFO L78 Accepts]: Start accepts. Automaton has 4684 states and 6968 transitions. Word has length 202 [2019-09-08 04:49:16,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:49:16,822 INFO L475 AbstractCegarLoop]: Abstraction has 4684 states and 6968 transitions. [2019-09-08 04:49:16,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 04:49:16,823 INFO L276 IsEmpty]: Start isEmpty. Operand 4684 states and 6968 transitions. [2019-09-08 04:49:16,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-08 04:49:16,836 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:49:16,836 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:49:16,837 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:49:16,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:49:16,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1218817891, now seen corresponding path program 1 times [2019-09-08 04:49:16,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:49:16,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:49:16,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:49:16,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:49:16,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:49:16,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:49:17,062 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 04:49:17,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:49:17,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 04:49:17,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 04:49:17,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 04:49:17,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:49:17,064 INFO L87 Difference]: Start difference. First operand 4684 states and 6968 transitions. Second operand 13 states. [2019-09-08 04:49:17,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:49:17,626 INFO L93 Difference]: Finished difference Result 6991 states and 10090 transitions. [2019-09-08 04:49:17,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 04:49:17,627 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 202 [2019-09-08 04:49:17,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:49:17,648 INFO L225 Difference]: With dead ends: 6991 [2019-09-08 04:49:17,649 INFO L226 Difference]: Without dead ends: 4696 [2019-09-08 04:49:17,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2019-09-08 04:49:17,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4696 states. [2019-09-08 04:49:17,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4696 to 4696. [2019-09-08 04:49:17,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4696 states. [2019-09-08 04:49:17,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4696 states to 4696 states and 6988 transitions. [2019-09-08 04:49:17,864 INFO L78 Accepts]: Start accepts. Automaton has 4696 states and 6988 transitions. Word has length 202 [2019-09-08 04:49:17,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:49:17,865 INFO L475 AbstractCegarLoop]: Abstraction has 4696 states and 6988 transitions. [2019-09-08 04:49:17,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 04:49:17,865 INFO L276 IsEmpty]: Start isEmpty. Operand 4696 states and 6988 transitions. [2019-09-08 04:49:17,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-08 04:49:17,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:49:17,881 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:49:17,881 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:49:17,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:49:17,882 INFO L82 PathProgramCache]: Analyzing trace with hash -230167732, now seen corresponding path program 1 times [2019-09-08 04:49:17,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:49:17,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:49:17,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:49:17,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:49:17,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:49:17,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:49:18,038 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 04:49:18,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:49:18,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:49:18,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:49:18,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:49:18,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:49:18,040 INFO L87 Difference]: Start difference. First operand 4696 states and 6988 transitions. Second operand 5 states. [2019-09-08 04:49:19,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:49:19,635 INFO L93 Difference]: Finished difference Result 11299 states and 16546 transitions. [2019-09-08 04:49:19,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:49:19,636 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 202 [2019-09-08 04:49:19,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:49:19,686 INFO L225 Difference]: With dead ends: 11299 [2019-09-08 04:49:19,687 INFO L226 Difference]: Without dead ends: 9750 [2019-09-08 04:49:19,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:49:19,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9750 states. [2019-09-08 04:49:20,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9750 to 9700. [2019-09-08 04:49:20,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9700 states. [2019-09-08 04:49:20,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9700 states to 9700 states and 14303 transitions. [2019-09-08 04:49:20,138 INFO L78 Accepts]: Start accepts. Automaton has 9700 states and 14303 transitions. Word has length 202 [2019-09-08 04:49:20,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:49:20,138 INFO L475 AbstractCegarLoop]: Abstraction has 9700 states and 14303 transitions. [2019-09-08 04:49:20,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:49:20,138 INFO L276 IsEmpty]: Start isEmpty. Operand 9700 states and 14303 transitions. [2019-09-08 04:49:20,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-08 04:49:20,157 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:49:20,158 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:49:20,158 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:49:20,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:49:20,158 INFO L82 PathProgramCache]: Analyzing trace with hash 2054695723, now seen corresponding path program 1 times [2019-09-08 04:49:20,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:49:20,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:49:20,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:49:20,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:49:20,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:49:20,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:49:20,334 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:49:20,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:49:20,335 INFO L223 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) [2019-09-08 04:49:20,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:49:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:49:20,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 3068 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 04:49:20,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:49:20,834 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:49:20,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 04:49:20,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-08 04:49:20,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:49:20,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:49:20,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:49:20,852 INFO L87 Difference]: Start difference. First operand 9700 states and 14303 transitions. Second operand 5 states. [2019-09-08 04:49:21,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:49:21,776 INFO L93 Difference]: Finished difference Result 13831 states and 19946 transitions. [2019-09-08 04:49:21,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:49:21,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 202 [2019-09-08 04:49:21,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:49:21,824 INFO L225 Difference]: With dead ends: 13831 [2019-09-08 04:49:21,824 INFO L226 Difference]: Without dead ends: 9785 [2019-09-08 04:49:21,843 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 202 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-09-08 04:49:21,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9785 states. [2019-09-08 04:49:22,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9785 to 9775. [2019-09-08 04:49:22,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9775 states. [2019-09-08 04:49:22,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9775 states to 9775 states and 14420 transitions. [2019-09-08 04:49:22,291 INFO L78 Accepts]: Start accepts. Automaton has 9775 states and 14420 transitions. Word has length 202 [2019-09-08 04:49:22,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:49:22,292 INFO L475 AbstractCegarLoop]: Abstraction has 9775 states and 14420 transitions. [2019-09-08 04:49:22,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:49:22,292 INFO L276 IsEmpty]: Start isEmpty. Operand 9775 states and 14420 transitions. [2019-09-08 04:49:22,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-08 04:49:22,320 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:49:22,321 INFO L399 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, 1] [2019-09-08 04:49:22,321 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:49:22,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:49:22,322 INFO L82 PathProgramCache]: Analyzing trace with hash -2128812037, now seen corresponding path program 1 times [2019-09-08 04:49:22,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:49:22,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:49:22,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:49:22,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:49:22,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:49:22,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:49:22,532 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:49:22,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:49:22,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:49:22,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:49:22,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:49:22,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:49:22,534 INFO L87 Difference]: Start difference. First operand 9775 states and 14420 transitions. Second operand 3 states. [2019-09-08 04:49:22,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:49:22,944 INFO L93 Difference]: Finished difference Result 21340 states and 32192 transitions. [2019-09-08 04:49:22,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:49:22,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2019-09-08 04:49:22,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:49:23,000 INFO L225 Difference]: With dead ends: 21340 [2019-09-08 04:49:23,000 INFO L226 Difference]: Without dead ends: 11683 [2019-09-08 04:49:23,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:49:23,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11683 states. [2019-09-08 04:49:23,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11683 to 11677. [2019-09-08 04:49:23,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11677 states. [2019-09-08 04:49:23,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11677 states to 11677 states and 17857 transitions. [2019-09-08 04:49:23,714 INFO L78 Accepts]: Start accepts. Automaton has 11677 states and 17857 transitions. Word has length 200 [2019-09-08 04:49:23,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:49:23,715 INFO L475 AbstractCegarLoop]: Abstraction has 11677 states and 17857 transitions. [2019-09-08 04:49:23,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:49:23,715 INFO L276 IsEmpty]: Start isEmpty. Operand 11677 states and 17857 transitions. [2019-09-08 04:49:23,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-08 04:49:23,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:49:23,739 INFO L399 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, 1, 1] [2019-09-08 04:49:23,739 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:49:23,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:49:23,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1160357708, now seen corresponding path program 1 times [2019-09-08 04:49:23,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:49:23,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:49:23,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:49:23,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:49:23,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:49:23,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:49:23,875 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:49:23,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:49:23,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:49:23,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:49:23,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:49:23,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:49:23,878 INFO L87 Difference]: Start difference. First operand 11677 states and 17857 transitions. Second operand 3 states. [2019-09-08 04:49:24,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:49:24,249 INFO L93 Difference]: Finished difference Result 26884 states and 42194 transitions. [2019-09-08 04:49:24,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:49:24,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2019-09-08 04:49:24,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:49:24,315 INFO L225 Difference]: With dead ends: 26884 [2019-09-08 04:49:24,315 INFO L226 Difference]: Without dead ends: 15337 [2019-09-08 04:49:24,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:49:24,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15337 states. [2019-09-08 04:49:25,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15337 to 15331. [2019-09-08 04:49:25,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15331 states. [2019-09-08 04:49:25,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15331 states to 15331 states and 24390 transitions. [2019-09-08 04:49:25,808 INFO L78 Accepts]: Start accepts. Automaton has 15331 states and 24390 transitions. Word has length 201 [2019-09-08 04:49:25,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:49:25,808 INFO L475 AbstractCegarLoop]: Abstraction has 15331 states and 24390 transitions. [2019-09-08 04:49:25,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:49:25,809 INFO L276 IsEmpty]: Start isEmpty. Operand 15331 states and 24390 transitions. [2019-09-08 04:49:25,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-08 04:49:25,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:49:25,837 INFO L399 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, 1, 1, 1] [2019-09-08 04:49:25,837 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:49:25,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:49:25,838 INFO L82 PathProgramCache]: Analyzing trace with hash 2107781243, now seen corresponding path program 1 times [2019-09-08 04:49:25,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:49:25,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:49:25,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:49:25,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:49:25,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:49:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:49:25,962 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:49:25,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:49:25,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:49:25,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:49:25,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:49:25,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:49:25,964 INFO L87 Difference]: Start difference. First operand 15331 states and 24390 transitions. Second operand 3 states. [2019-09-08 04:49:26,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:49:26,721 INFO L93 Difference]: Finished difference Result 37538 states and 61388 transitions. [2019-09-08 04:49:26,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:49:26,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 202 [2019-09-08 04:49:26,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:49:26,816 INFO L225 Difference]: With dead ends: 37538 [2019-09-08 04:49:26,816 INFO L226 Difference]: Without dead ends: 22347 [2019-09-08 04:49:26,860 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:49:26,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22347 states. [2019-09-08 04:49:27,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22347 to 22341. [2019-09-08 04:49:27,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22341 states. [2019-09-08 04:49:27,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22341 states to 22341 states and 36967 transitions. [2019-09-08 04:49:27,887 INFO L78 Accepts]: Start accepts. Automaton has 22341 states and 36967 transitions. Word has length 202 [2019-09-08 04:49:27,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:49:27,888 INFO L475 AbstractCegarLoop]: Abstraction has 22341 states and 36967 transitions. [2019-09-08 04:49:27,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:49:27,888 INFO L276 IsEmpty]: Start isEmpty. Operand 22341 states and 36967 transitions. [2019-09-08 04:49:27,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-08 04:49:27,947 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:49:27,947 INFO L399 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, 1, 1, 1, 1] [2019-09-08 04:49:27,947 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:49:27,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:49:27,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1895310028, now seen corresponding path program 1 times [2019-09-08 04:49:27,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:49:27,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:49:27,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:49:27,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:49:27,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:49:27,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:49:28,086 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:49:28,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:49:28,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:49:28,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:49:28,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:49:28,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:49:28,095 INFO L87 Difference]: Start difference. First operand 22341 states and 36967 transitions. Second operand 3 states. [2019-09-08 04:49:29,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:49:29,287 INFO L93 Difference]: Finished difference Result 57985 states and 97766 transitions. [2019-09-08 04:49:29,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:49:29,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2019-09-08 04:49:29,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:49:29,440 INFO L225 Difference]: With dead ends: 57985 [2019-09-08 04:49:29,440 INFO L226 Difference]: Without dead ends: 35791 [2019-09-08 04:49:29,510 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:49:29,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35791 states. [2019-09-08 04:49:31,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35791 to 35785. [2019-09-08 04:49:31,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35785 states. [2019-09-08 04:49:31,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35785 states to 35785 states and 60586 transitions. [2019-09-08 04:49:31,404 INFO L78 Accepts]: Start accepts. Automaton has 35785 states and 60586 transitions. Word has length 203 [2019-09-08 04:49:31,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:49:31,405 INFO L475 AbstractCegarLoop]: Abstraction has 35785 states and 60586 transitions. [2019-09-08 04:49:31,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:49:31,405 INFO L276 IsEmpty]: Start isEmpty. Operand 35785 states and 60586 transitions. [2019-09-08 04:49:31,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-08 04:49:31,495 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:49:31,495 INFO L399 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, 1, 1, 1, 1, 1] [2019-09-08 04:49:31,495 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:49:31,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:49:31,496 INFO L82 PathProgramCache]: Analyzing trace with hash -103681797, now seen corresponding path program 1 times [2019-09-08 04:49:31,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:49:31,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:49:31,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:49:31,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:49:31,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:49:31,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:49:31,620 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:49:31,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:49:31,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:49:31,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:49:31,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:49:31,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:49:31,622 INFO L87 Difference]: Start difference. First operand 35785 states and 60586 transitions. Second operand 3 states. [2019-09-08 04:49:34,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:49:34,375 INFO L93 Difference]: Finished difference Result 97151 states and 167072 transitions. [2019-09-08 04:49:34,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:49:34,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-09-08 04:49:34,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:49:34,662 INFO L225 Difference]: With dead ends: 97151 [2019-09-08 04:49:34,663 INFO L226 Difference]: Without dead ends: 61521 [2019-09-08 04:49:34,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:49:34,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61521 states. [2019-09-08 04:49:39,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61521 to 61515. [2019-09-08 04:49:39,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61515 states. [2019-09-08 04:49:39,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61515 states to 61515 states and 105899 transitions. [2019-09-08 04:49:39,187 INFO L78 Accepts]: Start accepts. Automaton has 61515 states and 105899 transitions. Word has length 204 [2019-09-08 04:49:39,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:49:39,187 INFO L475 AbstractCegarLoop]: Abstraction has 61515 states and 105899 transitions. [2019-09-08 04:49:39,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:49:39,187 INFO L276 IsEmpty]: Start isEmpty. Operand 61515 states and 105899 transitions. [2019-09-08 04:49:39,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-08 04:49:39,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:49:39,331 INFO L399 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, 1, 1, 1, 1, 1, 1] [2019-09-08 04:49:39,331 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:49:39,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:49:39,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1517803956, now seen corresponding path program 1 times [2019-09-08 04:49:39,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:49:39,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:49:39,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:49:39,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:49:39,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:49:39,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:49:39,450 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:49:39,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:49:39,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:49:39,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:49:39,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:49:39,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:49:39,452 INFO L87 Difference]: Start difference. First operand 61515 states and 105899 transitions. Second operand 3 states. [2019-09-08 04:49:44,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:49:44,910 INFO L93 Difference]: Finished difference Result 172031 states and 297626 transitions. [2019-09-08 04:49:44,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:49:44,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-09-08 04:49:44,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:49:45,387 INFO L225 Difference]: With dead ends: 172031 [2019-09-08 04:49:45,388 INFO L226 Difference]: Without dead ends: 110679 [2019-09-08 04:49:45,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:49:45,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110679 states. [2019-09-08 04:49:49,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110679 to 110673. [2019-09-08 04:49:49,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110673 states. [2019-09-08 04:49:50,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110673 states to 110673 states and 190384 transitions. [2019-09-08 04:49:50,151 INFO L78 Accepts]: Start accepts. Automaton has 110673 states and 190384 transitions. Word has length 205 [2019-09-08 04:49:50,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:49:50,151 INFO L475 AbstractCegarLoop]: Abstraction has 110673 states and 190384 transitions. [2019-09-08 04:49:50,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:49:50,151 INFO L276 IsEmpty]: Start isEmpty. Operand 110673 states and 190384 transitions. [2019-09-08 04:49:50,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-09-08 04:49:50,336 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:49:50,336 INFO L399 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:49:50,337 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:49:50,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:49:50,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1699468933, now seen corresponding path program 1 times [2019-09-08 04:49:50,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:49:50,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:49:50,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:49:50,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:49:50,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:49:50,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:49:50,469 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:49:50,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:49:50,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:49:50,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:49:50,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:49:50,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:49:50,470 INFO L87 Difference]: Start difference. First operand 110673 states and 190384 transitions. Second operand 3 states. [2019-09-08 04:49:58,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:49:58,767 INFO L93 Difference]: Finished difference Result 314874 states and 541840 transitions. [2019-09-08 04:49:58,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:49:58,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2019-09-08 04:49:58,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:49:59,372 INFO L225 Difference]: With dead ends: 314874 [2019-09-08 04:49:59,372 INFO L226 Difference]: Without dead ends: 204377 [2019-09-08 04:49:59,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:49:59,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204377 states. [2019-09-08 04:50:12,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204377 to 204371. [2019-09-08 04:50:12,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204371 states. [2019-09-08 04:50:12,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204371 states to 204371 states and 348593 transitions. [2019-09-08 04:50:12,823 INFO L78 Accepts]: Start accepts. Automaton has 204371 states and 348593 transitions. Word has length 206 [2019-09-08 04:50:12,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:50:12,823 INFO L475 AbstractCegarLoop]: Abstraction has 204371 states and 348593 transitions. [2019-09-08 04:50:12,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:50:12,824 INFO L276 IsEmpty]: Start isEmpty. Operand 204371 states and 348593 transitions. [2019-09-08 04:50:13,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-08 04:50:13,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:50:13,089 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:50:13,089 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:50:13,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:50:13,089 INFO L82 PathProgramCache]: Analyzing trace with hash 34714060, now seen corresponding path program 1 times [2019-09-08 04:50:13,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:50:13,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:50:13,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:50:13,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:50:13,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:50:13,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:50:13,213 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:50:13,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:50:13,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:50:13,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:50:13,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:50:13,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:50:13,215 INFO L87 Difference]: Start difference. First operand 204371 states and 348593 transitions. Second operand 3 states. [2019-09-08 04:50:27,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:50:27,890 INFO L93 Difference]: Finished difference Result 385360 states and 652600 transitions. [2019-09-08 04:50:27,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:50:27,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 207 [2019-09-08 04:50:27,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:50:29,181 INFO L225 Difference]: With dead ends: 385360 [2019-09-08 04:50:29,182 INFO L226 Difference]: Without dead ends: 378893 [2019-09-08 04:50:29,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:50:29,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378893 states. [2019-09-08 04:50:53,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378893 to 378887. [2019-09-08 04:50:53,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378887 states. [2019-09-08 04:51:04,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378887 states to 378887 states and 637633 transitions. [2019-09-08 04:51:04,693 INFO L78 Accepts]: Start accepts. Automaton has 378887 states and 637633 transitions. Word has length 207 [2019-09-08 04:51:04,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:51:04,693 INFO L475 AbstractCegarLoop]: Abstraction has 378887 states and 637633 transitions. [2019-09-08 04:51:04,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:51:04,693 INFO L276 IsEmpty]: Start isEmpty. Operand 378887 states and 637633 transitions. [2019-09-08 04:51:05,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-08 04:51:05,124 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:51:05,124 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:51:05,124 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:51:05,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:51:05,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1664034309, now seen corresponding path program 1 times [2019-09-08 04:51:05,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:51:05,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:51:05,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:51:05,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:51:05,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:51:05,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:51:05,758 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:51:05,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:51:05,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:51:05,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:51:05,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:51:05,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:51:05,761 INFO L87 Difference]: Start difference. First operand 378887 states and 637633 transitions. Second operand 3 states. [2019-09-08 04:51:24,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:51:24,628 INFO L93 Difference]: Finished difference Result 386400 states and 647974 transitions. [2019-09-08 04:51:24,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:51:24,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2019-09-08 04:51:24,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:51:26,061 INFO L225 Difference]: With dead ends: 386400 [2019-09-08 04:51:26,061 INFO L226 Difference]: Without dead ends: 380097 [2019-09-08 04:51:26,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:51:26,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380097 states. [2019-09-08 04:52:01,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380097 to 378780. [2019-09-08 04:52:01,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378780 states. [2019-09-08 04:52:04,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378780 states to 378780 states and 637418 transitions. [2019-09-08 04:52:04,022 INFO L78 Accepts]: Start accepts. Automaton has 378780 states and 637418 transitions. Word has length 208 [2019-09-08 04:52:04,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:52:04,022 INFO L475 AbstractCegarLoop]: Abstraction has 378780 states and 637418 transitions. [2019-09-08 04:52:04,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:52:04,023 INFO L276 IsEmpty]: Start isEmpty. Operand 378780 states and 637418 transitions. [2019-09-08 04:52:05,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2019-09-08 04:52:05,867 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:52:05,868 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:52:05,868 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:52:05,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:52:05,868 INFO L82 PathProgramCache]: Analyzing trace with hash 818994576, now seen corresponding path program 1 times [2019-09-08 04:52:05,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:52:05,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:52:05,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:52:05,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:52:05,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:52:05,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:52:06,106 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-08 04:52:06,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:52:06,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:52:06,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:52:06,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:52:06,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:52:06,108 INFO L87 Difference]: Start difference. First operand 378780 states and 637418 transitions. Second operand 6 states. [2019-09-08 04:52:42,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:52:42,489 INFO L93 Difference]: Finished difference Result 750639 states and 1268032 transitions. [2019-09-08 04:52:42,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:52:42,489 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 361 [2019-09-08 04:52:42,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:52:45,985 INFO L225 Difference]: With dead ends: 750639 [2019-09-08 04:52:45,986 INFO L226 Difference]: Without dead ends: 744711 [2019-09-08 04:52:46,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:52:46,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744711 states. [2019-09-08 04:53:57,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744711 to 744608. [2019-09-08 04:53:57,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744608 states. [2019-09-08 04:53:59,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744608 states to 744608 states and 1259835 transitions. [2019-09-08 04:53:59,703 INFO L78 Accepts]: Start accepts. Automaton has 744608 states and 1259835 transitions. Word has length 361 [2019-09-08 04:53:59,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:53:59,703 INFO L475 AbstractCegarLoop]: Abstraction has 744608 states and 1259835 transitions. [2019-09-08 04:53:59,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:53:59,704 INFO L276 IsEmpty]: Start isEmpty. Operand 744608 states and 1259835 transitions. [2019-09-08 04:54:17,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2019-09-08 04:54:17,910 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:54:17,910 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:54:17,911 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:54:17,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:54:17,911 INFO L82 PathProgramCache]: Analyzing trace with hash 802472984, now seen corresponding path program 1 times [2019-09-08 04:54:17,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:54:17,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:54:17,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:54:17,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:54:17,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:54:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:54:18,246 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-08 04:54:18,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:54:18,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 04:54:18,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 04:54:18,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 04:54:18,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:54:18,249 INFO L87 Difference]: Start difference. First operand 744608 states and 1259835 transitions. Second operand 11 states. [2019-09-08 04:54:53,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:54:53,727 INFO L93 Difference]: Finished difference Result 756197 states and 1275416 transitions. [2019-09-08 04:54:53,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:54:53,728 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 362 [2019-09-08 04:54:53,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:54:55,994 INFO L225 Difference]: With dead ends: 756197 [2019-09-08 04:54:55,994 INFO L226 Difference]: Without dead ends: 744112 [2019-09-08 04:54:56,175 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-09-08 04:54:57,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744112 states. [2019-09-08 04:56:09,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744112 to 744020. [2019-09-08 04:56:09,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744020 states. [2019-09-08 04:56:12,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744020 states to 744020 states and 1258816 transitions. [2019-09-08 04:56:12,874 INFO L78 Accepts]: Start accepts. Automaton has 744020 states and 1258816 transitions. Word has length 362 [2019-09-08 04:56:12,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:56:12,874 INFO L475 AbstractCegarLoop]: Abstraction has 744020 states and 1258816 transitions. [2019-09-08 04:56:12,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 04:56:12,874 INFO L276 IsEmpty]: Start isEmpty. Operand 744020 states and 1258816 transitions.