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_spec7_product35.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 13:52:58,837 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 13:52:58,839 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 13:52:58,850 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 13:52:58,851 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 13:52:58,852 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 13:52:58,853 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 13:52:58,855 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 13:52:58,856 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 13:52:58,857 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 13:52:58,858 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 13:52:58,859 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 13:52:58,859 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 13:52:58,860 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 13:52:58,861 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 13:52:58,862 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 13:52:58,863 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 13:52:58,864 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 13:52:58,866 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 13:52:58,868 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 13:52:58,869 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 13:52:58,870 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 13:52:58,872 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 13:52:58,872 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 13:52:58,875 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 13:52:58,875 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 13:52:58,876 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 13:52:58,877 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 13:52:58,877 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 13:52:58,879 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 13:52:58,879 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 13:52:58,880 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 13:52:58,881 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 13:52:58,881 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 13:52:58,886 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 13:52:58,886 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 13:52:58,887 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 13:52:58,887 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 13:52:58,887 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 13:52:58,888 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 13:52:58,892 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 13:52:58,893 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:52:58,913 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 13:52:58,915 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 13:52:58,916 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 13:52:58,916 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 13:52:58,917 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 13:52:58,917 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 13:52:58,917 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 13:52:58,917 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 13:52:58,918 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 13:52:58,918 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 13:52:58,918 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 13:52:58,918 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 13:52:58,918 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 13:52:58,918 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 13:52:58,919 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 13:52:58,919 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 13:52:58,920 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 13:52:58,920 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 13:52:58,921 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 13:52:58,921 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 13:52:58,921 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 13:52:58,921 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 13:52:58,922 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 13:52:58,922 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 13:52:58,922 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 13:52:58,922 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 13:52:58,923 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 13:52:58,923 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 13:52:58,923 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 13:52:58,961 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 13:52:58,973 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 13:52:58,977 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 13:52:58,978 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 13:52:58,978 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 13:52:58,979 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec7_product35.cil.c [2019-10-02 13:52:59,051 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/785aef328/4d25418c2dcd4e218b33e87546dd4f42/FLAGf645401a9 [2019-10-02 13:52:59,671 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 13:52:59,672 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec7_product35.cil.c [2019-10-02 13:52:59,692 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/785aef328/4d25418c2dcd4e218b33e87546dd4f42/FLAGf645401a9 [2019-10-02 13:52:59,878 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/785aef328/4d25418c2dcd4e218b33e87546dd4f42 [2019-10-02 13:52:59,887 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 13:52:59,888 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 13:52:59,889 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 13:52:59,890 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 13:52:59,893 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 13:52:59,894 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:52:59" (1/1) ... [2019-10-02 13:52:59,897 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1af155ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:52:59, skipping insertion in model container [2019-10-02 13:52:59,897 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:52:59" (1/1) ... [2019-10-02 13:52:59,904 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 13:52:59,989 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 13:53:00,842 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:53:00,870 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 13:53:01,046 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:53:01,145 INFO L192 MainTranslator]: Completed translation [2019-10-02 13:53:01,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:53:01 WrapperNode [2019-10-02 13:53:01,146 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 13:53:01,147 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 13:53:01,147 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 13:53:01,148 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 13:53:01,164 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:53:01" (1/1) ... [2019-10-02 13:53:01,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:53:01" (1/1) ... [2019-10-02 13:53:01,232 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:53:01" (1/1) ... [2019-10-02 13:53:01,235 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:53:01" (1/1) ... [2019-10-02 13:53:01,312 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:53:01" (1/1) ... [2019-10-02 13:53:01,349 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:53:01" (1/1) ... [2019-10-02 13:53:01,369 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:53:01" (1/1) ... [2019-10-02 13:53:01,390 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 13:53:01,391 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 13:53:01,391 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 13:53:01,391 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 13:53:01,393 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:53: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:53:01,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 13:53:01,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 13:53:01,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 13:53:01,464 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 13:53:01,465 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 13:53:01,465 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AddressBook [2019-10-02 13:53:01,465 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Forward [2019-10-02 13:53:01,465 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 13:53:01,465 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 13:53:01,466 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 13:53:01,466 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 13:53:01,466 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 13:53:01,467 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 13:53:01,467 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 13:53:01,468 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-10-02 13:53:01,468 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AddressBook [2019-10-02 13:53:01,470 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 13:53:01,471 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 13:53:01,471 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-10-02 13:53:01,471 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-10-02 13:53:01,471 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-10-02 13:53:01,472 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-10-02 13:53:01,472 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 13:53:01,472 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 13:53:01,472 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 13:53:01,472 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 13:53:01,472 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 13:53:01,473 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 13:53:01,473 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 13:53:01,473 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 13:53:01,473 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 13:53:01,473 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-02 13:53:01,473 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-02 13:53:01,473 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-02 13:53:01,474 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-02 13:53:01,474 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-02 13:53:01,474 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 13:53:01,474 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 13:53:01,475 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 13:53:01,475 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 13:53:01,475 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 13:53:01,475 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 13:53:01,475 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 13:53:01,476 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 13:53:01,476 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 13:53:01,476 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 13:53:01,476 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 13:53:01,476 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 13:53:01,476 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 13:53:01,477 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 13:53:01,477 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 13:53:01,477 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 13:53:01,477 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 13:53:01,477 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 13:53:01,477 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 13:53:01,478 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 13:53:01,478 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 13:53:01,478 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 13:53:01,478 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 13:53:01,478 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 13:53:01,478 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 13:53:01,479 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 13:53:01,479 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 13:53:01,479 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 13:53:01,479 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 13:53:01,479 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptVerify_spec__1 [2019-10-02 13:53:01,479 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 13:53:01,480 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 13:53:01,480 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 13:53:01,480 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 13:53:01,480 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 13:53:01,480 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 13:53:01,481 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 13:53:01,481 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 13:53:01,482 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 13:53:01,482 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 13:53:01,482 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 13:53:01,482 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 13:53:01,482 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 13:53:01,482 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 13:53:01,483 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 13:53:01,483 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 13:53:01,483 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 13:53:01,484 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 13:53:01,484 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 13:53:01,484 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 13:53:01,484 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 13:53:01,485 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 13:53:01,485 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 13:53:01,486 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 13:53:01,486 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 13:53:01,487 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 13:53:01,487 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 13:53:01,487 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 13:53:01,487 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 13:53:01,488 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 13:53:01,488 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-02 13:53:01,488 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-02 13:53:01,488 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-02 13:53:01,488 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 13:53:01,488 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 13:53:01,489 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 13:53:01,489 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 13:53:01,489 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 13:53:01,489 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 13:53:01,489 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 13:53:01,490 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 13:53:01,490 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 13:53:01,490 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 13:53:01,490 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 13:53:01,490 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 13:53:01,490 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 13:53:01,491 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 13:53:01,491 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 13:53:01,491 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 13:53:01,491 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 13:53:01,492 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 13:53:01,492 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 13:53:01,492 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 13:53:01,492 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 13:53:01,493 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 13:53:01,493 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 13:53:01,493 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 13:53:01,493 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 13:53:01,495 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 13:53:01,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 13:53:01,495 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 13:53:01,495 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 13:53:01,495 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 13:53:01,496 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 13:53:01,496 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 13:53:01,496 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 13:53:01,496 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 13:53:01,497 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 13:53:01,497 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 13:53:01,497 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 13:53:01,497 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 13:53:01,497 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 13:53:01,498 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 13:53:01,498 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 13:53:01,502 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 13:53:01,503 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AddressBook [2019-10-02 13:53:01,503 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Forward [2019-10-02 13:53:01,504 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 13:53:01,511 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 13:53:01,511 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 13:53:01,511 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 13:53:01,512 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 13:53:01,512 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 13:53:01,512 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 13:53:01,513 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 13:53:01,513 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 13:53:01,513 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 13:53:01,513 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 13:53:01,514 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 13:53:01,514 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 13:53:01,514 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 13:53:01,514 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 13:53:01,514 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 13:53:01,514 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 13:53:01,515 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 13:53:01,515 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 13:53:01,515 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 13:53:01,515 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 13:53:01,515 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 13:53:01,515 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 13:53:01,516 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 13:53:01,516 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 13:53:01,516 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 13:53:01,516 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 13:53:01,516 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 13:53:01,516 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-02 13:53:01,517 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-02 13:53:01,517 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-02 13:53:01,517 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-02 13:53:01,517 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-02 13:53:01,517 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 13:53:01,517 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-10-02 13:53:01,518 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AddressBook [2019-10-02 13:53:01,518 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-10-02 13:53:01,518 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-10-02 13:53:01,518 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-10-02 13:53:01,518 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-10-02 13:53:01,518 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptVerify_spec__1 [2019-10-02 13:53:01,519 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 13:53:01,519 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 13:53:01,519 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 13:53:01,519 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 13:53:01,519 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 13:53:01,519 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 13:53:01,520 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 13:53:01,520 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 13:53:01,520 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 13:53:01,520 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 13:53:01,520 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 13:53:01,520 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 13:53:01,520 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 13:53:01,521 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 13:53:01,521 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 13:53:01,521 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 13:53:01,521 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 13:53:01,521 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 13:53:01,521 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 13:53:01,522 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 13:53:01,522 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 13:53:01,522 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 13:53:01,522 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 13:53:01,522 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 13:53:01,522 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 13:53:01,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 13:53:01,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 13:53:01,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 13:53:01,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 13:53:01,523 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 13:53:01,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 13:53:01,524 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 13:53:01,524 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 13:53:01,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 13:53:01,524 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 13:53:01,524 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 13:53:01,525 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 13:53:01,525 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 13:53:01,526 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 13:53:01,526 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 13:53:01,526 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 13:53:01,526 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 13:53:01,527 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 13:53:01,527 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 13:53:01,527 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 13:53:01,527 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 13:53:01,527 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 13:53:01,528 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 13:53:01,528 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 13:53:01,528 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 13:53:01,528 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 13:53:01,528 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 13:53:01,528 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 13:53:01,529 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 13:53:01,529 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 13:53:01,529 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 13:53:01,529 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 13:53:01,529 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 13:53:01,529 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-02 13:53:01,530 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-02 13:53:01,530 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-02 13:53:01,530 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 13:53:01,530 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 13:53:01,530 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 13:53:01,530 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 13:53:01,531 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 13:53:01,531 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 13:53:01,531 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 13:53:01,531 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 13:53:01,531 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 13:53:01,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 13:53:01,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 13:53:01,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 13:53:03,664 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 13:53:03,664 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 13:53:03,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:53:03 BoogieIcfgContainer [2019-10-02 13:53:03,666 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 13:53:03,667 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 13:53:03,668 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 13:53:03,671 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 13:53:03,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:52:59" (1/3) ... [2019-10-02 13:53:03,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@793ab545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:53:03, skipping insertion in model container [2019-10-02 13:53:03,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:53:01" (2/3) ... [2019-10-02 13:53:03,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@793ab545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:53:03, skipping insertion in model container [2019-10-02 13:53:03,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:53:03" (3/3) ... [2019-10-02 13:53:03,677 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec7_product35.cil.c [2019-10-02 13:53:03,688 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 13:53:03,701 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 13:53:03,721 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 13:53:03,763 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 13:53:03,764 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 13:53:03,764 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 13:53:03,764 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 13:53:03,765 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 13:53:03,765 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 13:53:03,765 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 13:53:03,765 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 13:53:03,765 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 13:53:03,806 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states. [2019-10-02 13:53:03,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-02 13:53:03,841 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:03,843 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:53:03,846 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:03,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:03,852 INFO L82 PathProgramCache]: Analyzing trace with hash 704600627, now seen corresponding path program 1 times [2019-10-02 13:53:03,853 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:03,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:03,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:03,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:03,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:04,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:04,562 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:53:04,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:04,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 13:53:04,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 13:53:04,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 13:53:04,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 13:53:04,586 INFO L87 Difference]: Start difference. First operand 679 states. Second operand 2 states. [2019-10-02 13:53:04,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:04,725 INFO L93 Difference]: Finished difference Result 1033 states and 1392 transitions. [2019-10-02 13:53:04,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 13:53:04,731 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 191 [2019-10-02 13:53:04,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:04,764 INFO L225 Difference]: With dead ends: 1033 [2019-10-02 13:53:04,765 INFO L226 Difference]: Without dead ends: 650 [2019-10-02 13:53:04,772 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 13:53:04,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-10-02 13:53:04,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2019-10-02 13:53:04,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-10-02 13:53:04,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 880 transitions. [2019-10-02 13:53:04,908 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 880 transitions. Word has length 191 [2019-10-02 13:53:04,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:04,912 INFO L475 AbstractCegarLoop]: Abstraction has 650 states and 880 transitions. [2019-10-02 13:53:04,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 13:53:04,912 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 880 transitions. [2019-10-02 13:53:04,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-02 13:53:04,924 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:04,924 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:53:04,924 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:04,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:04,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1790532570, now seen corresponding path program 1 times [2019-10-02 13:53:04,925 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:04,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:04,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:04,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:04,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:05,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:05,186 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:53:05,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:05,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:53:05,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:53:05,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:53:05,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:53:05,193 INFO L87 Difference]: Start difference. First operand 650 states and 880 transitions. Second operand 3 states. [2019-10-02 13:53:05,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:05,318 INFO L93 Difference]: Finished difference Result 1016 states and 1354 transitions. [2019-10-02 13:53:05,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:53:05,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-10-02 13:53:05,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:05,328 INFO L225 Difference]: With dead ends: 1016 [2019-10-02 13:53:05,328 INFO L226 Difference]: Without dead ends: 653 [2019-10-02 13:53:05,342 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:53:05,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-10-02 13:53:05,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 652. [2019-10-02 13:53:05,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2019-10-02 13:53:05,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 882 transitions. [2019-10-02 13:53:05,389 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 882 transitions. Word has length 192 [2019-10-02 13:53:05,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:05,391 INFO L475 AbstractCegarLoop]: Abstraction has 652 states and 882 transitions. [2019-10-02 13:53:05,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:53:05,391 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 882 transitions. [2019-10-02 13:53:05,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-02 13:53:05,397 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:05,397 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:53:05,397 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:05,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:05,398 INFO L82 PathProgramCache]: Analyzing trace with hash 94265161, now seen corresponding path program 1 times [2019-10-02 13:53:05,398 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:05,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:05,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:05,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:05,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:05,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:05,553 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:53:05,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:05,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:53:05,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:53:05,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:53:05,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:53:05,555 INFO L87 Difference]: Start difference. First operand 652 states and 882 transitions. Second operand 3 states. [2019-10-02 13:53:05,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:05,595 INFO L93 Difference]: Finished difference Result 1284 states and 1768 transitions. [2019-10-02 13:53:05,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:53:05,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-10-02 13:53:05,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:05,600 INFO L225 Difference]: With dead ends: 1284 [2019-10-02 13:53:05,600 INFO L226 Difference]: Without dead ends: 697 [2019-10-02 13:53:05,603 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:53:05,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2019-10-02 13:53:05,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 696. [2019-10-02 13:53:05,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-10-02 13:53:05,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 957 transitions. [2019-10-02 13:53:05,635 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 957 transitions. Word has length 204 [2019-10-02 13:53:05,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:05,636 INFO L475 AbstractCegarLoop]: Abstraction has 696 states and 957 transitions. [2019-10-02 13:53:05,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:53:05,636 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 957 transitions. [2019-10-02 13:53:05,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-10-02 13:53:05,640 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:05,641 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:53:05,641 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:05,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:05,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1429937952, now seen corresponding path program 1 times [2019-10-02 13:53:05,642 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:05,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:05,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:05,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:05,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:05,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:05,798 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:53:05,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:05,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:53:05,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:53:05,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:53:05,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:53:05,800 INFO L87 Difference]: Start difference. First operand 696 states and 957 transitions. Second operand 3 states. [2019-10-02 13:53:05,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:05,903 INFO L93 Difference]: Finished difference Result 1413 states and 1988 transitions. [2019-10-02 13:53:05,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:53:05,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-10-02 13:53:05,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:05,913 INFO L225 Difference]: With dead ends: 1413 [2019-10-02 13:53:05,914 INFO L226 Difference]: Without dead ends: 782 [2019-10-02 13:53:05,916 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:53:05,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2019-10-02 13:53:05,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 781. [2019-10-02 13:53:05,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2019-10-02 13:53:05,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1101 transitions. [2019-10-02 13:53:05,954 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1101 transitions. Word has length 205 [2019-10-02 13:53:05,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:05,955 INFO L475 AbstractCegarLoop]: Abstraction has 781 states and 1101 transitions. [2019-10-02 13:53:05,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:53:05,955 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1101 transitions. [2019-10-02 13:53:05,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-10-02 13:53:05,961 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:05,962 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:53:05,962 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:05,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:05,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1523480998, now seen corresponding path program 1 times [2019-10-02 13:53:05,963 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:05,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:05,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:05,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:05,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:06,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:06,464 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 13:53:06,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:06,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-02 13:53:06,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 13:53:06,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 13:53:06,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-10-02 13:53:06,468 INFO L87 Difference]: Start difference. First operand 781 states and 1101 transitions. Second operand 19 states. [2019-10-02 13:53:11,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:11,996 INFO L93 Difference]: Finished difference Result 2645 states and 3732 transitions. [2019-10-02 13:53:11,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-02 13:53:11,996 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 208 [2019-10-02 13:53:11,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:12,010 INFO L225 Difference]: With dead ends: 2645 [2019-10-02 13:53:12,011 INFO L226 Difference]: Without dead ends: 2295 [2019-10-02 13:53:12,014 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=287, Invalid=2683, Unknown=0, NotChecked=0, Total=2970 [2019-10-02 13:53:12,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2295 states. [2019-10-02 13:53:12,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2295 to 2258. [2019-10-02 13:53:12,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2258 states. [2019-10-02 13:53:12,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2258 states to 2258 states and 3200 transitions. [2019-10-02 13:53:12,124 INFO L78 Accepts]: Start accepts. Automaton has 2258 states and 3200 transitions. Word has length 208 [2019-10-02 13:53:12,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:12,125 INFO L475 AbstractCegarLoop]: Abstraction has 2258 states and 3200 transitions. [2019-10-02 13:53:12,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 13:53:12,125 INFO L276 IsEmpty]: Start isEmpty. Operand 2258 states and 3200 transitions. [2019-10-02 13:53:12,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-02 13:53:12,133 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:12,133 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:53:12,134 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:12,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:12,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1121180023, now seen corresponding path program 1 times [2019-10-02 13:53:12,134 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:12,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:12,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:12,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:12,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:12,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:12,430 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 13:53:12,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:12,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 13:53:12,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 13:53:12,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 13:53:12,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:53:12,432 INFO L87 Difference]: Start difference. First operand 2258 states and 3200 transitions. Second operand 13 states. [2019-10-02 13:53:13,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:13,165 INFO L93 Difference]: Finished difference Result 3859 states and 5423 transitions. [2019-10-02 13:53:13,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 13:53:13,166 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 209 [2019-10-02 13:53:13,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:13,183 INFO L225 Difference]: With dead ends: 3859 [2019-10-02 13:53:13,183 INFO L226 Difference]: Without dead ends: 2392 [2019-10-02 13:53:13,189 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2019-10-02 13:53:13,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states. [2019-10-02 13:53:13,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 2392. [2019-10-02 13:53:13,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2392 states. [2019-10-02 13:53:13,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2392 states to 2392 states and 3417 transitions. [2019-10-02 13:53:13,329 INFO L78 Accepts]: Start accepts. Automaton has 2392 states and 3417 transitions. Word has length 209 [2019-10-02 13:53:13,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:13,331 INFO L475 AbstractCegarLoop]: Abstraction has 2392 states and 3417 transitions. [2019-10-02 13:53:13,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 13:53:13,332 INFO L276 IsEmpty]: Start isEmpty. Operand 2392 states and 3417 transitions. [2019-10-02 13:53:13,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-02 13:53:13,342 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:13,342 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:53:13,342 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:13,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:13,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1128009189, now seen corresponding path program 1 times [2019-10-02 13:53:13,343 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:13,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:13,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:13,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:13,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:13,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:13,687 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 13:53:13,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:13,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-02 13:53:13,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 13:53:13,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 13:53:13,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-02 13:53:13,690 INFO L87 Difference]: Start difference. First operand 2392 states and 3417 transitions. Second operand 15 states. [2019-10-02 13:53:18,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:18,021 INFO L93 Difference]: Finished difference Result 4031 states and 5718 transitions. [2019-10-02 13:53:18,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-02 13:53:18,028 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 209 [2019-10-02 13:53:18,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:18,043 INFO L225 Difference]: With dead ends: 4031 [2019-10-02 13:53:18,043 INFO L226 Difference]: Without dead ends: 2510 [2019-10-02 13:53:18,049 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=229, Invalid=1933, Unknown=0, NotChecked=0, Total=2162 [2019-10-02 13:53:18,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2510 states. [2019-10-02 13:53:18,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2510 to 2473. [2019-10-02 13:53:18,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2473 states. [2019-10-02 13:53:18,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2473 states to 2473 states and 3557 transitions. [2019-10-02 13:53:18,192 INFO L78 Accepts]: Start accepts. Automaton has 2473 states and 3557 transitions. Word has length 209 [2019-10-02 13:53:18,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:18,193 INFO L475 AbstractCegarLoop]: Abstraction has 2473 states and 3557 transitions. [2019-10-02 13:53:18,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 13:53:18,193 INFO L276 IsEmpty]: Start isEmpty. Operand 2473 states and 3557 transitions. [2019-10-02 13:53:18,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-02 13:53:18,205 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:18,206 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-02 13:53:18,206 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:18,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:18,207 INFO L82 PathProgramCache]: Analyzing trace with hash 932196291, now seen corresponding path program 1 times [2019-10-02 13:53:18,207 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:18,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:18,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:18,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:18,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:18,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:18,432 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 13:53:18,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:18,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 13:53:18,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 13:53:18,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 13:53:18,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:53:18,435 INFO L87 Difference]: Start difference. First operand 2473 states and 3557 transitions. Second operand 5 states. [2019-10-02 13:53:18,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:18,595 INFO L93 Difference]: Finished difference Result 3675 states and 5188 transitions. [2019-10-02 13:53:18,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 13:53:18,595 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 212 [2019-10-02 13:53:18,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:18,609 INFO L225 Difference]: With dead ends: 3675 [2019-10-02 13:53:18,609 INFO L226 Difference]: Without dead ends: 2026 [2019-10-02 13:53:18,618 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 13:53:18,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states. [2019-10-02 13:53:18,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 2026. [2019-10-02 13:53:18,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2026 states. [2019-10-02 13:53:18,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2026 states to 2026 states and 2922 transitions. [2019-10-02 13:53:18,721 INFO L78 Accepts]: Start accepts. Automaton has 2026 states and 2922 transitions. Word has length 212 [2019-10-02 13:53:18,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:18,722 INFO L475 AbstractCegarLoop]: Abstraction has 2026 states and 2922 transitions. [2019-10-02 13:53:18,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 13:53:18,723 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 2922 transitions. [2019-10-02 13:53:18,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-02 13:53:18,733 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:18,734 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:53:18,734 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:18,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:18,735 INFO L82 PathProgramCache]: Analyzing trace with hash -151920076, now seen corresponding path program 1 times [2019-10-02 13:53:18,735 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:18,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:18,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:18,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:18,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:18,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:19,110 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 13:53:19,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:19,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-02 13:53:19,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 13:53:19,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 13:53:19,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:53:19,112 INFO L87 Difference]: Start difference. First operand 2026 states and 2922 transitions. Second operand 18 states. [2019-10-02 13:53:19,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:19,709 INFO L93 Difference]: Finished difference Result 3258 states and 4622 transitions. [2019-10-02 13:53:19,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 13:53:19,709 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 209 [2019-10-02 13:53:19,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:19,721 INFO L225 Difference]: With dead ends: 3258 [2019-10-02 13:53:19,721 INFO L226 Difference]: Without dead ends: 2058 [2019-10-02 13:53:19,727 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2019-10-02 13:53:19,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2058 states. [2019-10-02 13:53:19,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2058 to 2056. [2019-10-02 13:53:19,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2019-10-02 13:53:19,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 2951 transitions. [2019-10-02 13:53:19,820 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 2951 transitions. Word has length 209 [2019-10-02 13:53:19,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:19,821 INFO L475 AbstractCegarLoop]: Abstraction has 2056 states and 2951 transitions. [2019-10-02 13:53:19,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 13:53:19,822 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2951 transitions. [2019-10-02 13:53:19,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-02 13:53:19,831 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:19,832 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:53:19,832 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:19,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:19,832 INFO L82 PathProgramCache]: Analyzing trace with hash 712856251, now seen corresponding path program 1 times [2019-10-02 13:53:19,832 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:19,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:19,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:19,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:19,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:19,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:20,049 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 13:53:20,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:20,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 13:53:20,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 13:53:20,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 13:53:20,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:53:20,051 INFO L87 Difference]: Start difference. First operand 2056 states and 2951 transitions. Second operand 5 states. [2019-10-02 13:53:21,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:21,456 INFO L93 Difference]: Finished difference Result 5346 states and 7670 transitions. [2019-10-02 13:53:21,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 13:53:21,457 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 209 [2019-10-02 13:53:21,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:21,486 INFO L225 Difference]: With dead ends: 5346 [2019-10-02 13:53:21,486 INFO L226 Difference]: Without dead ends: 4507 [2019-10-02 13:53:21,493 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:53:21,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4507 states. [2019-10-02 13:53:21,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4507 to 4493. [2019-10-02 13:53:21,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4493 states. [2019-10-02 13:53:21,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4493 states to 4493 states and 6451 transitions. [2019-10-02 13:53:21,735 INFO L78 Accepts]: Start accepts. Automaton has 4493 states and 6451 transitions. Word has length 209 [2019-10-02 13:53:21,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:21,735 INFO L475 AbstractCegarLoop]: Abstraction has 4493 states and 6451 transitions. [2019-10-02 13:53:21,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 13:53:21,736 INFO L276 IsEmpty]: Start isEmpty. Operand 4493 states and 6451 transitions. [2019-10-02 13:53:21,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-02 13:53:21,746 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:21,746 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:53:21,747 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:21,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:21,747 INFO L82 PathProgramCache]: Analyzing trace with hash 733193626, now seen corresponding path program 1 times [2019-10-02 13:53:21,747 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:21,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:21,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:21,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:21,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:21,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:22,011 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 13:53:22,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:22,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 13:53:22,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 13:53:22,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 13:53:22,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:53:22,013 INFO L87 Difference]: Start difference. First operand 4493 states and 6451 transitions. Second operand 7 states. [2019-10-02 13:53:24,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:24,358 INFO L93 Difference]: Finished difference Result 14446 states and 22288 transitions. [2019-10-02 13:53:24,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 13:53:24,360 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 209 [2019-10-02 13:53:24,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:24,426 INFO L225 Difference]: With dead ends: 14446 [2019-10-02 13:53:24,427 INFO L226 Difference]: Without dead ends: 11171 [2019-10-02 13:53:24,447 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:53:24,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11171 states. [2019-10-02 13:53:24,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11171 to 11161. [2019-10-02 13:53:24,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11161 states. [2019-10-02 13:53:24,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11161 states to 11161 states and 16971 transitions. [2019-10-02 13:53:24,958 INFO L78 Accepts]: Start accepts. Automaton has 11161 states and 16971 transitions. Word has length 209 [2019-10-02 13:53:24,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:24,959 INFO L475 AbstractCegarLoop]: Abstraction has 11161 states and 16971 transitions. [2019-10-02 13:53:24,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 13:53:24,959 INFO L276 IsEmpty]: Start isEmpty. Operand 11161 states and 16971 transitions. [2019-10-02 13:53:24,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-02 13:53:24,970 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:24,970 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:53:24,971 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:24,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:24,971 INFO L82 PathProgramCache]: Analyzing trace with hash 588620997, now seen corresponding path program 1 times [2019-10-02 13:53:24,971 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:24,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:24,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:24,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:24,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:25,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:25,470 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 13:53:25,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:25,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-10-02 13:53:25,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-02 13:53:25,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-02 13:53:25,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-10-02 13:53:25,472 INFO L87 Difference]: Start difference. First operand 11161 states and 16971 transitions. Second operand 28 states. [2019-10-02 13:53:26,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:26,863 INFO L93 Difference]: Finished difference Result 21455 states and 33255 transitions. [2019-10-02 13:53:26,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-02 13:53:26,864 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 210 [2019-10-02 13:53:26,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:26,942 INFO L225 Difference]: With dead ends: 21455 [2019-10-02 13:53:26,942 INFO L226 Difference]: Without dead ends: 11512 [2019-10-02 13:53:26,987 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=1459, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 13:53:27,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11512 states. [2019-10-02 13:53:27,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11512 to 11487. [2019-10-02 13:53:27,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11487 states. [2019-10-02 13:53:27,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11487 states to 11487 states and 17430 transitions. [2019-10-02 13:53:27,515 INFO L78 Accepts]: Start accepts. Automaton has 11487 states and 17430 transitions. Word has length 210 [2019-10-02 13:53:27,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:27,516 INFO L475 AbstractCegarLoop]: Abstraction has 11487 states and 17430 transitions. [2019-10-02 13:53:27,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-02 13:53:27,516 INFO L276 IsEmpty]: Start isEmpty. Operand 11487 states and 17430 transitions. [2019-10-02 13:53:27,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-10-02 13:53:27,525 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:27,525 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:53:27,525 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:27,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:27,526 INFO L82 PathProgramCache]: Analyzing trace with hash -410361531, now seen corresponding path program 1 times [2019-10-02 13:53:27,526 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:27,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:27,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:27,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:27,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:27,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:27,713 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 13:53:27,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:27,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 13:53:27,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 13:53:27,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 13:53:27,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 13:53:27,715 INFO L87 Difference]: Start difference. First operand 11487 states and 17430 transitions. Second operand 10 states. [2019-10-02 13:53:28,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:28,082 INFO L93 Difference]: Finished difference Result 11586 states and 17616 transitions. [2019-10-02 13:53:28,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 13:53:28,082 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 214 [2019-10-02 13:53:28,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:28,139 INFO L225 Difference]: With dead ends: 11586 [2019-10-02 13:53:28,139 INFO L226 Difference]: Without dead ends: 11583 [2019-10-02 13:53:28,149 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 13:53:28,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11583 states. [2019-10-02 13:53:28,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11583 to 11583. [2019-10-02 13:53:28,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11583 states. [2019-10-02 13:53:28,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11583 states to 11583 states and 17582 transitions. [2019-10-02 13:53:28,692 INFO L78 Accepts]: Start accepts. Automaton has 11583 states and 17582 transitions. Word has length 214 [2019-10-02 13:53:28,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:28,693 INFO L475 AbstractCegarLoop]: Abstraction has 11583 states and 17582 transitions. [2019-10-02 13:53:28,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 13:53:28,693 INFO L276 IsEmpty]: Start isEmpty. Operand 11583 states and 17582 transitions. [2019-10-02 13:53:28,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-10-02 13:53:28,703 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:28,704 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:53:28,704 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:28,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:28,704 INFO L82 PathProgramCache]: Analyzing trace with hash -180221892, now seen corresponding path program 1 times [2019-10-02 13:53:28,704 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:28,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:28,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:28,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:28,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:28,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:28,852 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 13:53:28,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:28,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 13:53:28,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 13:53:28,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 13:53:28,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:53:28,854 INFO L87 Difference]: Start difference. First operand 11583 states and 17582 transitions. Second operand 5 states. [2019-10-02 13:53:29,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:29,238 INFO L93 Difference]: Finished difference Result 22155 states and 34017 transitions. [2019-10-02 13:53:29,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 13:53:29,239 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 219 [2019-10-02 13:53:29,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:29,306 INFO L225 Difference]: With dead ends: 22155 [2019-10-02 13:53:29,306 INFO L226 Difference]: Without dead ends: 11838 [2019-10-02 13:53:30,083 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:53:30,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11838 states. [2019-10-02 13:53:30,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11838 to 11687. [2019-10-02 13:53:30,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11687 states. [2019-10-02 13:53:30,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11687 states to 11687 states and 17699 transitions. [2019-10-02 13:53:30,627 INFO L78 Accepts]: Start accepts. Automaton has 11687 states and 17699 transitions. Word has length 219 [2019-10-02 13:53:30,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:30,628 INFO L475 AbstractCegarLoop]: Abstraction has 11687 states and 17699 transitions. [2019-10-02 13:53:30,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 13:53:30,628 INFO L276 IsEmpty]: Start isEmpty. Operand 11687 states and 17699 transitions. [2019-10-02 13:53:30,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-10-02 13:53:30,638 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:30,639 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:53:30,639 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:30,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:30,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1951283172, now seen corresponding path program 1 times [2019-10-02 13:53:30,639 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:30,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:30,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:30,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:30,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:30,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:30,801 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 13:53:30,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:30,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 13:53:30,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 13:53:30,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 13:53:30,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 13:53:30,803 INFO L87 Difference]: Start difference. First operand 11687 states and 17699 transitions. Second operand 6 states. [2019-10-02 13:53:31,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:31,872 INFO L93 Difference]: Finished difference Result 33962 states and 52112 transitions. [2019-10-02 13:53:31,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 13:53:31,873 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 220 [2019-10-02 13:53:31,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:31,980 INFO L225 Difference]: With dead ends: 33962 [2019-10-02 13:53:31,980 INFO L226 Difference]: Without dead ends: 23493 [2019-10-02 13:53:32,021 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:53:32,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23493 states. [2019-10-02 13:53:32,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23493 to 23163. [2019-10-02 13:53:32,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23163 states. [2019-10-02 13:53:33,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23163 states to 23163 states and 35113 transitions. [2019-10-02 13:53:33,055 INFO L78 Accepts]: Start accepts. Automaton has 23163 states and 35113 transitions. Word has length 220 [2019-10-02 13:53:33,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:33,056 INFO L475 AbstractCegarLoop]: Abstraction has 23163 states and 35113 transitions. [2019-10-02 13:53:33,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 13:53:33,056 INFO L276 IsEmpty]: Start isEmpty. Operand 23163 states and 35113 transitions. [2019-10-02 13:53:33,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-10-02 13:53:33,086 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:33,087 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:53:33,087 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:33,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:33,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1686908772, now seen corresponding path program 1 times [2019-10-02 13:53:33,087 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:33,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:33,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:33,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:33,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:33,214 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:53:33,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:33,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:53:33,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:53:33,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:53:33,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:53:33,216 INFO L87 Difference]: Start difference. First operand 23163 states and 35113 transitions. Second operand 3 states. [2019-10-02 13:53:33,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:33,805 INFO L93 Difference]: Finished difference Result 47251 states and 72055 transitions. [2019-10-02 13:53:33,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:53:33,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 240 [2019-10-02 13:53:33,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:33,913 INFO L225 Difference]: With dead ends: 47251 [2019-10-02 13:53:33,913 INFO L226 Difference]: Without dead ends: 24153 [2019-10-02 13:53:33,975 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:53:33,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24153 states. [2019-10-02 13:53:36,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24153 to 24147. [2019-10-02 13:53:36,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24147 states. [2019-10-02 13:53:36,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24147 states to 24147 states and 36985 transitions. [2019-10-02 13:53:36,257 INFO L78 Accepts]: Start accepts. Automaton has 24147 states and 36985 transitions. Word has length 240 [2019-10-02 13:53:36,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:36,258 INFO L475 AbstractCegarLoop]: Abstraction has 24147 states and 36985 transitions. [2019-10-02 13:53:36,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:53:36,258 INFO L276 IsEmpty]: Start isEmpty. Operand 24147 states and 36985 transitions. [2019-10-02 13:53:36,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-10-02 13:53:36,290 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:36,290 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:53:36,290 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:36,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:36,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1442139440, now seen corresponding path program 1 times [2019-10-02 13:53:36,291 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:36,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:36,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:36,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:36,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:36,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:36,500 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:53:36,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:36,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:53:36,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:53:36,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:53:36,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:53:36,502 INFO L87 Difference]: Start difference. First operand 24147 states and 36985 transitions. Second operand 8 states. [2019-10-02 13:53:42,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:42,412 INFO L93 Difference]: Finished difference Result 73055 states and 114685 transitions. [2019-10-02 13:53:42,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 13:53:42,413 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 256 [2019-10-02 13:53:42,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:42,669 INFO L225 Difference]: With dead ends: 73055 [2019-10-02 13:53:42,669 INFO L226 Difference]: Without dead ends: 48973 [2019-10-02 13:53:42,769 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:53:42,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48973 states. [2019-10-02 13:53:44,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48973 to 27873. [2019-10-02 13:53:44,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27873 states. [2019-10-02 13:53:44,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27873 states to 27873 states and 44809 transitions. [2019-10-02 13:53:44,366 INFO L78 Accepts]: Start accepts. Automaton has 27873 states and 44809 transitions. Word has length 256 [2019-10-02 13:53:44,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:44,367 INFO L475 AbstractCegarLoop]: Abstraction has 27873 states and 44809 transitions. [2019-10-02 13:53:44,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:53:44,367 INFO L276 IsEmpty]: Start isEmpty. Operand 27873 states and 44809 transitions. [2019-10-02 13:53:44,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-10-02 13:53:44,416 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:44,417 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:53:44,417 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:44,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:44,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1149833451, now seen corresponding path program 1 times [2019-10-02 13:53:44,417 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:44,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:44,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:44,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:44,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:44,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:44,599 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:53:44,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:44,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:53:44,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:53:44,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:53:44,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:53:44,601 INFO L87 Difference]: Start difference. First operand 27873 states and 44809 transitions. Second operand 8 states. [2019-10-02 13:53:52,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:52,804 INFO L93 Difference]: Finished difference Result 85037 states and 142201 transitions. [2019-10-02 13:53:52,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 13:53:52,805 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 242 [2019-10-02 13:53:52,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:53,057 INFO L225 Difference]: With dead ends: 85037 [2019-10-02 13:53:53,057 INFO L226 Difference]: Without dead ends: 57229 [2019-10-02 13:53:53,143 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:53:53,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57229 states. [2019-10-02 13:53:56,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57229 to 35505. [2019-10-02 13:53:56,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35505 states. [2019-10-02 13:53:56,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35505 states to 35505 states and 62053 transitions. [2019-10-02 13:53:56,516 INFO L78 Accepts]: Start accepts. Automaton has 35505 states and 62053 transitions. Word has length 242 [2019-10-02 13:53:56,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:56,517 INFO L475 AbstractCegarLoop]: Abstraction has 35505 states and 62053 transitions. [2019-10-02 13:53:56,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:53:56,517 INFO L276 IsEmpty]: Start isEmpty. Operand 35505 states and 62053 transitions. [2019-10-02 13:53:56,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-02 13:53:56,586 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:56,587 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:53:56,587 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:56,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:56,587 INFO L82 PathProgramCache]: Analyzing trace with hash -132595956, now seen corresponding path program 1 times [2019-10-02 13:53:56,587 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:56,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:56,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:56,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:56,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:56,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:56,789 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:53:56,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:56,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:53:56,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:53:56,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:53:56,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:53:56,791 INFO L87 Difference]: Start difference. First operand 35505 states and 62053 transitions. Second operand 8 states. [2019-10-02 13:54:05,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:54:05,345 INFO L93 Difference]: Finished difference Result 109409 states and 201955 transitions. [2019-10-02 13:54:05,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 13:54:05,345 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 258 [2019-10-02 13:54:05,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:54:05,716 INFO L225 Difference]: With dead ends: 109409 [2019-10-02 13:54:05,717 INFO L226 Difference]: Without dead ends: 73969 [2019-10-02 13:54:05,804 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:54:05,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73969 states. [2019-10-02 13:54:08,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73969 to 50961. [2019-10-02 13:54:08,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50961 states. [2019-10-02 13:54:08,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50961 states to 50961 states and 99523 transitions. [2019-10-02 13:54:08,288 INFO L78 Accepts]: Start accepts. Automaton has 50961 states and 99523 transitions. Word has length 258 [2019-10-02 13:54:08,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:54:08,289 INFO L475 AbstractCegarLoop]: Abstraction has 50961 states and 99523 transitions. [2019-10-02 13:54:08,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:54:08,289 INFO L276 IsEmpty]: Start isEmpty. Operand 50961 states and 99523 transitions. [2019-10-02 13:54:08,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-10-02 13:54:08,417 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:54:08,418 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:54:08,418 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:54:08,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:54:08,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1699977440, now seen corresponding path program 1 times [2019-10-02 13:54:08,419 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:54:08,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:54:08,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:08,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:54:08,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:54:08,614 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:54:08,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:54:08,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:54:08,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:54:08,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:54:08,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:54:08,616 INFO L87 Difference]: Start difference. First operand 50961 states and 99523 transitions. Second operand 8 states. [2019-10-02 13:54:12,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:54:12,674 INFO L93 Difference]: Finished difference Result 124398 states and 237276 transitions. [2019-10-02 13:54:12,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 13:54:12,675 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 239 [2019-10-02 13:54:12,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:54:13,153 INFO L225 Difference]: With dead ends: 124398 [2019-10-02 13:54:13,153 INFO L226 Difference]: Without dead ends: 103522 [2019-10-02 13:54:13,256 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:54:13,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103522 states. [2019-10-02 13:54:19,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103522 to 103371. [2019-10-02 13:54:19,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103371 states. [2019-10-02 13:54:20,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103371 states to 103371 states and 203203 transitions. [2019-10-02 13:54:20,256 INFO L78 Accepts]: Start accepts. Automaton has 103371 states and 203203 transitions. Word has length 239 [2019-10-02 13:54:20,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:54:20,257 INFO L475 AbstractCegarLoop]: Abstraction has 103371 states and 203203 transitions. [2019-10-02 13:54:20,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:54:20,257 INFO L276 IsEmpty]: Start isEmpty. Operand 103371 states and 203203 transitions. [2019-10-02 13:54:20,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-10-02 13:54:20,587 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:54:20,588 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:54:20,588 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:54:20,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:54:20,588 INFO L82 PathProgramCache]: Analyzing trace with hash -546975224, now seen corresponding path program 1 times [2019-10-02 13:54:20,588 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:54:20,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:54:20,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:20,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:54:20,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:20,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:54:20,857 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 13:54:20,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:54:20,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-02 13:54:20,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 13:54:20,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 13:54:20,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-02 13:54:20,859 INFO L87 Difference]: Start difference. First operand 103371 states and 203203 transitions. Second operand 15 states. [2019-10-02 13:54:31,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:54:31,052 INFO L93 Difference]: Finished difference Result 136191 states and 256582 transitions. [2019-10-02 13:54:31,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-02 13:54:31,052 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 240 [2019-10-02 13:54:31,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:54:31,485 INFO L225 Difference]: With dead ends: 136191 [2019-10-02 13:54:31,486 INFO L226 Difference]: Without dead ends: 103140 [2019-10-02 13:54:31,575 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=1166, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 13:54:31,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103140 states. [2019-10-02 13:54:35,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103140 to 102466. [2019-10-02 13:54:35,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102466 states. [2019-10-02 13:54:35,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102466 states to 102466 states and 201092 transitions. [2019-10-02 13:54:35,733 INFO L78 Accepts]: Start accepts. Automaton has 102466 states and 201092 transitions. Word has length 240 [2019-10-02 13:54:35,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:54:35,734 INFO L475 AbstractCegarLoop]: Abstraction has 102466 states and 201092 transitions. [2019-10-02 13:54:35,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 13:54:35,734 INFO L276 IsEmpty]: Start isEmpty. Operand 102466 states and 201092 transitions. [2019-10-02 13:54:36,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-10-02 13:54:36,798 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:54:36,799 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:54:36,799 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:54:36,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:54:36,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1705630931, now seen corresponding path program 1 times [2019-10-02 13:54:36,799 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:54:36,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:54:36,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:36,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:54:36,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:36,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:54:36,980 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 13:54:36,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:54:36,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 13:54:36,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 13:54:36,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 13:54:36,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:54:36,981 INFO L87 Difference]: Start difference. First operand 102466 states and 201092 transitions. Second operand 7 states. [2019-10-02 13:54:51,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:54:51,025 INFO L93 Difference]: Finished difference Result 281020 states and 570327 transitions. [2019-10-02 13:54:51,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 13:54:51,028 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 240 [2019-10-02 13:54:51,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:54:52,033 INFO L225 Difference]: With dead ends: 281020 [2019-10-02 13:54:52,033 INFO L226 Difference]: Without dead ends: 238936 [2019-10-02 13:54:52,183 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:54:52,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238936 states. [2019-10-02 13:55:06,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238936 to 205679. [2019-10-02 13:55:06,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205679 states. [2019-10-02 13:55:08,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205679 states to 205679 states and 406409 transitions. [2019-10-02 13:55:08,316 INFO L78 Accepts]: Start accepts. Automaton has 205679 states and 406409 transitions. Word has length 240 [2019-10-02 13:55:08,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:55:08,316 INFO L475 AbstractCegarLoop]: Abstraction has 205679 states and 406409 transitions. [2019-10-02 13:55:08,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 13:55:08,317 INFO L276 IsEmpty]: Start isEmpty. Operand 205679 states and 406409 transitions. [2019-10-02 13:55:08,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-10-02 13:55:08,929 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:55:08,929 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:55:08,930 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:55:08,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:55:08,930 INFO L82 PathProgramCache]: Analyzing trace with hash -395326311, now seen corresponding path program 2 times [2019-10-02 13:55:08,930 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:55:08,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:55:08,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:08,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:55:08,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:08,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:55:09,132 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 13:55:09,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:55:09,133 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:55:09,293 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 13:55:09,921 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 13:55:09,921 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 13:55:09,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 3229 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:55:09,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:55:10,223 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 13:55:10,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:55:10,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2019-10-02 13:55:10,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 13:55:10,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 13:55:10,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:55:10,238 INFO L87 Difference]: Start difference. First operand 205679 states and 406409 transitions. Second operand 18 states. [2019-10-02 13:55:29,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:55:29,085 INFO L93 Difference]: Finished difference Result 412002 states and 813968 transitions. [2019-10-02 13:55:29,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 13:55:29,085 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 240 [2019-10-02 13:55:29,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:55:30,466 INFO L225 Difference]: With dead ends: 412002 [2019-10-02 13:55:30,469 INFO L226 Difference]: Without dead ends: 206375 [2019-10-02 13:55:31,051 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=915, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 13:55:31,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206375 states. [2019-10-02 13:55:53,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206375 to 205957. [2019-10-02 13:55:53,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205957 states. [2019-10-02 13:55:55,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205957 states to 205957 states and 406781 transitions. [2019-10-02 13:55:55,124 INFO L78 Accepts]: Start accepts. Automaton has 205957 states and 406781 transitions. Word has length 240 [2019-10-02 13:55:55,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:55:55,125 INFO L475 AbstractCegarLoop]: Abstraction has 205957 states and 406781 transitions. [2019-10-02 13:55:55,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 13:55:55,125 INFO L276 IsEmpty]: Start isEmpty. Operand 205957 states and 406781 transitions. [2019-10-02 13:55:55,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-10-02 13:55:55,800 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:55:55,801 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:55:55,801 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:55:55,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:55:55,801 INFO L82 PathProgramCache]: Analyzing trace with hash -114245884, now seen corresponding path program 1 times [2019-10-02 13:55:55,801 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:55:55,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:55:55,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:55,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 13:55:55,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:55,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:55:56,045 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-02 13:55:56,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:55:56,046 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:55:56,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:55:56,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:55:56,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 3432 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:55:56,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:55:56,775 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 13:55:56,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:55:56,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-10-02 13:55:56,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 13:55:56,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 13:55:56,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-10-02 13:55:56,794 INFO L87 Difference]: Start difference. First operand 205957 states and 406781 transitions. Second operand 12 states. [2019-10-02 13:56:09,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:56:09,146 INFO L93 Difference]: Finished difference Result 351641 states and 672728 transitions. [2019-10-02 13:56:09,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 13:56:09,147 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 271 [2019-10-02 13:56:09,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:56:09,867 INFO L225 Difference]: With dead ends: 351641 [2019-10-02 13:56:09,867 INFO L226 Difference]: Without dead ends: 145731 [2019-10-02 13:56:10,304 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:56:10,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145731 states. [2019-10-02 13:56:24,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145731 to 145339. [2019-10-02 13:56:24,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145339 states. [2019-10-02 13:56:25,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145339 states to 145339 states and 265391 transitions. [2019-10-02 13:56:25,326 INFO L78 Accepts]: Start accepts. Automaton has 145339 states and 265391 transitions. Word has length 271 [2019-10-02 13:56:25,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:56:25,326 INFO L475 AbstractCegarLoop]: Abstraction has 145339 states and 265391 transitions. [2019-10-02 13:56:25,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 13:56:25,327 INFO L276 IsEmpty]: Start isEmpty. Operand 145339 states and 265391 transitions. [2019-10-02 13:56:25,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-10-02 13:56:25,631 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:56:25,632 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-10-02 13:56:25,632 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:56:25,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:56:25,632 INFO L82 PathProgramCache]: Analyzing trace with hash -221766839, now seen corresponding path program 1 times [2019-10-02 13:56:25,633 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:56:25,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:56:25,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:56:25,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:56:25,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:56:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:56:27,543 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 13:56:27,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:56:27,543 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:56:27,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:56:28,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:56:28,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 3363 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:56:28,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:56:28,398 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 13:56:28,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:56:28,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [49] total 53 [2019-10-02 13:56:28,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-02 13:56:28,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-02 13:56:28,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=2640, Unknown=0, NotChecked=0, Total=2756 [2019-10-02 13:56:28,411 INFO L87 Difference]: Start difference. First operand 145339 states and 265391 transitions. Second operand 53 states. [2019-10-02 13:57:20,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:57:20,471 INFO L93 Difference]: Finished difference Result 513886 states and 948698 transitions. [2019-10-02 13:57:20,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2019-10-02 13:57:20,471 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 248 [2019-10-02 13:57:20,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:57:21,915 INFO L225 Difference]: With dead ends: 513886 [2019-10-02 13:57:21,915 INFO L226 Difference]: Without dead ends: 368255 [2019-10-02 13:57:22,322 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 266 SyntacticMatches, 1 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9313 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=1693, Invalid=31979, Unknown=0, NotChecked=0, Total=33672 [2019-10-02 13:57:23,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368255 states. [2019-10-02 13:57:55,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368255 to 356160. [2019-10-02 13:57:55,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356160 states. [2019-10-02 13:57:57,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356160 states to 356160 states and 639053 transitions. [2019-10-02 13:57:57,950 INFO L78 Accepts]: Start accepts. Automaton has 356160 states and 639053 transitions. Word has length 248 [2019-10-02 13:57:57,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:57:57,951 INFO L475 AbstractCegarLoop]: Abstraction has 356160 states and 639053 transitions. [2019-10-02 13:57:57,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-02 13:57:57,951 INFO L276 IsEmpty]: Start isEmpty. Operand 356160 states and 639053 transitions. [2019-10-02 13:57:58,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-10-02 13:57:58,645 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:57:58,645 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:57:58,645 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:57:58,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:57:58,646 INFO L82 PathProgramCache]: Analyzing trace with hash -943076235, now seen corresponding path program 1 times [2019-10-02 13:57:58,646 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:57:58,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:57:58,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:57:58,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:57:58,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:57:58,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:57:58,806 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 13:57:58,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:57:58,807 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:57:58,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:57:59,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:57:59,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 3231 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:57:59,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:57:59,579 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 13:57:59,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:57:59,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2019-10-02 13:57:59,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 13:57:59,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 13:57:59,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:57:59,605 INFO L87 Difference]: Start difference. First operand 356160 states and 639053 transitions. Second operand 13 states. [2019-10-02 13:58:40,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:58:40,876 INFO L93 Difference]: Finished difference Result 774902 states and 1382889 transitions. [2019-10-02 13:58:40,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 13:58:40,876 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 242 [2019-10-02 13:58:40,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:58:42,922 INFO L225 Difference]: With dead ends: 774902 [2019-10-02 13:58:42,923 INFO L226 Difference]: Without dead ends: 418705 [2019-10-02 13:58:43,638 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2019-10-02 13:58:43,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418705 states. [2019-10-02 13:59:20,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418705 to 413556. [2019-10-02 13:59:20,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413556 states. [2019-10-02 13:59:22,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413556 states to 413556 states and 717056 transitions. [2019-10-02 13:59:22,936 INFO L78 Accepts]: Start accepts. Automaton has 413556 states and 717056 transitions. Word has length 242 [2019-10-02 13:59:22,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:59:22,936 INFO L475 AbstractCegarLoop]: Abstraction has 413556 states and 717056 transitions. [2019-10-02 13:59:22,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 13:59:22,936 INFO L276 IsEmpty]: Start isEmpty. Operand 413556 states and 717056 transitions. [2019-10-02 13:59:23,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-10-02 13:59:23,638 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:59:23,638 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:59:23,638 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:59:23,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:59:23,639 INFO L82 PathProgramCache]: Analyzing trace with hash 895875822, now seen corresponding path program 1 times [2019-10-02 13:59:23,639 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:59:23,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:59:23,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:59:23,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:59:23,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:59:23,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:59:23,777 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-10-02 13:59:23,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:59:23,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:59:23,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:59:23,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:59:23,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:59:23,779 INFO L87 Difference]: Start difference. First operand 413556 states and 717056 transitions. Second operand 3 states. [2019-10-02 14:00:05,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:00:05,973 INFO L93 Difference]: Finished difference Result 897803 states and 1626513 transitions. [2019-10-02 14:00:05,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:00:05,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 266 [2019-10-02 14:00:05,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:00:07,998 INFO L225 Difference]: With dead ends: 897803 [2019-10-02 14:00:07,998 INFO L226 Difference]: Without dead ends: 484364 [2019-10-02 14:00:09,437 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 14:00:09,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484364 states. [2019-10-02 14:00:53,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484364 to 484340. [2019-10-02 14:00:53,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484340 states. [2019-10-02 14:00:56,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484340 states to 484340 states and 907776 transitions. [2019-10-02 14:00:56,175 INFO L78 Accepts]: Start accepts. Automaton has 484340 states and 907776 transitions. Word has length 266 [2019-10-02 14:00:56,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:00:56,176 INFO L475 AbstractCegarLoop]: Abstraction has 484340 states and 907776 transitions. [2019-10-02 14:00:56,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:00:56,176 INFO L276 IsEmpty]: Start isEmpty. Operand 484340 states and 907776 transitions. [2019-10-02 14:00:59,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-10-02 14:00:59,030 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:00:59,031 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:00:59,031 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:00:59,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:00:59,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1290234369, now seen corresponding path program 1 times [2019-10-02 14:00:59,031 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:00:59,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:00:59,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:59,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:00:59,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:00:59,177 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-02 14:00:59,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:00:59,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 14:00:59,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:00:59,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:00:59,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:00:59,178 INFO L87 Difference]: Start difference. First operand 484340 states and 907776 transitions. Second operand 6 states. [2019-10-02 14:01:45,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:01:45,556 INFO L93 Difference]: Finished difference Result 968587 states and 1815441 transitions. [2019-10-02 14:01:45,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 14:01:45,556 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 273 [2019-10-02 14:01:45,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:01:48,978 INFO L225 Difference]: With dead ends: 968587 [2019-10-02 14:01:48,978 INFO L226 Difference]: Without dead ends: 484364 [2019-10-02 14:01:49,989 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:01:50,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484364 states. [2019-10-02 14:02:36,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484364 to 484340. [2019-10-02 14:02:36,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484340 states. [2019-10-02 14:02:39,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484340 states to 484340 states and 905984 transitions. [2019-10-02 14:02:39,591 INFO L78 Accepts]: Start accepts. Automaton has 484340 states and 905984 transitions. Word has length 273 [2019-10-02 14:02:39,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:02:39,592 INFO L475 AbstractCegarLoop]: Abstraction has 484340 states and 905984 transitions. [2019-10-02 14:02:39,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:02:39,592 INFO L276 IsEmpty]: Start isEmpty. Operand 484340 states and 905984 transitions. [2019-10-02 14:02:42,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-10-02 14:02:42,466 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:02:42,466 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:02:42,466 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:02:42,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:02:42,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1478968928, now seen corresponding path program 1 times [2019-10-02 14:02:42,467 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:02:42,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:02:42,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:02:42,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:02:42,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:02:42,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:02:44,003 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 14:02:44,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:02:44,003 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:02:44,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:02:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:02:44,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 3429 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 14:02:44,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:02:45,026 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked.