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_spec6_productSimulator.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 13:47:59,656 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 13:47:59,658 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 13:47:59,669 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 13:47:59,670 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 13:47:59,671 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 13:47:59,673 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 13:47:59,675 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 13:47:59,678 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 13:47:59,679 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 13:47:59,680 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 13:47:59,681 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 13:47:59,681 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 13:47:59,682 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 13:47:59,683 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 13:47:59,684 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 13:47:59,685 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 13:47:59,686 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 13:47:59,688 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 13:47:59,690 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 13:47:59,692 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 13:47:59,693 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 13:47:59,694 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 13:47:59,695 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 13:47:59,698 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 13:47:59,698 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 13:47:59,698 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 13:47:59,699 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 13:47:59,700 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 13:47:59,706 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 13:47:59,706 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 13:47:59,707 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 13:47:59,707 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 13:47:59,710 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 13:47:59,711 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 13:47:59,712 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 13:47:59,713 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 13:47:59,713 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 13:47:59,714 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 13:47:59,715 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 13:47:59,715 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 13:47:59,716 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 13:47:59,744 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 13:47:59,744 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 13:47:59,746 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 13:47:59,746 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 13:47:59,747 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 13:47:59,747 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 13:47:59,747 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 13:47:59,747 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 13:47:59,747 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 13:47:59,748 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 13:47:59,749 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 13:47:59,749 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 13:47:59,749 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 13:47:59,750 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 13:47:59,750 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 13:47:59,750 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 13:47:59,750 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 13:47:59,750 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 13:47:59,751 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 13:47:59,751 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 13:47:59,751 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 13:47:59,751 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 13:47:59,752 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 13:47:59,752 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 13:47:59,752 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 13:47:59,752 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 13:47:59,753 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 13:47:59,753 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 13:47:59,753 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 13:47:59,792 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 13:47:59,807 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 13:47:59,811 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 13:47:59,812 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 13:47:59,813 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 13:47:59,813 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec6_productSimulator.cil.c [2019-10-02 13:47:59,888 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75117c1ce/9fde2c00cde64f609c1907a2a3a5ebeb/FLAGeb5bbf5c3 [2019-10-02 13:48:00,582 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 13:48:00,584 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec6_productSimulator.cil.c [2019-10-02 13:48:00,612 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75117c1ce/9fde2c00cde64f609c1907a2a3a5ebeb/FLAGeb5bbf5c3 [2019-10-02 13:48:00,686 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75117c1ce/9fde2c00cde64f609c1907a2a3a5ebeb [2019-10-02 13:48:00,697 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 13:48:00,699 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 13:48:00,700 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 13:48:00,700 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 13:48:00,702 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 13:48:00,703 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:48:00" (1/1) ... [2019-10-02 13:48:00,705 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56400103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:48:00, skipping insertion in model container [2019-10-02 13:48:00,706 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:48:00" (1/1) ... [2019-10-02 13:48:00,711 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 13:48:00,805 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 13:48:01,572 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:48:01,588 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 13:48:01,729 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:48:01,904 INFO L192 MainTranslator]: Completed translation [2019-10-02 13:48:01,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:48:01 WrapperNode [2019-10-02 13:48:01,905 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 13:48:01,906 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 13:48:01,906 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 13:48:01,907 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 13:48:01,926 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:48:01" (1/1) ... [2019-10-02 13:48:01,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:48:01" (1/1) ... [2019-10-02 13:48:01,965 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:48:01" (1/1) ... [2019-10-02 13:48:01,965 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:48:01" (1/1) ... [2019-10-02 13:48:02,038 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:48:01" (1/1) ... [2019-10-02 13:48:02,081 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:48:01" (1/1) ... [2019-10-02 13:48:02,109 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:48:01" (1/1) ... [2019-10-02 13:48:02,131 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 13:48:02,132 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 13:48:02,132 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 13:48:02,133 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 13:48:02,134 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:48:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 13:48:02,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 13:48:02,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 13:48:02,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 13:48:02,211 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptDecrypt_spec__1 [2019-10-02 13:48:02,212 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptDecrypt_spec__2 [2019-10-02 13:48:02,212 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 13:48:02,213 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 13:48:02,213 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 13:48:02,213 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 13:48:02,213 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 13:48:02,214 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 13:48:02,214 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Encrypt [2019-10-02 13:48:02,214 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__role__Encrypt [2019-10-02 13:48:02,215 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Sign [2019-10-02 13:48:02,216 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__role__Sign [2019-10-02 13:48:02,216 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Verify [2019-10-02 13:48:02,218 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__role__Verify [2019-10-02 13:48:02,218 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 13:48:02,219 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__before__Encrypt [2019-10-02 13:48:02,219 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__role__Encrypt [2019-10-02 13:48:02,219 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 13:48:02,219 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 13:48:02,220 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 13:48:02,220 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 13:48:02,220 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 13:48:02,220 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 13:48:02,220 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 13:48:02,220 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 13:48:02,221 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 13:48:02,221 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 13:48:02,221 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 13:48:02,221 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 13:48:02,221 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 13:48:02,221 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 13:48:02,222 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 13:48:02,222 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 13:48:02,222 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 13:48:02,222 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 13:48:02,222 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 13:48:02,223 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 13:48:02,223 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 13:48:02,223 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 13:48:02,223 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 13:48:02,223 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 13:48:02,223 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 13:48:02,224 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 13:48:02,224 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 13:48:02,224 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 13:48:02,224 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 13:48:02,224 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 13:48:02,224 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 13:48:02,225 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 13:48:02,225 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 13:48:02,225 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 13:48:02,225 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 13:48:02,225 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 13:48:02,226 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 13:48:02,226 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 13:48:02,226 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 13:48:02,226 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__before__Keys [2019-10-02 13:48:02,227 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__role__Keys [2019-10-02 13:48:02,227 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 13:48:02,227 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__before__Keys [2019-10-02 13:48:02,227 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__role__Keys [2019-10-02 13:48:02,227 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 13:48:02,228 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__before__Keys [2019-10-02 13:48:02,228 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__role__Keys [2019-10-02 13:48:02,228 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 13:48:02,229 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 13:48:02,229 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 13:48:02,229 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 13:48:02,229 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 13:48:02,229 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 13:48:02,230 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 13:48:02,230 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 13:48:02,231 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 13:48:02,231 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 13:48:02,231 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 13:48:02,231 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 13:48:02,231 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 13:48:02,232 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 13:48:02,232 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-02 13:48:02,232 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-02 13:48:02,233 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-02 13:48:02,233 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 13:48:02,233 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 13:48:02,233 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 13:48:02,234 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 13:48:02,234 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 13:48:02,234 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 13:48:02,235 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 13:48:02,235 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 13:48:02,236 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 13:48:02,236 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 13:48:02,236 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 13:48:02,236 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 13:48:02,236 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 13:48:02,236 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 13:48:02,237 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 13:48:02,237 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 13:48:02,237 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 13:48:02,237 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 13:48:02,237 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 13:48:02,238 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 13:48:02,238 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 13:48:02,238 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 13:48:02,238 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Encrypt [2019-10-02 13:48:02,238 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__role__Encrypt [2019-10-02 13:48:02,238 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__AddressBook [2019-10-02 13:48:02,239 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__role__AddressBook [2019-10-02 13:48:02,239 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Sign [2019-10-02 13:48:02,239 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__role__Sign [2019-10-02 13:48:02,239 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 13:48:02,239 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 13:48:02,239 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__AutoResponder [2019-10-02 13:48:02,240 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__AutoResponder [2019-10-02 13:48:02,240 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Forward [2019-10-02 13:48:02,240 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__Forward [2019-10-02 13:48:02,240 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Verify [2019-10-02 13:48:02,241 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__Verify [2019-10-02 13:48:02,241 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Decrypt [2019-10-02 13:48:02,241 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__Decrypt [2019-10-02 13:48:02,241 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 13:48:02,242 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 13:48:02,243 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 13:48:02,243 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 13:48:02,243 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 13:48:02,244 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 13:48:02,244 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 13:48:02,244 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 13:48:02,244 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 13:48:02,245 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-02 13:48:02,245 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-02 13:48:02,245 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-02 13:48:02,245 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-02 13:48:02,245 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-02 13:48:02,246 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 13:48:02,246 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 13:48:02,246 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 13:48:02,247 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 13:48:02,250 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 13:48:02,251 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 13:48:02,251 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 13:48:02,252 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 13:48:02,259 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 13:48:02,259 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptDecrypt_spec__1 [2019-10-02 13:48:02,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 13:48:02,259 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptDecrypt_spec__2 [2019-10-02 13:48:02,260 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 13:48:02,260 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 13:48:02,260 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 13:48:02,260 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 13:48:02,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 13:48:02,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 13:48:02,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 13:48:02,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 13:48:02,261 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 13:48:02,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 13:48:02,261 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 13:48:02,261 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 13:48:02,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 13:48:02,262 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 13:48:02,262 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 13:48:02,262 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 13:48:02,262 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 13:48:02,262 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 13:48:02,263 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 13:48:02,263 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 13:48:02,263 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 13:48:02,282 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 13:48:02,283 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 13:48:02,283 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 13:48:02,283 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 13:48:02,283 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 13:48:02,283 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 13:48:02,283 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 13:48:02,283 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Encrypt [2019-10-02 13:48:02,284 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__role__Encrypt [2019-10-02 13:48:02,284 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Sign [2019-10-02 13:48:02,284 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__role__Sign [2019-10-02 13:48:02,284 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Verify [2019-10-02 13:48:02,284 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__role__Verify [2019-10-02 13:48:02,284 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__before__Encrypt [2019-10-02 13:48:02,284 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__role__Encrypt [2019-10-02 13:48:02,284 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 13:48:02,285 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 13:48:02,285 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 13:48:02,285 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 13:48:02,285 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 13:48:02,285 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 13:48:02,285 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 13:48:02,285 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 13:48:02,286 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 13:48:02,286 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 13:48:02,286 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 13:48:02,286 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 13:48:02,286 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 13:48:02,286 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 13:48:02,286 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 13:48:02,287 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 13:48:02,287 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 13:48:02,287 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 13:48:02,287 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 13:48:02,287 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 13:48:02,287 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 13:48:02,287 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 13:48:02,287 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 13:48:02,288 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 13:48:02,288 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 13:48:02,288 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 13:48:02,288 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 13:48:02,288 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 13:48:02,288 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 13:48:02,288 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 13:48:02,288 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 13:48:02,289 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 13:48:02,289 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 13:48:02,289 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 13:48:02,289 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-02 13:48:02,289 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 13:48:02,289 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 13:48:02,289 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 13:48:02,289 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-02 13:48:02,290 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 13:48:02,290 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-02 13:48:02,290 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 13:48:02,290 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 13:48:02,290 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 13:48:02,290 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 13:48:02,290 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 13:48:02,290 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 13:48:02,291 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 13:48:02,291 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 13:48:02,291 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 13:48:02,291 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 13:48:02,291 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 13:48:02,291 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 13:48:02,291 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 13:48:02,291 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 13:48:02,292 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 13:48:02,292 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 13:48:02,292 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 13:48:02,292 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 13:48:02,292 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__before__Keys [2019-10-02 13:48:02,292 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__role__Keys [2019-10-02 13:48:02,292 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__before__Keys [2019-10-02 13:48:02,293 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__role__Keys [2019-10-02 13:48:02,293 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__before__Keys [2019-10-02 13:48:02,293 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__role__Keys [2019-10-02 13:48:02,293 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 13:48:02,293 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 13:48:02,293 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 13:48:02,293 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 13:48:02,293 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 13:48:02,293 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 13:48:02,294 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 13:48:02,294 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 13:48:02,294 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 13:48:02,294 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 13:48:02,294 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 13:48:02,294 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 13:48:02,294 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 13:48:02,294 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 13:48:02,295 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 13:48:02,295 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 13:48:02,295 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-02 13:48:02,296 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-02 13:48:02,300 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-02 13:48:02,301 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-02 13:48:02,301 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-02 13:48:02,301 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Encrypt [2019-10-02 13:48:02,301 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__role__Encrypt [2019-10-02 13:48:02,304 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__AddressBook [2019-10-02 13:48:02,305 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__role__AddressBook [2019-10-02 13:48:02,305 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Sign [2019-10-02 13:48:02,305 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__role__Sign [2019-10-02 13:48:02,305 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__AutoResponder [2019-10-02 13:48:02,305 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__AutoResponder [2019-10-02 13:48:02,305 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Forward [2019-10-02 13:48:02,305 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__Forward [2019-10-02 13:48:02,305 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Verify [2019-10-02 13:48:02,306 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__Verify [2019-10-02 13:48:02,306 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Decrypt [2019-10-02 13:48:02,306 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__Decrypt [2019-10-02 13:48:02,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 13:48:02,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 13:48:02,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 13:48:04,590 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 13:48:04,591 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 13:48:04,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:48:04 BoogieIcfgContainer [2019-10-02 13:48:04,593 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 13:48:04,594 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 13:48:04,594 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 13:48:04,597 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 13:48:04,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:48:00" (1/3) ... [2019-10-02 13:48:04,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b44042e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:48:04, skipping insertion in model container [2019-10-02 13:48:04,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:48:01" (2/3) ... [2019-10-02 13:48:04,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b44042e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:48:04, skipping insertion in model container [2019-10-02 13:48:04,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:48:04" (3/3) ... [2019-10-02 13:48:04,600 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec6_productSimulator.cil.c [2019-10-02 13:48:04,610 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 13:48:04,618 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 13:48:04,635 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 13:48:04,671 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 13:48:04,672 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 13:48:04,672 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 13:48:04,672 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 13:48:04,672 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 13:48:04,672 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 13:48:04,672 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 13:48:04,673 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 13:48:04,673 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 13:48:04,707 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states. [2019-10-02 13:48:04,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-02 13:48:04,734 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:48:04,735 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:48:04,737 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:48:04,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:48:04,746 INFO L82 PathProgramCache]: Analyzing trace with hash 924149196, now seen corresponding path program 1 times [2019-10-02 13:48:04,748 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:48:04,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:48:04,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:48:04,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:48:04,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:48:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:48:05,455 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-02 13:48:05,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:48:05,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 13:48:05,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 13:48:05,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 13:48:05,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 13:48:05,481 INFO L87 Difference]: Start difference. First operand 822 states. Second operand 6 states. [2019-10-02 13:48:05,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:48:05,735 INFO L93 Difference]: Finished difference Result 1562 states and 2158 transitions. [2019-10-02 13:48:05,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 13:48:05,737 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 201 [2019-10-02 13:48:05,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:48:05,766 INFO L225 Difference]: With dead ends: 1562 [2019-10-02 13:48:05,766 INFO L226 Difference]: Without dead ends: 793 [2019-10-02 13:48:05,774 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:48:05,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2019-10-02 13:48:05,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 793. [2019-10-02 13:48:05,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2019-10-02 13:48:05,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1079 transitions. [2019-10-02 13:48:05,949 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1079 transitions. Word has length 201 [2019-10-02 13:48:05,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:48:05,951 INFO L475 AbstractCegarLoop]: Abstraction has 793 states and 1079 transitions. [2019-10-02 13:48:05,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 13:48:05,952 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1079 transitions. [2019-10-02 13:48:05,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-10-02 13:48:05,965 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:48:05,966 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:48:05,966 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:48:05,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:48:05,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1049194950, now seen corresponding path program 1 times [2019-10-02 13:48:05,967 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:48:05,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:48:05,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:48:05,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:48:05,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:48:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:48:06,276 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-02 13:48:06,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:48:06,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 13:48:06,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 13:48:06,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 13:48:06,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 13:48:06,293 INFO L87 Difference]: Start difference. First operand 793 states and 1079 transitions. Second operand 4 states. [2019-10-02 13:48:07,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:48:07,189 INFO L93 Difference]: Finished difference Result 1549 states and 2143 transitions. [2019-10-02 13:48:07,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 13:48:07,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 207 [2019-10-02 13:48:07,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:48:07,200 INFO L225 Difference]: With dead ends: 1549 [2019-10-02 13:48:07,200 INFO L226 Difference]: Without dead ends: 792 [2019-10-02 13:48:07,204 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 13:48:07,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2019-10-02 13:48:07,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 792. [2019-10-02 13:48:07,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2019-10-02 13:48:07,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1069 transitions. [2019-10-02 13:48:07,276 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1069 transitions. Word has length 207 [2019-10-02 13:48:07,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:48:07,279 INFO L475 AbstractCegarLoop]: Abstraction has 792 states and 1069 transitions. [2019-10-02 13:48:07,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 13:48:07,279 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1069 transitions. [2019-10-02 13:48:07,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-10-02 13:48:07,287 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:48:07,288 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:48:07,288 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:48:07,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:48:07,289 INFO L82 PathProgramCache]: Analyzing trace with hash -664610348, now seen corresponding path program 1 times [2019-10-02 13:48:07,289 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:48:07,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:48:07,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:48:07,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:48:07,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:48:07,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:48:07,519 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-10-02 13:48:07,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:48:07,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:48:07,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:48:07,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:48:07,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:48:07,524 INFO L87 Difference]: Start difference. First operand 792 states and 1069 transitions. Second operand 3 states. [2019-10-02 13:48:07,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:48:07,798 INFO L93 Difference]: Finished difference Result 1542 states and 2102 transitions. [2019-10-02 13:48:07,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:48:07,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2019-10-02 13:48:07,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:48:07,807 INFO L225 Difference]: With dead ends: 1542 [2019-10-02 13:48:07,807 INFO L226 Difference]: Without dead ends: 791 [2019-10-02 13:48:07,810 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:48:07,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2019-10-02 13:48:07,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 791. [2019-10-02 13:48:07,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2019-10-02 13:48:07,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1065 transitions. [2019-10-02 13:48:07,864 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1065 transitions. Word has length 225 [2019-10-02 13:48:07,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:48:07,865 INFO L475 AbstractCegarLoop]: Abstraction has 791 states and 1065 transitions. [2019-10-02 13:48:07,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:48:07,865 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1065 transitions. [2019-10-02 13:48:07,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-10-02 13:48:07,875 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:48:07,876 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:48:07,876 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:48:07,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:48:07,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1053060183, now seen corresponding path program 1 times [2019-10-02 13:48:07,877 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:48:07,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:48:07,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:48:07,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:48:07,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:48:07,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:48:08,202 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-10-02 13:48:08,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:48:08,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 13:48:08,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 13:48:08,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 13:48:08,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 13:48:08,204 INFO L87 Difference]: Start difference. First operand 791 states and 1065 transitions. Second operand 4 states. [2019-10-02 13:48:08,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:48:08,931 INFO L93 Difference]: Finished difference Result 1513 states and 2048 transitions. [2019-10-02 13:48:08,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 13:48:08,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 226 [2019-10-02 13:48:08,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:48:08,939 INFO L225 Difference]: With dead ends: 1513 [2019-10-02 13:48:08,940 INFO L226 Difference]: Without dead ends: 788 [2019-10-02 13:48:08,942 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 13:48:08,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2019-10-02 13:48:08,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 788. [2019-10-02 13:48:08,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2019-10-02 13:48:08,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1048 transitions. [2019-10-02 13:48:08,987 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1048 transitions. Word has length 226 [2019-10-02 13:48:08,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:48:08,989 INFO L475 AbstractCegarLoop]: Abstraction has 788 states and 1048 transitions. [2019-10-02 13:48:08,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 13:48:08,989 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1048 transitions. [2019-10-02 13:48:08,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-10-02 13:48:08,994 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:48:08,994 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:48:08,995 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:48:08,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:48:08,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1140703033, now seen corresponding path program 1 times [2019-10-02 13:48:08,995 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:48:08,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:48:09,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:48:09,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:48:09,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:48:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:48:09,271 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-10-02 13:48:09,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:48:09,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:48:09,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:48:09,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:48:09,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:48:09,273 INFO L87 Difference]: Start difference. First operand 788 states and 1048 transitions. Second operand 3 states. [2019-10-02 13:48:09,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:48:09,342 INFO L93 Difference]: Finished difference Result 1229 states and 1615 transitions. [2019-10-02 13:48:09,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:48:09,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2019-10-02 13:48:09,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:48:09,350 INFO L225 Difference]: With dead ends: 1229 [2019-10-02 13:48:09,350 INFO L226 Difference]: Without dead ends: 791 [2019-10-02 13:48:09,353 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:48:09,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2019-10-02 13:48:09,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 790. [2019-10-02 13:48:09,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-10-02 13:48:09,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1050 transitions. [2019-10-02 13:48:09,397 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1050 transitions. Word has length 253 [2019-10-02 13:48:09,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:48:09,398 INFO L475 AbstractCegarLoop]: Abstraction has 790 states and 1050 transitions. [2019-10-02 13:48:09,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:48:09,399 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1050 transitions. [2019-10-02 13:48:09,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-10-02 13:48:09,406 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:48:09,407 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:48:09,407 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:48:09,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:48:09,408 INFO L82 PathProgramCache]: Analyzing trace with hash 548051965, now seen corresponding path program 1 times [2019-10-02 13:48:09,408 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:48:09,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:48:09,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:48:09,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:48:09,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:48:09,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:48:09,681 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-10-02 13:48:09,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:48:09,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:48:09,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:48:09,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:48:09,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:48:09,684 INFO L87 Difference]: Start difference. First operand 790 states and 1050 transitions. Second operand 3 states. [2019-10-02 13:48:09,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:48:09,743 INFO L93 Difference]: Finished difference Result 1518 states and 2056 transitions. [2019-10-02 13:48:09,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:48:09,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2019-10-02 13:48:09,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:48:09,751 INFO L225 Difference]: With dead ends: 1518 [2019-10-02 13:48:09,751 INFO L226 Difference]: Without dead ends: 845 [2019-10-02 13:48:09,755 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:48:09,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2019-10-02 13:48:09,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 844. [2019-10-02 13:48:09,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2019-10-02 13:48:09,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1138 transitions. [2019-10-02 13:48:09,796 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1138 transitions. Word has length 261 [2019-10-02 13:48:09,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:48:09,797 INFO L475 AbstractCegarLoop]: Abstraction has 844 states and 1138 transitions. [2019-10-02 13:48:09,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:48:09,797 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1138 transitions. [2019-10-02 13:48:09,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-10-02 13:48:09,806 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:48:09,807 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:48:09,807 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:48:09,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:48:09,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1285741977, now seen corresponding path program 1 times [2019-10-02 13:48:09,808 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:48:09,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:48:09,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:48:09,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:48:09,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:48:09,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:48:10,366 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-02 13:48:10,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:48:10,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 13:48:10,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 13:48:10,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 13:48:10,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-10-02 13:48:10,370 INFO L87 Difference]: Start difference. First operand 844 states and 1138 transitions. Second operand 11 states. [2019-10-02 13:48:19,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:48:19,844 INFO L93 Difference]: Finished difference Result 4616 states and 6640 transitions. [2019-10-02 13:48:19,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-02 13:48:19,845 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 262 [2019-10-02 13:48:19,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:48:19,870 INFO L225 Difference]: With dead ends: 4616 [2019-10-02 13:48:19,870 INFO L226 Difference]: Without dead ends: 4191 [2019-10-02 13:48:19,874 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=1007, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 13:48:19,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4191 states. [2019-10-02 13:48:20,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4191 to 4170. [2019-10-02 13:48:20,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4170 states. [2019-10-02 13:48:20,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4170 states to 4170 states and 5674 transitions. [2019-10-02 13:48:20,177 INFO L78 Accepts]: Start accepts. Automaton has 4170 states and 5674 transitions. Word has length 262 [2019-10-02 13:48:20,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:48:20,178 INFO L475 AbstractCegarLoop]: Abstraction has 4170 states and 5674 transitions. [2019-10-02 13:48:20,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 13:48:20,179 INFO L276 IsEmpty]: Start isEmpty. Operand 4170 states and 5674 transitions. [2019-10-02 13:48:20,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-10-02 13:48:20,185 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:48:20,186 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:48:20,187 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:48:20,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:48:20,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1735445867, now seen corresponding path program 1 times [2019-10-02 13:48:20,188 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:48:20,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:48:20,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:48:20,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:48:20,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:48:20,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:48:20,631 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-02 13:48:20,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:48:20,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-10-02 13:48:20,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-02 13:48:20,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-02 13:48:20,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-10-02 13:48:20,634 INFO L87 Difference]: Start difference. First operand 4170 states and 5674 transitions. Second operand 22 states. [2019-10-02 13:48:21,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:48:21,410 INFO L93 Difference]: Finished difference Result 7667 states and 10406 transitions. [2019-10-02 13:48:21,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-02 13:48:21,411 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 263 [2019-10-02 13:48:21,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:48:21,447 INFO L225 Difference]: With dead ends: 7667 [2019-10-02 13:48:21,447 INFO L226 Difference]: Without dead ends: 4280 [2019-10-02 13:48:21,465 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=853, Unknown=0, NotChecked=0, Total=930 [2019-10-02 13:48:21,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4280 states. [2019-10-02 13:48:21,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4280 to 4280. [2019-10-02 13:48:21,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4280 states. [2019-10-02 13:48:21,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4280 states to 4280 states and 5819 transitions. [2019-10-02 13:48:21,761 INFO L78 Accepts]: Start accepts. Automaton has 4280 states and 5819 transitions. Word has length 263 [2019-10-02 13:48:21,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:48:21,762 INFO L475 AbstractCegarLoop]: Abstraction has 4280 states and 5819 transitions. [2019-10-02 13:48:21,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-02 13:48:21,762 INFO L276 IsEmpty]: Start isEmpty. Operand 4280 states and 5819 transitions. [2019-10-02 13:48:21,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-10-02 13:48:21,768 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:48:21,769 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:48:21,769 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:48:21,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:48:21,770 INFO L82 PathProgramCache]: Analyzing trace with hash 2129296523, now seen corresponding path program 1 times [2019-10-02 13:48:21,770 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:48:21,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:48:21,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:48:21,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:48:21,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:48:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:48:22,311 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-02 13:48:22,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:48:22,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-10-02 13:48:22,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 13:48:22,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 13:48:22,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-10-02 13:48:22,313 INFO L87 Difference]: Start difference. First operand 4280 states and 5819 transitions. Second operand 24 states. [2019-10-02 13:48:23,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:48:23,188 INFO L93 Difference]: Finished difference Result 8259 states and 11369 transitions. [2019-10-02 13:48:23,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 13:48:23,189 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 272 [2019-10-02 13:48:23,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:48:23,218 INFO L225 Difference]: With dead ends: 8259 [2019-10-02 13:48:23,218 INFO L226 Difference]: Without dead ends: 4481 [2019-10-02 13:48:23,232 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 13:48:23,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4481 states. [2019-10-02 13:48:23,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4481 to 4481. [2019-10-02 13:48:23,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4481 states. [2019-10-02 13:48:23,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4481 states to 4481 states and 6163 transitions. [2019-10-02 13:48:23,441 INFO L78 Accepts]: Start accepts. Automaton has 4481 states and 6163 transitions. Word has length 272 [2019-10-02 13:48:23,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:48:23,443 INFO L475 AbstractCegarLoop]: Abstraction has 4481 states and 6163 transitions. [2019-10-02 13:48:23,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 13:48:23,443 INFO L276 IsEmpty]: Start isEmpty. Operand 4481 states and 6163 transitions. [2019-10-02 13:48:23,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-10-02 13:48:23,454 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:48:23,455 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:48:23,455 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:48:23,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:48:23,456 INFO L82 PathProgramCache]: Analyzing trace with hash -948496045, now seen corresponding path program 1 times [2019-10-02 13:48:23,456 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:48:23,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:48:23,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:48:23,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:48:23,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:48:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:48:23,802 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-10-02 13:48:23,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:48:23,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:48:23,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:48:23,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:48:23,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:48:23,803 INFO L87 Difference]: Start difference. First operand 4481 states and 6163 transitions. Second operand 3 states. [2019-10-02 13:48:24,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:48:24,122 INFO L93 Difference]: Finished difference Result 12756 states and 18477 transitions. [2019-10-02 13:48:24,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:48:24,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 276 [2019-10-02 13:48:24,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:48:24,176 INFO L225 Difference]: With dead ends: 12756 [2019-10-02 13:48:24,176 INFO L226 Difference]: Without dead ends: 8321 [2019-10-02 13:48:24,201 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:48:24,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8321 states. [2019-10-02 13:48:24,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8321 to 8309. [2019-10-02 13:48:24,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8309 states. [2019-10-02 13:48:24,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8309 states to 8309 states and 11728 transitions. [2019-10-02 13:48:24,618 INFO L78 Accepts]: Start accepts. Automaton has 8309 states and 11728 transitions. Word has length 276 [2019-10-02 13:48:24,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:48:24,619 INFO L475 AbstractCegarLoop]: Abstraction has 8309 states and 11728 transitions. [2019-10-02 13:48:24,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:48:24,619 INFO L276 IsEmpty]: Start isEmpty. Operand 8309 states and 11728 transitions. [2019-10-02 13:48:24,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-10-02 13:48:24,627 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:48:24,628 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:48:24,628 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:48:24,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:48:24,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1353980626, now seen corresponding path program 1 times [2019-10-02 13:48:24,629 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:48:24,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:48:24,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:48:24,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:48:24,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:48:24,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:48:24,886 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-02 13:48:24,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:48:24,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 13:48:24,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 13:48:24,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 13:48:24,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 13:48:24,888 INFO L87 Difference]: Start difference. First operand 8309 states and 11728 transitions. Second operand 6 states. [2019-10-02 13:48:26,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:48:26,067 INFO L93 Difference]: Finished difference Result 24174 states and 35225 transitions. [2019-10-02 13:48:26,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 13:48:26,067 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 272 [2019-10-02 13:48:26,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:48:26,155 INFO L225 Difference]: With dead ends: 24174 [2019-10-02 13:48:26,156 INFO L226 Difference]: Without dead ends: 16700 [2019-10-02 13:48:26,198 INFO L640 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-10-02 13:48:26,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16700 states. [2019-10-02 13:48:26,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16700 to 16571. [2019-10-02 13:48:26,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16571 states. [2019-10-02 13:48:26,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16571 states to 16571 states and 23687 transitions. [2019-10-02 13:48:26,953 INFO L78 Accepts]: Start accepts. Automaton has 16571 states and 23687 transitions. Word has length 272 [2019-10-02 13:48:26,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:48:26,954 INFO L475 AbstractCegarLoop]: Abstraction has 16571 states and 23687 transitions. [2019-10-02 13:48:26,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 13:48:26,954 INFO L276 IsEmpty]: Start isEmpty. Operand 16571 states and 23687 transitions. [2019-10-02 13:48:26,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-10-02 13:48:26,970 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:48:26,970 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:48:26,971 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:48:26,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:48:26,971 INFO L82 PathProgramCache]: Analyzing trace with hash -684946487, now seen corresponding path program 1 times [2019-10-02 13:48:26,971 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:48:26,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:48:26,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:48:26,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:48:26,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:48:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:48:28,035 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-02 13:48:28,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:48:28,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-02 13:48:28,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 13:48:28,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 13:48:28,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-10-02 13:48:28,038 INFO L87 Difference]: Start difference. First operand 16571 states and 23687 transitions. Second operand 15 states. [2019-10-02 13:48:28,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:48:28,805 INFO L93 Difference]: Finished difference Result 23380 states and 33019 transitions. [2019-10-02 13:48:28,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 13:48:28,806 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 273 [2019-10-02 13:48:28,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:48:28,884 INFO L225 Difference]: With dead ends: 23380 [2019-10-02 13:48:28,884 INFO L226 Difference]: Without dead ends: 16679 [2019-10-02 13:48:28,912 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=615, Unknown=0, NotChecked=0, Total=702 [2019-10-02 13:48:28,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16679 states. [2019-10-02 13:48:29,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16679 to 16577. [2019-10-02 13:48:29,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16577 states. [2019-10-02 13:48:29,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16577 states to 16577 states and 23699 transitions. [2019-10-02 13:48:29,823 INFO L78 Accepts]: Start accepts. Automaton has 16577 states and 23699 transitions. Word has length 273 [2019-10-02 13:48:29,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:48:29,823 INFO L475 AbstractCegarLoop]: Abstraction has 16577 states and 23699 transitions. [2019-10-02 13:48:29,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 13:48:29,824 INFO L276 IsEmpty]: Start isEmpty. Operand 16577 states and 23699 transitions. [2019-10-02 13:48:29,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-10-02 13:48:29,833 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:48:29,833 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:48:29,834 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:48:29,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:48:29,834 INFO L82 PathProgramCache]: Analyzing trace with hash -98170368, now seen corresponding path program 1 times [2019-10-02 13:48:29,834 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:48:29,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:48:29,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:48:29,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:48:29,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:48:29,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:48:30,073 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-02 13:48:30,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:48:30,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 13:48:30,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 13:48:30,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 13:48:30,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:48:30,077 INFO L87 Difference]: Start difference. First operand 16577 states and 23699 transitions. Second operand 5 states. [2019-10-02 13:48:32,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:48:32,681 INFO L93 Difference]: Finished difference Result 63332 states and 95354 transitions. [2019-10-02 13:48:32,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 13:48:32,681 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 273 [2019-10-02 13:48:32,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:48:32,924 INFO L225 Difference]: With dead ends: 63332 [2019-10-02 13:48:32,925 INFO L226 Difference]: Without dead ends: 48231 [2019-10-02 13:48:32,987 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:48:33,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48231 states. [2019-10-02 13:48:36,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48231 to 48041. [2019-10-02 13:48:36,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48041 states. [2019-10-02 13:48:36,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48041 states to 48041 states and 70977 transitions. [2019-10-02 13:48:36,305 INFO L78 Accepts]: Start accepts. Automaton has 48041 states and 70977 transitions. Word has length 273 [2019-10-02 13:48:36,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:48:36,305 INFO L475 AbstractCegarLoop]: Abstraction has 48041 states and 70977 transitions. [2019-10-02 13:48:36,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 13:48:36,306 INFO L276 IsEmpty]: Start isEmpty. Operand 48041 states and 70977 transitions. [2019-10-02 13:48:36,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-10-02 13:48:36,332 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:48:36,332 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:48:36,333 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:48:36,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:48:36,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1373230701, now seen corresponding path program 1 times [2019-10-02 13:48:36,333 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:48:36,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:48:36,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:48:36,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:48:36,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:48:36,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:48:36,495 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-10-02 13:48:36,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:48:36,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:48:36,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:48:36,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:48:36,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:48:36,497 INFO L87 Difference]: Start difference. First operand 48041 states and 70977 transitions. Second operand 3 states. [2019-10-02 13:48:40,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:48:40,005 INFO L93 Difference]: Finished difference Result 115687 states and 186877 transitions. [2019-10-02 13:48:40,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:48:40,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 278 [2019-10-02 13:48:40,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:48:40,314 INFO L225 Difference]: With dead ends: 115687 [2019-10-02 13:48:40,314 INFO L226 Difference]: Without dead ends: 67590 [2019-10-02 13:48:40,475 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:48:40,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67590 states. [2019-10-02 13:48:42,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67590 to 67563. [2019-10-02 13:48:42,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67563 states. [2019-10-02 13:48:42,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67563 states to 67563 states and 100228 transitions. [2019-10-02 13:48:42,893 INFO L78 Accepts]: Start accepts. Automaton has 67563 states and 100228 transitions. Word has length 278 [2019-10-02 13:48:42,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:48:42,893 INFO L475 AbstractCegarLoop]: Abstraction has 67563 states and 100228 transitions. [2019-10-02 13:48:42,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:48:42,893 INFO L276 IsEmpty]: Start isEmpty. Operand 67563 states and 100228 transitions. [2019-10-02 13:48:42,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-10-02 13:48:42,921 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:48:42,921 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:48:42,921 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:48:42,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:48:42,922 INFO L82 PathProgramCache]: Analyzing trace with hash -840988267, now seen corresponding path program 1 times [2019-10-02 13:48:42,922 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:48:42,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:48:42,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:48:42,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:48:42,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:48:42,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:48:43,363 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-10-02 13:48:43,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:48:43,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-10-02 13:48:43,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 13:48:43,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 13:48:43,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-10-02 13:48:43,365 INFO L87 Difference]: Start difference. First operand 67563 states and 100228 transitions. Second operand 24 states. [2019-10-02 13:48:45,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:48:45,632 INFO L93 Difference]: Finished difference Result 108044 states and 158124 transitions. [2019-10-02 13:48:45,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 13:48:45,633 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 279 [2019-10-02 13:48:45,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:48:45,981 INFO L225 Difference]: With dead ends: 108044 [2019-10-02 13:48:45,982 INFO L226 Difference]: Without dead ends: 68337 [2019-10-02 13:48:46,099 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 13:48:46,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68337 states. [2019-10-02 13:48:50,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68337 to 68325. [2019-10-02 13:48:50,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68325 states. [2019-10-02 13:48:50,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68325 states to 68325 states and 101232 transitions. [2019-10-02 13:48:50,609 INFO L78 Accepts]: Start accepts. Automaton has 68325 states and 101232 transitions. Word has length 279 [2019-10-02 13:48:50,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:48:50,610 INFO L475 AbstractCegarLoop]: Abstraction has 68325 states and 101232 transitions. [2019-10-02 13:48:50,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 13:48:50,610 INFO L276 IsEmpty]: Start isEmpty. Operand 68325 states and 101232 transitions. [2019-10-02 13:48:50,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-10-02 13:48:50,643 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:48:50,643 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:48:50,643 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:48:50,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:48:50,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1641164055, now seen corresponding path program 1 times [2019-10-02 13:48:50,644 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:48:50,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:48:50,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:48:50,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:48:50,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:48:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:48:50,978 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-02 13:48:50,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:48:50,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-10-02 13:48:50,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 13:48:50,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 13:48:50,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-10-02 13:48:50,983 INFO L87 Difference]: Start difference. First operand 68325 states and 101232 transitions. Second operand 17 states. [2019-10-02 13:48:55,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:48:55,008 INFO L93 Difference]: Finished difference Result 106876 states and 157799 transitions. [2019-10-02 13:48:55,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 13:48:55,008 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 282 [2019-10-02 13:48:55,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:48:55,219 INFO L225 Difference]: With dead ends: 106876 [2019-10-02 13:48:55,219 INFO L226 Difference]: Without dead ends: 68229 [2019-10-02 13:48:55,279 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=829, Unknown=0, NotChecked=0, Total=930 [2019-10-02 13:48:55,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68229 states. [2019-10-02 13:48:57,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68229 to 68017. [2019-10-02 13:48:57,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68017 states. [2019-10-02 13:48:57,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68017 states to 68017 states and 100061 transitions. [2019-10-02 13:48:57,471 INFO L78 Accepts]: Start accepts. Automaton has 68017 states and 100061 transitions. Word has length 282 [2019-10-02 13:48:57,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:48:57,472 INFO L475 AbstractCegarLoop]: Abstraction has 68017 states and 100061 transitions. [2019-10-02 13:48:57,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 13:48:57,472 INFO L276 IsEmpty]: Start isEmpty. Operand 68017 states and 100061 transitions. [2019-10-02 13:48:57,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-10-02 13:48:57,506 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:48:57,506 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:48:57,507 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:48:57,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:48:57,507 INFO L82 PathProgramCache]: Analyzing trace with hash 2002505633, now seen corresponding path program 1 times [2019-10-02 13:48:57,507 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:48:57,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:48:57,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:48:57,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:48:57,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:48:57,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:48:58,000 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-10-02 13:48:58,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:48:58,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-10-02 13:48:58,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 13:48:58,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 13:48:58,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-10-02 13:48:58,002 INFO L87 Difference]: Start difference. First operand 68017 states and 100061 transitions. Second operand 26 states. [2019-10-02 13:49:00,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:49:00,593 INFO L93 Difference]: Finished difference Result 111066 states and 166727 transitions. [2019-10-02 13:49:00,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 13:49:00,593 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 288 [2019-10-02 13:49:00,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:49:00,847 INFO L225 Difference]: With dead ends: 111066 [2019-10-02 13:49:00,847 INFO L226 Difference]: Without dead ends: 67297 [2019-10-02 13:49:00,925 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=1239, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 13:49:00,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67297 states. [2019-10-02 13:49:05,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67297 to 67237. [2019-10-02 13:49:05,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67237 states. [2019-10-02 13:49:05,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67237 states to 67237 states and 98381 transitions. [2019-10-02 13:49:05,840 INFO L78 Accepts]: Start accepts. Automaton has 67237 states and 98381 transitions. Word has length 288 [2019-10-02 13:49:05,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:49:05,841 INFO L475 AbstractCegarLoop]: Abstraction has 67237 states and 98381 transitions. [2019-10-02 13:49:05,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 13:49:05,841 INFO L276 IsEmpty]: Start isEmpty. Operand 67237 states and 98381 transitions. [2019-10-02 13:49:05,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-10-02 13:49:05,861 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:49:05,861 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:49:05,861 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:49:05,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:49:05,862 INFO L82 PathProgramCache]: Analyzing trace with hash -320496781, now seen corresponding path program 1 times [2019-10-02 13:49:05,862 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:49:05,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:49:05,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:49:05,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:49:05,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:49:05,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:49:06,202 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-10-02 13:49:06,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:49:06,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-10-02 13:49:06,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 13:49:06,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 13:49:06,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-10-02 13:49:06,204 INFO L87 Difference]: Start difference. First operand 67237 states and 98381 transitions. Second operand 17 states. [2019-10-02 13:49:07,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:49:07,940 INFO L93 Difference]: Finished difference Result 108110 states and 154779 transitions. [2019-10-02 13:49:07,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 13:49:07,940 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 289 [2019-10-02 13:49:07,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:49:08,241 INFO L225 Difference]: With dead ends: 108110 [2019-10-02 13:49:08,241 INFO L226 Difference]: Without dead ends: 67321 [2019-10-02 13:49:08,355 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=829, Unknown=0, NotChecked=0, Total=930 [2019-10-02 13:49:08,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67321 states. [2019-10-02 13:49:10,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67321 to 67117. [2019-10-02 13:49:10,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67117 states. [2019-10-02 13:49:10,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67117 states to 67117 states and 98203 transitions. [2019-10-02 13:49:10,623 INFO L78 Accepts]: Start accepts. Automaton has 67117 states and 98203 transitions. Word has length 289 [2019-10-02 13:49:10,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:49:10,624 INFO L475 AbstractCegarLoop]: Abstraction has 67117 states and 98203 transitions. [2019-10-02 13:49:10,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 13:49:10,624 INFO L276 IsEmpty]: Start isEmpty. Operand 67117 states and 98203 transitions. [2019-10-02 13:49:10,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-10-02 13:49:10,637 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:49:10,638 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:49:10,638 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:49:10,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:49:10,639 INFO L82 PathProgramCache]: Analyzing trace with hash 80762601, now seen corresponding path program 1 times [2019-10-02 13:49:10,639 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:49:10,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:49:10,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:49:10,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:49:10,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:49:10,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:49:10,808 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-10-02 13:49:10,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:49:10,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:49:10,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:49:10,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:49:10,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:49:10,811 INFO L87 Difference]: Start difference. First operand 67117 states and 98203 transitions. Second operand 3 states. [2019-10-02 13:49:12,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:49:12,506 INFO L93 Difference]: Finished difference Result 135236 states and 198292 transitions. [2019-10-02 13:49:12,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:49:12,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 302 [2019-10-02 13:49:12,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:49:12,718 INFO L225 Difference]: With dead ends: 135236 [2019-10-02 13:49:12,718 INFO L226 Difference]: Without dead ends: 68377 [2019-10-02 13:49:12,830 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:49:12,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68377 states. [2019-10-02 13:49:15,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68377 to 68365. [2019-10-02 13:49:15,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68365 states. [2019-10-02 13:49:15,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68365 states to 68365 states and 100342 transitions. [2019-10-02 13:49:15,444 INFO L78 Accepts]: Start accepts. Automaton has 68365 states and 100342 transitions. Word has length 302 [2019-10-02 13:49:15,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:49:15,445 INFO L475 AbstractCegarLoop]: Abstraction has 68365 states and 100342 transitions. [2019-10-02 13:49:15,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:49:15,445 INFO L276 IsEmpty]: Start isEmpty. Operand 68365 states and 100342 transitions. [2019-10-02 13:49:15,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-10-02 13:49:15,464 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:49:15,464 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:49:15,465 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:49:15,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:49:15,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1468618866, now seen corresponding path program 1 times [2019-10-02 13:49:15,465 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:49:15,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:49:15,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:49:15,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:49:15,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:49:15,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:49:15,724 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-10-02 13:49:15,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:49:15,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:49:15,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:49:15,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:49:15,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:49:15,726 INFO L87 Difference]: Start difference. First operand 68365 states and 100342 transitions. Second operand 3 states. [2019-10-02 13:49:17,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:49:17,756 INFO L93 Difference]: Finished difference Result 138884 states and 204589 transitions. [2019-10-02 13:49:17,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:49:17,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-10-02 13:49:17,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:49:17,968 INFO L225 Difference]: With dead ends: 138884 [2019-10-02 13:49:17,969 INFO L226 Difference]: Without dead ends: 70777 [2019-10-02 13:49:18,081 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:49:18,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70777 states. [2019-10-02 13:49:20,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70777 to 70765. [2019-10-02 13:49:20,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70765 states. [2019-10-02 13:49:20,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70765 states to 70765 states and 104476 transitions. [2019-10-02 13:49:20,703 INFO L78 Accepts]: Start accepts. Automaton has 70765 states and 104476 transitions. Word has length 310 [2019-10-02 13:49:20,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:49:20,704 INFO L475 AbstractCegarLoop]: Abstraction has 70765 states and 104476 transitions. [2019-10-02 13:49:20,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:49:20,704 INFO L276 IsEmpty]: Start isEmpty. Operand 70765 states and 104476 transitions. [2019-10-02 13:49:20,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-10-02 13:49:20,736 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:49:20,736 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:49:20,736 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:49:20,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:49:20,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1861927551, now seen corresponding path program 1 times [2019-10-02 13:49:20,737 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:49:20,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:49:20,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:49:20,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:49:20,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:49:20,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:49:21,177 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-10-02 13:49:21,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:49:21,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-02 13:49:21,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 13:49:21,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 13:49:21,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-10-02 13:49:21,179 INFO L87 Difference]: Start difference. First operand 70765 states and 104476 transitions. Second operand 19 states. [2019-10-02 13:49:25,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:49:25,343 INFO L93 Difference]: Finished difference Result 113114 states and 165548 transitions. [2019-10-02 13:49:25,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 13:49:25,343 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 298 [2019-10-02 13:49:25,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:49:25,547 INFO L225 Difference]: With dead ends: 113114 [2019-10-02 13:49:25,547 INFO L226 Difference]: Without dead ends: 70581 [2019-10-02 13:49:25,627 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=1075, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 13:49:25,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70581 states. [2019-10-02 13:49:27,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70581 to 70425. [2019-10-02 13:49:27,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70425 states. [2019-10-02 13:49:27,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70425 states to 70425 states and 103265 transitions. [2019-10-02 13:49:27,831 INFO L78 Accepts]: Start accepts. Automaton has 70425 states and 103265 transitions. Word has length 298 [2019-10-02 13:49:27,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:49:27,832 INFO L475 AbstractCegarLoop]: Abstraction has 70425 states and 103265 transitions. [2019-10-02 13:49:27,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 13:49:27,832 INFO L276 IsEmpty]: Start isEmpty. Operand 70425 states and 103265 transitions. [2019-10-02 13:49:27,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-10-02 13:49:27,854 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:49:27,855 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:49:27,855 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:49:27,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:49:27,856 INFO L82 PathProgramCache]: Analyzing trace with hash -178094010, now seen corresponding path program 1 times [2019-10-02 13:49:27,856 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:49:27,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:49:27,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:49:27,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:49:27,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:49:27,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:49:28,078 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-10-02 13:49:28,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:49:28,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:49:28,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:49:28,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:49:28,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:49:28,080 INFO L87 Difference]: Start difference. First operand 70425 states and 103265 transitions. Second operand 8 states. [2019-10-02 13:49:40,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:49:40,220 INFO L93 Difference]: Finished difference Result 212247 states and 315625 transitions. [2019-10-02 13:49:40,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 13:49:40,222 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 303 [2019-10-02 13:49:40,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:49:40,663 INFO L225 Difference]: With dead ends: 212247 [2019-10-02 13:49:40,663 INFO L226 Difference]: Without dead ends: 142080 [2019-10-02 13:49:40,798 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-02 13:49:40,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142080 states. [2019-10-02 13:49:44,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142080 to 78789. [2019-10-02 13:49:44,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78789 states. [2019-10-02 13:49:44,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78789 states to 78789 states and 119021 transitions. [2019-10-02 13:49:44,721 INFO L78 Accepts]: Start accepts. Automaton has 78789 states and 119021 transitions. Word has length 303 [2019-10-02 13:49:44,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:49:44,722 INFO L475 AbstractCegarLoop]: Abstraction has 78789 states and 119021 transitions. [2019-10-02 13:49:44,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:49:44,722 INFO L276 IsEmpty]: Start isEmpty. Operand 78789 states and 119021 transitions. [2019-10-02 13:49:44,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-10-02 13:49:44,776 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:49:44,776 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:49:44,776 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:49:44,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:49:44,777 INFO L82 PathProgramCache]: Analyzing trace with hash -430096756, now seen corresponding path program 1 times [2019-10-02 13:49:44,777 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:49:44,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:49:44,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:49:44,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:49:44,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:49:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:49:44,993 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-10-02 13:49:44,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:49:44,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:49:44,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:49:44,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:49:44,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:49:44,994 INFO L87 Difference]: Start difference. First operand 78789 states and 119021 transitions. Second operand 8 states. [2019-10-02 13:49:56,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:49:56,167 INFO L93 Difference]: Finished difference Result 238947 states and 369637 transitions. [2019-10-02 13:49:56,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 13:49:56,168 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 312 [2019-10-02 13:49:56,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:49:56,701 INFO L225 Difference]: With dead ends: 238947 [2019-10-02 13:49:56,701 INFO L226 Difference]: Without dead ends: 160416 [2019-10-02 13:49:56,840 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-02 13:49:56,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160416 states. [2019-10-02 13:50:04,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160416 to 95877. [2019-10-02 13:50:04,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95877 states. [2019-10-02 13:50:05,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95877 states to 95877 states and 153053 transitions. [2019-10-02 13:50:05,206 INFO L78 Accepts]: Start accepts. Automaton has 95877 states and 153053 transitions. Word has length 312 [2019-10-02 13:50:05,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:50:05,206 INFO L475 AbstractCegarLoop]: Abstraction has 95877 states and 153053 transitions. [2019-10-02 13:50:05,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:50:05,206 INFO L276 IsEmpty]: Start isEmpty. Operand 95877 states and 153053 transitions. [2019-10-02 13:50:05,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-10-02 13:50:05,312 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:50:05,312 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:50:05,312 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:50:05,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:50:05,313 INFO L82 PathProgramCache]: Analyzing trace with hash 232976450, now seen corresponding path program 1 times [2019-10-02 13:50:05,313 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:50:05,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:50:05,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:05,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:50:05,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:50:05,517 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-10-02 13:50:05,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:50:05,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:50:05,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:50:05,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:50:05,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:50:05,519 INFO L87 Difference]: Start difference. First operand 95877 states and 153053 transitions. Second operand 8 states. [2019-10-02 13:50:20,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:50:20,111 INFO L93 Difference]: Finished difference Result 293163 states and 485089 transitions. [2019-10-02 13:50:20,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 13:50:20,112 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 305 [2019-10-02 13:50:20,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:50:20,849 INFO L225 Difference]: With dead ends: 293163 [2019-10-02 13:50:20,849 INFO L226 Difference]: Without dead ends: 197544 [2019-10-02 13:50:21,058 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-02 13:50:21,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197544 states. [2019-10-02 13:50:27,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197544 to 130437. [2019-10-02 13:50:27,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130437 states. [2019-10-02 13:50:28,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130437 states to 130437 states and 225737 transitions. [2019-10-02 13:50:28,206 INFO L78 Accepts]: Start accepts. Automaton has 130437 states and 225737 transitions. Word has length 305 [2019-10-02 13:50:28,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:50:28,206 INFO L475 AbstractCegarLoop]: Abstraction has 130437 states and 225737 transitions. [2019-10-02 13:50:28,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:50:28,207 INFO L276 IsEmpty]: Start isEmpty. Operand 130437 states and 225737 transitions. [2019-10-02 13:50:28,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-10-02 13:50:28,443 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:50:28,443 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:50:28,444 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:50:28,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:50:28,444 INFO L82 PathProgramCache]: Analyzing trace with hash -324807403, now seen corresponding path program 1 times [2019-10-02 13:50:28,444 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:50:28,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:50:28,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:28,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:50:28,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:50:28,611 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-10-02 13:50:28,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:50:28,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:50:28,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:50:28,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:50:28,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:50:28,613 INFO L87 Difference]: Start difference. First operand 130437 states and 225737 transitions. Second operand 3 states. [2019-10-02 13:50:37,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:50:37,910 INFO L93 Difference]: Finished difference Result 297492 states and 532605 transitions. [2019-10-02 13:50:37,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:50:37,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2019-10-02 13:50:37,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:50:38,602 INFO L225 Difference]: With dead ends: 297492 [2019-10-02 13:50:38,602 INFO L226 Difference]: Without dead ends: 167313 [2019-10-02 13:50:39,387 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:50:39,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167313 states. [2019-10-02 13:50:50,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167313 to 167301. [2019-10-02 13:50:50,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167301 states. [2019-10-02 13:50:51,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167301 states to 167301 states and 306377 transitions. [2019-10-02 13:50:51,964 INFO L78 Accepts]: Start accepts. Automaton has 167301 states and 306377 transitions. Word has length 328 [2019-10-02 13:50:51,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:50:51,965 INFO L475 AbstractCegarLoop]: Abstraction has 167301 states and 306377 transitions. [2019-10-02 13:50:51,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:50:51,965 INFO L276 IsEmpty]: Start isEmpty. Operand 167301 states and 306377 transitions. [2019-10-02 13:50:52,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-10-02 13:50:52,374 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:50:52,374 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:50:52,375 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:50:52,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:50:52,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1977056766, now seen corresponding path program 1 times [2019-10-02 13:50:52,375 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:50:52,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:50:52,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:52,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:50:52,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:52,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:50:54,745 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-10-02 13:50:54,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:50:54,745 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:50:54,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:50:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:50:55,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 3797 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 13:50:55,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:50:56,232 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-10-02 13:50:56,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:50:56,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [65] total 73 [2019-10-02 13:50:56,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-10-02 13:50:56,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-10-02 13:50:56,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=5088, Unknown=0, NotChecked=0, Total=5256 [2019-10-02 13:50:56,246 INFO L87 Difference]: Start difference. First operand 167301 states and 306377 transitions. Second operand 73 states. [2019-10-02 13:52:00,452 WARN L191 SmtUtils]: Spent 704.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-10-02 13:55:42,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:55:42,384 INFO L93 Difference]: Finished difference Result 1602700 states and 3284423 transitions. [2019-10-02 13:55:42,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 464 states. [2019-10-02 13:55:42,384 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 311 [2019-10-02 13:55:42,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:55:54,518 INFO L225 Difference]: With dead ends: 1602700 [2019-10-02 13:55:54,518 INFO L226 Difference]: Without dead ends: 1401897 [2019-10-02 13:55:55,729 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 874 GetRequests, 338 SyntacticMatches, 4 SemanticMatches, 532 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107369 ImplicationChecksByTransitivity, 29.7s TimeCoverageRelationStatistics Valid=12337, Invalid=272285, Unknown=0, NotChecked=0, Total=284622 [2019-10-02 13:55:56,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401897 states.