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_spec3_product29.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 13:20:28,938 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 13:20:28,940 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 13:20:28,952 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 13:20:28,952 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 13:20:28,954 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 13:20:28,955 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 13:20:28,957 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 13:20:28,959 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 13:20:28,960 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 13:20:28,961 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 13:20:28,962 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 13:20:28,963 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 13:20:28,964 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 13:20:28,965 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 13:20:28,966 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 13:20:28,967 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 13:20:28,968 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 13:20:28,970 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 13:20:28,972 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 13:20:28,974 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 13:20:28,975 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 13:20:28,976 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 13:20:28,977 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 13:20:28,979 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 13:20:28,980 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 13:20:28,980 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 13:20:28,981 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 13:20:28,981 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 13:20:28,982 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 13:20:28,983 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 13:20:28,984 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 13:20:28,984 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 13:20:28,985 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 13:20:28,986 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 13:20:28,987 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 13:20:28,987 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 13:20:28,988 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 13:20:28,988 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 13:20:28,989 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 13:20:28,989 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 13:20:28,990 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:20:29,018 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 13:20:29,019 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 13:20:29,020 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 13:20:29,020 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 13:20:29,020 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 13:20:29,021 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 13:20:29,021 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 13:20:29,021 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 13:20:29,021 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 13:20:29,021 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 13:20:29,022 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 13:20:29,022 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 13:20:29,022 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 13:20:29,022 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 13:20:29,022 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 13:20:29,023 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 13:20:29,023 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 13:20:29,023 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 13:20:29,023 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 13:20:29,023 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 13:20:29,024 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 13:20:29,024 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 13:20:29,024 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 13:20:29,024 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 13:20:29,024 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 13:20:29,025 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 13:20:29,025 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 13:20:29,025 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 13:20:29,025 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 13:20:29,054 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 13:20:29,067 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 13:20:29,071 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 13:20:29,072 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 13:20:29,073 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 13:20:29,074 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec3_product29.cil.c [2019-10-02 13:20:29,135 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ce15d2e0/e6cb4af61e944562bb863d63c4ea8420/FLAGbe2123785 [2019-10-02 13:20:29,719 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 13:20:29,720 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec3_product29.cil.c [2019-10-02 13:20:29,745 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ce15d2e0/e6cb4af61e944562bb863d63c4ea8420/FLAGbe2123785 [2019-10-02 13:20:29,970 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ce15d2e0/e6cb4af61e944562bb863d63c4ea8420 [2019-10-02 13:20:29,981 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 13:20:29,983 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 13:20:29,984 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 13:20:29,984 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 13:20:29,987 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 13:20:29,988 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:20:29" (1/1) ... [2019-10-02 13:20:29,990 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c9bb3bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:20:29, skipping insertion in model container [2019-10-02 13:20:29,991 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:20:29" (1/1) ... [2019-10-02 13:20:29,996 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 13:20:30,078 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 13:20:30,920 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:20:30,950 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 13:20:31,077 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:20:31,204 INFO L192 MainTranslator]: Completed translation [2019-10-02 13:20:31,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:20:31 WrapperNode [2019-10-02 13:20:31,205 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 13:20:31,207 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 13:20:31,207 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 13:20:31,207 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 13:20:31,223 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:20:31" (1/1) ... [2019-10-02 13:20:31,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:20:31" (1/1) ... [2019-10-02 13:20:31,258 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:20:31" (1/1) ... [2019-10-02 13:20:31,259 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:20:31" (1/1) ... [2019-10-02 13:20:31,337 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:20:31" (1/1) ... [2019-10-02 13:20:31,373 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:20:31" (1/1) ... [2019-10-02 13:20:31,401 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:20:31" (1/1) ... [2019-10-02 13:20:31,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 13:20:31,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 13:20:31,426 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 13:20:31,426 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 13:20:31,428 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:20:31" (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:20:31,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 13:20:31,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 13:20:31,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 13:20:31,517 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 13:20:31,518 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 13:20:31,518 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 13:20:31,518 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 13:20:31,518 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 13:20:31,520 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 13:20:31,520 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 13:20:31,520 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 13:20:31,521 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 13:20:31,521 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 13:20:31,522 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 13:20:31,523 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 13:20:31,523 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 13:20:31,526 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 13:20:31,526 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 13:20:31,527 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 13:20:31,527 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 13:20:31,527 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 13:20:31,527 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 13:20:31,527 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 13:20:31,528 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 13:20:31,528 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 13:20:31,528 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 13:20:31,528 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 13:20:31,528 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 13:20:31,528 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 13:20:31,528 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 13:20:31,529 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 13:20:31,529 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 13:20:31,529 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 13:20:31,529 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 13:20:31,530 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 13:20:31,530 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 13:20:31,530 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 13:20:31,530 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 13:20:31,530 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 13:20:31,530 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 13:20:31,531 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 13:20:31,531 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 13:20:31,531 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 13:20:31,531 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 13:20:31,531 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 13:20:31,531 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 13:20:31,532 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 13:20:31,532 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 13:20:31,532 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 13:20:31,532 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 13:20:31,533 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 13:20:31,533 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 13:20:31,533 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 13:20:31,533 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 13:20:31,533 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 13:20:31,533 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 13:20:31,533 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 13:20:31,534 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-02 13:20:31,534 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 13:20:31,534 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 13:20:31,534 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 13:20:31,534 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 13:20:31,534 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 13:20:31,534 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 13:20:31,535 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 13:20:31,535 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 13:20:31,535 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 13:20:31,535 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 13:20:31,536 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 13:20:31,536 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 13:20:31,536 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 13:20:31,537 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 13:20:31,537 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 13:20:31,537 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 13:20:31,538 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 13:20:31,538 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 13:20:31,538 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 13:20:31,538 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 13:20:31,539 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 13:20:31,539 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 13:20:31,539 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 13:20:31,539 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 13:20:31,540 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 13:20:31,540 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 13:20:31,540 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 13:20:31,540 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 13:20:31,540 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AddressBook [2019-10-02 13:20:31,541 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Sign [2019-10-02 13:20:31,542 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 13:20:31,542 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 13:20:31,543 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 13:20:31,543 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 13:20:31,543 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 13:20:31,543 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 13:20:31,543 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 13:20:31,543 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 13:20:31,544 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2019-10-02 13:20:31,544 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AddressBook [2019-10-02 13:20:31,544 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 13:20:31,544 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 13:20:31,544 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-10-02 13:20:31,544 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-10-02 13:20:31,544 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 13:20:31,545 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 13:20:31,545 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 13:20:31,545 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 13:20:31,545 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 13:20:31,545 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 13:20:31,545 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 13:20:31,546 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 13:20:31,546 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 13:20:31,546 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-02 13:20:31,546 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-02 13:20:31,546 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-02 13:20:31,546 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__SignVerify_spec__1 [2019-10-02 13:20:31,547 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__SignVerify_spec__2 [2019-10-02 13:20:31,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 13:20:31,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 13:20:31,548 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 13:20:31,548 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 13:20:31,548 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 13:20:31,548 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 13:20:31,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 13:20:31,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 13:20:31,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 13:20:31,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 13:20:31,551 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 13:20:31,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 13:20:31,551 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 13:20:31,551 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 13:20:31,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 13:20:31,552 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 13:20:31,552 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 13:20:31,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 13:20:31,553 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 13:20:31,553 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 13:20:31,553 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 13:20:31,553 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 13:20:31,553 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 13:20:31,554 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 13:20:31,558 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 13:20:31,559 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 13:20:31,559 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 13:20:31,560 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 13:20:31,566 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 13:20:31,567 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 13:20:31,567 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 13:20:31,567 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 13:20:31,567 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 13:20:31,567 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 13:20:31,567 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 13:20:31,567 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 13:20:31,568 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 13:20:31,568 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 13:20:31,568 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 13:20:31,568 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 13:20:31,569 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 13:20:31,569 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 13:20:31,569 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 13:20:31,570 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 13:20:31,570 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 13:20:31,570 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 13:20:31,570 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 13:20:31,570 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 13:20:31,570 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 13:20:31,570 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 13:20:31,570 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 13:20:31,571 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 13:20:31,571 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 13:20:31,571 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 13:20:31,571 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 13:20:31,571 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 13:20:31,571 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 13:20:31,571 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 13:20:31,572 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 13:20:31,572 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 13:20:31,572 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 13:20:31,572 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 13:20:31,572 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 13:20:31,572 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 13:20:31,572 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 13:20:31,572 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 13:20:31,573 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 13:20:31,573 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 13:20:31,573 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 13:20:31,573 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 13:20:31,573 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 13:20:31,573 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 13:20:31,573 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 13:20:31,574 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 13:20:31,574 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 13:20:31,574 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 13:20:31,574 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-02 13:20:31,574 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 13:20:31,574 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 13:20:31,574 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 13:20:31,574 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 13:20:31,575 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 13:20:31,575 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 13:20:31,575 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 13:20:31,575 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 13:20:31,575 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 13:20:31,575 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 13:20:31,576 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 13:20:31,576 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 13:20:31,576 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 13:20:31,576 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 13:20:31,576 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 13:20:31,576 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 13:20:31,577 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 13:20:31,577 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 13:20:31,577 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 13:20:31,577 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 13:20:31,577 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 13:20:31,577 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 13:20:31,578 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 13:20:31,578 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 13:20:31,578 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 13:20:31,578 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 13:20:31,578 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 13:20:31,578 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 13:20:31,578 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 13:20:31,579 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 13:20:31,579 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 13:20:31,579 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AddressBook [2019-10-02 13:20:31,579 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Sign [2019-10-02 13:20:31,579 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 13:20:31,579 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 13:20:31,580 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 13:20:31,580 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 13:20:31,580 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 13:20:31,580 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 13:20:31,580 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 13:20:31,580 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 13:20:31,581 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-02 13:20:31,581 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-02 13:20:31,581 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-02 13:20:31,581 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__SignVerify_spec__1 [2019-10-02 13:20:31,581 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 13:20:31,581 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2019-10-02 13:20:31,581 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AddressBook [2019-10-02 13:20:31,582 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-10-02 13:20:31,582 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-10-02 13:20:31,582 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__SignVerify_spec__2 [2019-10-02 13:20:31,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 13:20:31,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 13:20:31,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 13:20:33,966 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 13:20:33,967 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 13:20:33,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:20:33 BoogieIcfgContainer [2019-10-02 13:20:33,969 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 13:20:33,971 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 13:20:33,971 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 13:20:33,975 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 13:20:33,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:20:29" (1/3) ... [2019-10-02 13:20:33,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72bb1f74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:20:33, skipping insertion in model container [2019-10-02 13:20:33,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:20:31" (2/3) ... [2019-10-02 13:20:33,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72bb1f74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:20:33, skipping insertion in model container [2019-10-02 13:20:33,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:20:33" (3/3) ... [2019-10-02 13:20:33,980 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec3_product29.cil.c [2019-10-02 13:20:33,993 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 13:20:34,008 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 13:20:34,025 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 13:20:34,073 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 13:20:34,074 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 13:20:34,074 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 13:20:34,075 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 13:20:34,079 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 13:20:34,079 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 13:20:34,079 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 13:20:34,079 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 13:20:34,079 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 13:20:34,126 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states. [2019-10-02 13:20:34,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-02 13:20:34,166 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:20:34,168 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] [2019-10-02 13:20:34,171 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:20:34,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:20:34,178 INFO L82 PathProgramCache]: Analyzing trace with hash 940627505, now seen corresponding path program 1 times [2019-10-02 13:20:34,180 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:20:34,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:20:34,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:20:34,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:20:34,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:20:34,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:20:34,958 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:20:34,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:20:34,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 13:20:34,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 13:20:34,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 13:20:34,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 13:20:34,983 INFO L87 Difference]: Start difference. First operand 614 states. Second operand 2 states. [2019-10-02 13:20:35,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:20:35,072 INFO L93 Difference]: Finished difference Result 869 states and 1190 transitions. [2019-10-02 13:20:35,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 13:20:35,077 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 204 [2019-10-02 13:20:35,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:20:35,120 INFO L225 Difference]: With dead ends: 869 [2019-10-02 13:20:35,120 INFO L226 Difference]: Without dead ends: 557 [2019-10-02 13:20:35,135 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:20:35,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-10-02 13:20:35,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2019-10-02 13:20:35,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2019-10-02 13:20:35,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 764 transitions. [2019-10-02 13:20:35,267 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 764 transitions. Word has length 204 [2019-10-02 13:20:35,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:20:35,270 INFO L475 AbstractCegarLoop]: Abstraction has 557 states and 764 transitions. [2019-10-02 13:20:35,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 13:20:35,270 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 764 transitions. [2019-10-02 13:20:35,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-10-02 13:20:35,280 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:20:35,280 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] [2019-10-02 13:20:35,280 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:20:35,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:20:35,281 INFO L82 PathProgramCache]: Analyzing trace with hash 861821971, now seen corresponding path program 1 times [2019-10-02 13:20:35,281 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:20:35,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:20:35,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:20:35,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:20:35,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:20:35,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:20:35,539 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:20:35,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:20:35,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:20:35,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:20:35,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:20:35,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:20:35,592 INFO L87 Difference]: Start difference. First operand 557 states and 764 transitions. Second operand 3 states. [2019-10-02 13:20:35,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:20:35,706 INFO L93 Difference]: Finished difference Result 852 states and 1150 transitions. [2019-10-02 13:20:35,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:20:35,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-10-02 13:20:35,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:20:35,718 INFO L225 Difference]: With dead ends: 852 [2019-10-02 13:20:35,718 INFO L226 Difference]: Without dead ends: 560 [2019-10-02 13:20:35,722 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:20:35,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-10-02 13:20:35,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 559. [2019-10-02 13:20:35,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-10-02 13:20:35,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 766 transitions. [2019-10-02 13:20:35,767 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 766 transitions. Word has length 205 [2019-10-02 13:20:35,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:20:35,770 INFO L475 AbstractCegarLoop]: Abstraction has 559 states and 766 transitions. [2019-10-02 13:20:35,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:20:35,770 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 766 transitions. [2019-10-02 13:20:35,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-10-02 13:20:35,777 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:20:35,777 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-10-02 13:20:35,777 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:20:35,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:20:35,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1773355193, now seen corresponding path program 1 times [2019-10-02 13:20:35,778 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:20:35,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:20:35,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:20:35,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:20:35,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:20:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:20:36,054 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:20:36,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:20:36,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:20:36,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:20:36,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:20:36,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:20:36,063 INFO L87 Difference]: Start difference. First operand 559 states and 766 transitions. Second operand 3 states. [2019-10-02 13:20:36,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:20:36,116 INFO L93 Difference]: Finished difference Result 1094 states and 1530 transitions. [2019-10-02 13:20:36,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:20:36,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2019-10-02 13:20:36,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:20:36,124 INFO L225 Difference]: With dead ends: 1094 [2019-10-02 13:20:36,124 INFO L226 Difference]: Without dead ends: 600 [2019-10-02 13:20:36,127 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:20:36,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-02 13:20:36,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 599. [2019-10-02 13:20:36,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-10-02 13:20:36,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 835 transitions. [2019-10-02 13:20:36,166 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 835 transitions. Word has length 211 [2019-10-02 13:20:36,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:20:36,170 INFO L475 AbstractCegarLoop]: Abstraction has 599 states and 835 transitions. [2019-10-02 13:20:36,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:20:36,170 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 835 transitions. [2019-10-02 13:20:36,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-02 13:20:36,177 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:20:36,177 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-10-02 13:20:36,178 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:20:36,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:20:36,178 INFO L82 PathProgramCache]: Analyzing trace with hash 478766471, now seen corresponding path program 1 times [2019-10-02 13:20:36,178 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:20:36,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:20:36,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:20:36,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:20:36,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:20:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:20:36,869 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:20:36,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:20:36,870 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:20:37,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:20:37,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:20:37,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 2987 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:20:37,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:20:38,040 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 13:20:38,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:20:38,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [19] total 26 [2019-10-02 13:20:38,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 13:20:38,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 13:20:38,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2019-10-02 13:20:38,055 INFO L87 Difference]: Start difference. First operand 599 states and 835 transitions. Second operand 26 states. [2019-10-02 13:20:48,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:20:48,312 INFO L93 Difference]: Finished difference Result 2362 states and 3350 transitions. [2019-10-02 13:20:48,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-02 13:20:48,341 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 212 [2019-10-02 13:20:48,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:20:48,352 INFO L225 Difference]: With dead ends: 2362 [2019-10-02 13:20:48,352 INFO L226 Difference]: Without dead ends: 1799 [2019-10-02 13:20:48,357 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1152 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=496, Invalid=4616, Unknown=0, NotChecked=0, Total=5112 [2019-10-02 13:20:48,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2019-10-02 13:20:48,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1764. [2019-10-02 13:20:48,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1764 states. [2019-10-02 13:20:48,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1764 states to 1764 states and 2478 transitions. [2019-10-02 13:20:48,482 INFO L78 Accepts]: Start accepts. Automaton has 1764 states and 2478 transitions. Word has length 212 [2019-10-02 13:20:48,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:20:48,483 INFO L475 AbstractCegarLoop]: Abstraction has 1764 states and 2478 transitions. [2019-10-02 13:20:48,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 13:20:48,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 2478 transitions. [2019-10-02 13:20:48,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-10-02 13:20:48,491 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:20:48,491 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 13:20:48,491 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:20:48,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:20:48,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1640367835, now seen corresponding path program 1 times [2019-10-02 13:20:48,492 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:20:48,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:20:48,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:20:48,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:20:48,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:20:48,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:20:48,790 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:20:48,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:20:48,790 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:20:48,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:20:49,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:20:49,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 2987 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:20:49,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:20:49,607 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 18 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:20:49,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:20:49,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 18 [2019-10-02 13:20:49,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 13:20:49,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 13:20:49,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:20:49,625 INFO L87 Difference]: Start difference. First operand 1764 states and 2478 transitions. Second operand 18 states. [2019-10-02 13:20:52,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:20:52,510 INFO L93 Difference]: Finished difference Result 3640 states and 5207 transitions. [2019-10-02 13:20:52,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 13:20:52,510 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 214 [2019-10-02 13:20:52,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:20:52,523 INFO L225 Difference]: With dead ends: 3640 [2019-10-02 13:20:52,523 INFO L226 Difference]: Without dead ends: 1911 [2019-10-02 13:20:52,530 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=917, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 13:20:52,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1911 states. [2019-10-02 13:20:52,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1911 to 1911. [2019-10-02 13:20:52,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1911 states. [2019-10-02 13:20:52,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1911 states to 1911 states and 2715 transitions. [2019-10-02 13:20:52,642 INFO L78 Accepts]: Start accepts. Automaton has 1911 states and 2715 transitions. Word has length 214 [2019-10-02 13:20:52,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:20:52,643 INFO L475 AbstractCegarLoop]: Abstraction has 1911 states and 2715 transitions. [2019-10-02 13:20:52,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 13:20:52,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1911 states and 2715 transitions. [2019-10-02 13:20:52,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-10-02 13:20:52,650 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:20:52,650 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:20:52,650 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:20:52,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:20:52,651 INFO L82 PathProgramCache]: Analyzing trace with hash 2670841, now seen corresponding path program 1 times [2019-10-02 13:20:52,651 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:20:52,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:20:52,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:20:52,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:20:52,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:20:52,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:20:53,103 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:20:53,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:20:53,104 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:20:53,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:20:53,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:20:53,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 2990 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:20:53,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:20:53,942 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 13:20:53,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:20:53,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 22 [2019-10-02 13:20:53,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-02 13:20:53,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-02 13:20:53,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2019-10-02 13:20:53,961 INFO L87 Difference]: Start difference. First operand 1911 states and 2715 transitions. Second operand 22 states. [2019-10-02 13:21:01,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:21:01,716 INFO L93 Difference]: Finished difference Result 3888 states and 5615 transitions. [2019-10-02 13:21:01,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-02 13:21:01,716 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 215 [2019-10-02 13:21:01,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:21:01,729 INFO L225 Difference]: With dead ends: 3888 [2019-10-02 13:21:01,729 INFO L226 Difference]: Without dead ends: 2038 [2019-10-02 13:21:01,737 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 912 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=434, Invalid=3726, Unknown=0, NotChecked=0, Total=4160 [2019-10-02 13:21:01,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2038 states. [2019-10-02 13:21:01,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2038 to 1984. [2019-10-02 13:21:01,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1984 states. [2019-10-02 13:21:01,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1984 states to 1984 states and 2833 transitions. [2019-10-02 13:21:01,846 INFO L78 Accepts]: Start accepts. Automaton has 1984 states and 2833 transitions. Word has length 215 [2019-10-02 13:21:01,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:21:01,846 INFO L475 AbstractCegarLoop]: Abstraction has 1984 states and 2833 transitions. [2019-10-02 13:21:01,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-02 13:21:01,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1984 states and 2833 transitions. [2019-10-02 13:21:01,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-10-02 13:21:01,854 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:21:01,855 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 13:21:01,855 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:21:01,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:21:01,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1802038709, now seen corresponding path program 1 times [2019-10-02 13:21:01,856 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:21:01,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:21:01,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:01,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:01,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:01,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:02,183 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:21:02,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:21:02,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-02 13:21:02,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 13:21:02,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 13:21:02,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:21:02,187 INFO L87 Difference]: Start difference. First operand 1984 states and 2833 transitions. Second operand 18 states. [2019-10-02 13:21:02,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:21:02,702 INFO L93 Difference]: Finished difference Result 3360 states and 4759 transitions. [2019-10-02 13:21:02,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 13:21:02,702 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 216 [2019-10-02 13:21:02,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:21:02,713 INFO L225 Difference]: With dead ends: 3360 [2019-10-02 13:21:02,714 INFO L226 Difference]: Without dead ends: 2033 [2019-10-02 13:21:02,720 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:21:02,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states. [2019-10-02 13:21:02,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 2031. [2019-10-02 13:21:02,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2031 states. [2019-10-02 13:21:02,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2031 states to 2031 states and 2875 transitions. [2019-10-02 13:21:02,815 INFO L78 Accepts]: Start accepts. Automaton has 2031 states and 2875 transitions. Word has length 216 [2019-10-02 13:21:02,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:21:02,816 INFO L475 AbstractCegarLoop]: Abstraction has 2031 states and 2875 transitions. [2019-10-02 13:21:02,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 13:21:02,816 INFO L276 IsEmpty]: Start isEmpty. Operand 2031 states and 2875 transitions. [2019-10-02 13:21:02,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-10-02 13:21:02,823 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:21:02,823 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 13:21:02,823 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:21:02,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:21:02,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1111390650, now seen corresponding path program 1 times [2019-10-02 13:21:02,824 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:21:02,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:21:02,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:02,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:02,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:02,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:02,985 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:21:02,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:21:02,986 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:21:03,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:03,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:03,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 2991 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:21:03,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:21:03,708 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 13:21:03,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:21:03,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2019-10-02 13:21:03,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 13:21:03,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 13:21:03,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-02 13:21:03,726 INFO L87 Difference]: Start difference. First operand 2031 states and 2875 transitions. Second operand 12 states. [2019-10-02 13:21:08,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:21:08,450 INFO L93 Difference]: Finished difference Result 6341 states and 9113 transitions. [2019-10-02 13:21:08,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 13:21:08,450 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 216 [2019-10-02 13:21:08,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:21:08,480 INFO L225 Difference]: With dead ends: 6341 [2019-10-02 13:21:08,480 INFO L226 Difference]: Without dead ends: 4385 [2019-10-02 13:21:08,490 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2019-10-02 13:21:08,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4385 states. [2019-10-02 13:21:08,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4385 to 4369. [2019-10-02 13:21:08,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4369 states. [2019-10-02 13:21:08,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4369 states to 4369 states and 6244 transitions. [2019-10-02 13:21:08,776 INFO L78 Accepts]: Start accepts. Automaton has 4369 states and 6244 transitions. Word has length 216 [2019-10-02 13:21:08,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:21:08,776 INFO L475 AbstractCegarLoop]: Abstraction has 4369 states and 6244 transitions. [2019-10-02 13:21:08,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 13:21:08,777 INFO L276 IsEmpty]: Start isEmpty. Operand 4369 states and 6244 transitions. [2019-10-02 13:21:08,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-10-02 13:21:08,789 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:21:08,790 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:21:08,790 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:21:08,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:21:08,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1423262705, now seen corresponding path program 1 times [2019-10-02 13:21:08,791 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:21:08,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:21:08,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:08,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:08,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:08,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:09,045 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 13:21:09,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:21:09,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 13:21:09,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 13:21:09,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 13:21:09,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-10-02 13:21:09,046 INFO L87 Difference]: Start difference. First operand 4369 states and 6244 transitions. Second operand 12 states. [2019-10-02 13:21:21,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:21:21,292 INFO L93 Difference]: Finished difference Result 32915 states and 48667 transitions. [2019-10-02 13:21:21,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-02 13:21:21,293 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 217 [2019-10-02 13:21:21,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:21:21,467 INFO L225 Difference]: With dead ends: 32915 [2019-10-02 13:21:21,467 INFO L226 Difference]: Without dead ends: 29517 [2019-10-02 13:21:21,500 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=377, Invalid=1515, Unknown=0, NotChecked=0, Total=1892 [2019-10-02 13:21:21,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29517 states. [2019-10-02 13:21:23,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29517 to 29261. [2019-10-02 13:21:23,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29261 states. [2019-10-02 13:21:23,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29261 states to 29261 states and 42887 transitions. [2019-10-02 13:21:23,726 INFO L78 Accepts]: Start accepts. Automaton has 29261 states and 42887 transitions. Word has length 217 [2019-10-02 13:21:23,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:21:23,727 INFO L475 AbstractCegarLoop]: Abstraction has 29261 states and 42887 transitions. [2019-10-02 13:21:23,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 13:21:23,727 INFO L276 IsEmpty]: Start isEmpty. Operand 29261 states and 42887 transitions. [2019-10-02 13:21:23,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-10-02 13:21:23,744 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:21:23,745 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:21:23,745 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:21:23,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:21:23,746 INFO L82 PathProgramCache]: Analyzing trace with hash -271050600, now seen corresponding path program 1 times [2019-10-02 13:21:23,746 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:21:23,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:21:23,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:23,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:23,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:23,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:24,091 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 13:21:24,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:21:24,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-10-02 13:21:24,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 13:21:24,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 13:21:24,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-10-02 13:21:24,093 INFO L87 Difference]: Start difference. First operand 29261 states and 42887 transitions. Second operand 20 states. [2019-10-02 13:21:25,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:21:25,712 INFO L93 Difference]: Finished difference Result 52719 states and 76863 transitions. [2019-10-02 13:21:25,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 13:21:25,713 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 218 [2019-10-02 13:21:25,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:21:25,869 INFO L225 Difference]: With dead ends: 52719 [2019-10-02 13:21:25,870 INFO L226 Difference]: Without dead ends: 24953 [2019-10-02 13:21:25,990 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2019-10-02 13:21:26,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24953 states. [2019-10-02 13:21:29,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24953 to 24787. [2019-10-02 13:21:29,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24787 states. [2019-10-02 13:21:29,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24787 states to 24787 states and 35398 transitions. [2019-10-02 13:21:29,155 INFO L78 Accepts]: Start accepts. Automaton has 24787 states and 35398 transitions. Word has length 218 [2019-10-02 13:21:29,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:21:29,156 INFO L475 AbstractCegarLoop]: Abstraction has 24787 states and 35398 transitions. [2019-10-02 13:21:29,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 13:21:29,157 INFO L276 IsEmpty]: Start isEmpty. Operand 24787 states and 35398 transitions. [2019-10-02 13:21:29,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-10-02 13:21:29,173 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:21:29,174 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:21:29,174 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:21:29,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:21:29,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1450319214, now seen corresponding path program 1 times [2019-10-02 13:21:29,175 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:21:29,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:21:29,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:29,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:29,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:29,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:29,518 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 13:21:29,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:21:29,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:21:29,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:21:29,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:21:29,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:21:29,521 INFO L87 Difference]: Start difference. First operand 24787 states and 35398 transitions. Second operand 8 states. [2019-10-02 13:21:32,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:21:32,302 INFO L93 Difference]: Finished difference Result 72923 states and 105678 transitions. [2019-10-02 13:21:32,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 13:21:32,303 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 227 [2019-10-02 13:21:32,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:21:32,553 INFO L225 Difference]: With dead ends: 72923 [2019-10-02 13:21:32,554 INFO L226 Difference]: Without dead ends: 50283 [2019-10-02 13:21:32,626 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:21:32,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50283 states. [2019-10-02 13:21:34,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50283 to 49217. [2019-10-02 13:21:34,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49217 states. [2019-10-02 13:21:34,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49217 states to 49217 states and 70187 transitions. [2019-10-02 13:21:34,890 INFO L78 Accepts]: Start accepts. Automaton has 49217 states and 70187 transitions. Word has length 227 [2019-10-02 13:21:34,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:21:34,891 INFO L475 AbstractCegarLoop]: Abstraction has 49217 states and 70187 transitions. [2019-10-02 13:21:34,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:21:34,891 INFO L276 IsEmpty]: Start isEmpty. Operand 49217 states and 70187 transitions. [2019-10-02 13:21:34,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-02 13:21:34,909 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:21:34,910 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:21:34,910 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:21:34,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:21:34,911 INFO L82 PathProgramCache]: Analyzing trace with hash -165414372, now seen corresponding path program 1 times [2019-10-02 13:21:34,911 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:21:34,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:21:34,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:34,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:34,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:34,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:35,196 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-02 13:21:35,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:21:35,197 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:21:35,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:35,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:35,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 3036 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:21:35,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:21:35,940 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 13:21:35,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:21:35,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 20 [2019-10-02 13:21:35,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 13:21:35,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 13:21:35,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2019-10-02 13:21:35,949 INFO L87 Difference]: Start difference. First operand 49217 states and 70187 transitions. Second operand 20 states. [2019-10-02 13:21:45,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:21:45,002 INFO L93 Difference]: Finished difference Result 99738 states and 145214 transitions. [2019-10-02 13:21:45,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-02 13:21:45,002 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 228 [2019-10-02 13:21:45,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:21:45,232 INFO L225 Difference]: With dead ends: 99738 [2019-10-02 13:21:45,232 INFO L226 Difference]: Without dead ends: 50601 [2019-10-02 13:21:45,343 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 907 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=423, Invalid=3483, Unknown=0, NotChecked=0, Total=3906 [2019-10-02 13:21:45,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50601 states. [2019-10-02 13:21:46,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50601 to 49217. [2019-10-02 13:21:46,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49217 states. [2019-10-02 13:21:47,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49217 states to 49217 states and 70186 transitions. [2019-10-02 13:21:47,034 INFO L78 Accepts]: Start accepts. Automaton has 49217 states and 70186 transitions. Word has length 228 [2019-10-02 13:21:47,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:21:47,034 INFO L475 AbstractCegarLoop]: Abstraction has 49217 states and 70186 transitions. [2019-10-02 13:21:47,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 13:21:47,034 INFO L276 IsEmpty]: Start isEmpty. Operand 49217 states and 70186 transitions. [2019-10-02 13:21:47,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-10-02 13:21:47,053 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:21:47,054 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 13:21:47,054 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:21:47,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:21:47,054 INFO L82 PathProgramCache]: Analyzing trace with hash 998380287, now seen corresponding path program 1 times [2019-10-02 13:21:47,054 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:21:47,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:21:47,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:47,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:47,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:47,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:47,444 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:21:47,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:21:47,444 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:21:47,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:48,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 3036 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:21:48,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:21:48,595 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 13:21:48,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:21:48,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [25] total 30 [2019-10-02 13:21:48,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-02 13:21:48,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-02 13:21:48,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=802, Unknown=0, NotChecked=0, Total=870 [2019-10-02 13:21:48,615 INFO L87 Difference]: Start difference. First operand 49217 states and 70186 transitions. Second operand 30 states. [2019-10-02 13:22:00,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:22:00,271 INFO L93 Difference]: Finished difference Result 102350 states and 147997 transitions. [2019-10-02 13:22:00,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-10-02 13:22:00,271 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 229 [2019-10-02 13:22:00,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:22:00,477 INFO L225 Difference]: With dead ends: 102350 [2019-10-02 13:22:00,477 INFO L226 Difference]: Without dead ends: 53213 [2019-10-02 13:22:00,572 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1564 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=610, Invalid=6362, Unknown=0, NotChecked=0, Total=6972 [2019-10-02 13:22:00,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53213 states. [2019-10-02 13:22:04,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53213 to 52195. [2019-10-02 13:22:04,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52195 states. [2019-10-02 13:22:04,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52195 states to 52195 states and 74829 transitions. [2019-10-02 13:22:04,802 INFO L78 Accepts]: Start accepts. Automaton has 52195 states and 74829 transitions. Word has length 229 [2019-10-02 13:22:04,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:22:04,803 INFO L475 AbstractCegarLoop]: Abstraction has 52195 states and 74829 transitions. [2019-10-02 13:22:04,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-02 13:22:04,803 INFO L276 IsEmpty]: Start isEmpty. Operand 52195 states and 74829 transitions. [2019-10-02 13:22:04,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-02 13:22:04,824 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:04,824 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] [2019-10-02 13:22:04,825 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:04,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:04,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1254371214, now seen corresponding path program 1 times [2019-10-02 13:22:04,825 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:04,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:04,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:04,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:04,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:04,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:05,046 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 13:22:05,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:22:05,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 13:22:05,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 13:22:05,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 13:22:05,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:22:05,048 INFO L87 Difference]: Start difference. First operand 52195 states and 74829 transitions. Second operand 13 states. [2019-10-02 13:22:07,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:22:07,009 INFO L93 Difference]: Finished difference Result 99537 states and 145366 transitions. [2019-10-02 13:22:07,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 13:22:07,009 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 230 [2019-10-02 13:22:07,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:22:07,277 INFO L225 Difference]: With dead ends: 99537 [2019-10-02 13:22:07,278 INFO L226 Difference]: Without dead ends: 60895 [2019-10-02 13:22:07,372 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:22:07,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60895 states. [2019-10-02 13:22:09,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60895 to 59313. [2019-10-02 13:22:09,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59313 states. [2019-10-02 13:22:09,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59313 states to 59313 states and 86436 transitions. [2019-10-02 13:22:09,540 INFO L78 Accepts]: Start accepts. Automaton has 59313 states and 86436 transitions. Word has length 230 [2019-10-02 13:22:09,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:22:09,541 INFO L475 AbstractCegarLoop]: Abstraction has 59313 states and 86436 transitions. [2019-10-02 13:22:09,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 13:22:09,541 INFO L276 IsEmpty]: Start isEmpty. Operand 59313 states and 86436 transitions. [2019-10-02 13:22:09,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-02 13:22:09,554 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:09,554 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] [2019-10-02 13:22:09,554 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:09,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:09,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1436128018, now seen corresponding path program 2 times [2019-10-02 13:22:09,554 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:09,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:09,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:09,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:09,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:09,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:09,764 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:22:09,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:22:09,765 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:22:09,908 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 13:22:10,410 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 13:22:10,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 13:22:10,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 3037 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-02 13:22:10,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:22:10,609 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:22:10,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:22:10,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2019-10-02 13:22:10,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 13:22:10,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 13:22:10,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:22:10,621 INFO L87 Difference]: Start difference. First operand 59313 states and 86436 transitions. Second operand 18 states. [2019-10-02 13:22:23,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:22:23,560 INFO L93 Difference]: Finished difference Result 167876 states and 245135 transitions. [2019-10-02 13:22:23,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-02 13:22:23,561 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 230 [2019-10-02 13:22:23,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:22:23,912 INFO L225 Difference]: With dead ends: 167876 [2019-10-02 13:22:23,913 INFO L226 Difference]: Without dead ends: 105446 [2019-10-02 13:22:24,049 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=271, Invalid=1709, Unknown=0, NotChecked=0, Total=1980 [2019-10-02 13:22:24,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105446 states. [2019-10-02 13:22:30,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105446 to 101845. [2019-10-02 13:22:30,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101845 states. [2019-10-02 13:22:30,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101845 states to 101845 states and 147167 transitions. [2019-10-02 13:22:30,872 INFO L78 Accepts]: Start accepts. Automaton has 101845 states and 147167 transitions. Word has length 230 [2019-10-02 13:22:30,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:22:30,873 INFO L475 AbstractCegarLoop]: Abstraction has 101845 states and 147167 transitions. [2019-10-02 13:22:30,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 13:22:30,873 INFO L276 IsEmpty]: Start isEmpty. Operand 101845 states and 147167 transitions. [2019-10-02 13:22:30,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-02 13:22:30,899 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:30,899 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 13:22:30,900 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:30,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:30,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1153529559, now seen corresponding path program 1 times [2019-10-02 13:22:30,900 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:30,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:30,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:30,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 13:22:30,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:30,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:31,221 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 13:22:31,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:22:31,222 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:22:31,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:31,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 3036 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 13:22:31,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:22:31,869 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:22:31,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:22:31,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 4] total 20 [2019-10-02 13:22:31,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 13:22:31,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 13:22:31,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2019-10-02 13:22:31,884 INFO L87 Difference]: Start difference. First operand 101845 states and 147167 transitions. Second operand 20 states. [2019-10-02 13:22:44,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:22:44,108 INFO L93 Difference]: Finished difference Result 230031 states and 332384 transitions. [2019-10-02 13:22:44,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-02 13:22:44,109 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 231 [2019-10-02 13:22:44,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:22:44,568 INFO L225 Difference]: With dead ends: 230031 [2019-10-02 13:22:44,568 INFO L226 Difference]: Without dead ends: 129824 [2019-10-02 13:22:44,722 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=275, Invalid=1887, Unknown=0, NotChecked=0, Total=2162 [2019-10-02 13:22:44,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129824 states. [2019-10-02 13:22:48,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129824 to 127771. [2019-10-02 13:22:48,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127771 states. [2019-10-02 13:22:49,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127771 states to 127771 states and 183937 transitions. [2019-10-02 13:22:49,719 INFO L78 Accepts]: Start accepts. Automaton has 127771 states and 183937 transitions. Word has length 231 [2019-10-02 13:22:49,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:22:49,720 INFO L475 AbstractCegarLoop]: Abstraction has 127771 states and 183937 transitions. [2019-10-02 13:22:49,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 13:22:49,720 INFO L276 IsEmpty]: Start isEmpty. Operand 127771 states and 183937 transitions. [2019-10-02 13:22:49,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-10-02 13:22:49,737 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:49,737 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:22:49,737 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:49,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:49,738 INFO L82 PathProgramCache]: Analyzing trace with hash -2122003622, now seen corresponding path program 1 times [2019-10-02 13:22:49,738 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:49,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:49,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:49,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:49,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:49,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:49,878 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:22:49,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:22:49,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:22:49,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:22:49,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:22:49,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:22:49,880 INFO L87 Difference]: Start difference. First operand 127771 states and 183937 transitions. Second operand 3 states. [2019-10-02 13:22:57,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:22:57,074 INFO L93 Difference]: Finished difference Result 255868 states and 368602 transitions. [2019-10-02 13:22:57,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:22:57,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 237 [2019-10-02 13:22:57,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:22:57,513 INFO L225 Difference]: With dead ends: 255868 [2019-10-02 13:22:57,513 INFO L226 Difference]: Without dead ends: 128267 [2019-10-02 13:22:57,717 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:22:57,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128267 states. [2019-10-02 13:23:02,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128267 to 128228. [2019-10-02 13:23:02,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128228 states. [2019-10-02 13:23:02,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128228 states to 128228 states and 184804 transitions. [2019-10-02 13:23:02,612 INFO L78 Accepts]: Start accepts. Automaton has 128228 states and 184804 transitions. Word has length 237 [2019-10-02 13:23:02,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:02,613 INFO L475 AbstractCegarLoop]: Abstraction has 128228 states and 184804 transitions. [2019-10-02 13:23:02,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:23:02,613 INFO L276 IsEmpty]: Start isEmpty. Operand 128228 states and 184804 transitions. [2019-10-02 13:23:02,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-02 13:23:02,631 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:02,631 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, 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] [2019-10-02 13:23:02,631 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:02,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:02,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1488155529, now seen corresponding path program 1 times [2019-10-02 13:23:02,632 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:02,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:02,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:02,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:02,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:02,793 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:23:02,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:23:02,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 13:23:02,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 13:23:02,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 13:23:02,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 13:23:02,795 INFO L87 Difference]: Start difference. First operand 128228 states and 184804 transitions. Second operand 6 states. [2019-10-02 13:23:09,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:09,516 INFO L93 Difference]: Finished difference Result 256192 states and 369244 transitions. [2019-10-02 13:23:09,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 13:23:09,517 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 238 [2019-10-02 13:23:09,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:09,948 INFO L225 Difference]: With dead ends: 256192 [2019-10-02 13:23:09,948 INFO L226 Difference]: Without dead ends: 128234 [2019-10-02 13:23:10,129 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 13:23:10,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128234 states. [2019-10-02 13:23:14,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128234 to 128195. [2019-10-02 13:23:14,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128195 states. [2019-10-02 13:23:15,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128195 states to 128195 states and 184751 transitions. [2019-10-02 13:23:15,811 INFO L78 Accepts]: Start accepts. Automaton has 128195 states and 184751 transitions. Word has length 238 [2019-10-02 13:23:15,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:15,811 INFO L475 AbstractCegarLoop]: Abstraction has 128195 states and 184751 transitions. [2019-10-02 13:23:15,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 13:23:15,812 INFO L276 IsEmpty]: Start isEmpty. Operand 128195 states and 184751 transitions. [2019-10-02 13:23:15,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-02 13:23:15,839 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:15,839 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:23:15,839 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:15,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:15,840 INFO L82 PathProgramCache]: Analyzing trace with hash 6022872, now seen corresponding path program 1 times [2019-10-02 13:23:15,840 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:15,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:15,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:15,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:15,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:15,979 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:23:15,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:23:15,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:23:15,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:23:15,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:23:15,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:23:15,981 INFO L87 Difference]: Start difference. First operand 128195 states and 184751 transitions. Second operand 3 states. [2019-10-02 13:23:22,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:22,713 INFO L93 Difference]: Finished difference Result 257130 states and 371012 transitions. [2019-10-02 13:23:22,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:23:22,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 238 [2019-10-02 13:23:22,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:23,172 INFO L225 Difference]: With dead ends: 257130 [2019-10-02 13:23:23,173 INFO L226 Difference]: Without dead ends: 129117 [2019-10-02 13:23:23,373 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:23:23,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129117 states. [2019-10-02 13:23:27,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129117 to 128940. [2019-10-02 13:23:27,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128940 states. [2019-10-02 13:23:28,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128940 states to 128940 states and 186218 transitions. [2019-10-02 13:23:28,629 INFO L78 Accepts]: Start accepts. Automaton has 128940 states and 186218 transitions. Word has length 238 [2019-10-02 13:23:28,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:28,629 INFO L475 AbstractCegarLoop]: Abstraction has 128940 states and 186218 transitions. [2019-10-02 13:23:28,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:23:28,629 INFO L276 IsEmpty]: Start isEmpty. Operand 128940 states and 186218 transitions. [2019-10-02 13:23:28,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-10-02 13:23:28,649 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:28,649 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:23:28,649 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:28,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:28,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1905351556, now seen corresponding path program 1 times [2019-10-02 13:23:28,650 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:28,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:28,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:28,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:28,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:28,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:28,780 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:23:28,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:23:28,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:23:28,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:23:28,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:23:28,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:23:28,781 INFO L87 Difference]: Start difference. First operand 128940 states and 186218 transitions. Second operand 3 states. [2019-10-02 13:23:35,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:35,413 INFO L93 Difference]: Finished difference Result 259452 states and 375454 transitions. [2019-10-02 13:23:35,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:23:35,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-10-02 13:23:35,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:35,849 INFO L225 Difference]: With dead ends: 259452 [2019-10-02 13:23:35,849 INFO L226 Difference]: Without dead ends: 130710 [2019-10-02 13:23:36,062 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:23:36,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130710 states. [2019-10-02 13:23:40,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130710 to 130606. [2019-10-02 13:23:40,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130606 states. [2019-10-02 13:23:41,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130606 states to 130606 states and 189285 transitions. [2019-10-02 13:23:41,902 INFO L78 Accepts]: Start accepts. Automaton has 130606 states and 189285 transitions. Word has length 239 [2019-10-02 13:23:41,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:41,903 INFO L475 AbstractCegarLoop]: Abstraction has 130606 states and 189285 transitions. [2019-10-02 13:23:41,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:23:41,903 INFO L276 IsEmpty]: Start isEmpty. Operand 130606 states and 189285 transitions. [2019-10-02 13:23:41,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-10-02 13:23:41,927 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:41,927 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:23:41,927 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:41,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:41,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1736762952, now seen corresponding path program 1 times [2019-10-02 13:23:41,927 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:41,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:41,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:41,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:41,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:41,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:42,067 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:23:42,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:23:42,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:23:42,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:23:42,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:23:42,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:23:42,069 INFO L87 Difference]: Start difference. First operand 130606 states and 189285 transitions. Second operand 3 states. [2019-10-02 13:23:46,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:46,168 INFO L93 Difference]: Finished difference Result 264368 states and 384460 transitions. [2019-10-02 13:23:46,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:23:46,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 240 [2019-10-02 13:23:46,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:46,615 INFO L225 Difference]: With dead ends: 264368 [2019-10-02 13:23:46,615 INFO L226 Difference]: Without dead ends: 133984 [2019-10-02 13:23:46,818 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:23:46,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133984 states. [2019-10-02 13:23:56,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133984 to 133978. [2019-10-02 13:23:56,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133978 states. [2019-10-02 13:23:56,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133978 states to 133978 states and 195343 transitions. [2019-10-02 13:23:56,872 INFO L78 Accepts]: Start accepts. Automaton has 133978 states and 195343 transitions. Word has length 240 [2019-10-02 13:23:56,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:56,873 INFO L475 AbstractCegarLoop]: Abstraction has 133978 states and 195343 transitions. [2019-10-02 13:23:56,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:23:56,873 INFO L276 IsEmpty]: Start isEmpty. Operand 133978 states and 195343 transitions. [2019-10-02 13:23:56,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-10-02 13:23:56,909 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:56,910 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:23:56,910 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:56,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:56,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1105428068, now seen corresponding path program 1 times [2019-10-02 13:23:56,910 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:56,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:56,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:56,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:56,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:56,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:57,047 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:23:57,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:23:57,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:23:57,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:23:57,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:23:57,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:23:57,049 INFO L87 Difference]: Start difference. First operand 133978 states and 195343 transitions. Second operand 3 states. [2019-10-02 13:24:05,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:24:05,778 INFO L93 Difference]: Finished difference Result 274544 states and 402790 transitions. [2019-10-02 13:24:05,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:24:05,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2019-10-02 13:24:05,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:24:06,206 INFO L225 Difference]: With dead ends: 274544 [2019-10-02 13:24:06,206 INFO L226 Difference]: Without dead ends: 140804 [2019-10-02 13:24:06,396 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:24:06,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140804 states. [2019-10-02 13:24:11,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140804 to 138656. [2019-10-02 13:24:11,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138656 states. [2019-10-02 13:24:11,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138656 states to 138656 states and 204397 transitions. [2019-10-02 13:24:11,771 INFO L78 Accepts]: Start accepts. Automaton has 138656 states and 204397 transitions. Word has length 241 [2019-10-02 13:24:11,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:24:11,771 INFO L475 AbstractCegarLoop]: Abstraction has 138656 states and 204397 transitions. [2019-10-02 13:24:11,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:24:11,771 INFO L276 IsEmpty]: Start isEmpty. Operand 138656 states and 204397 transitions. [2019-10-02 13:24:11,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-10-02 13:24:11,843 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:24:11,844 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:24:11,844 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:24:11,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:24:11,844 INFO L82 PathProgramCache]: Analyzing trace with hash -386159464, now seen corresponding path program 1 times [2019-10-02 13:24:11,844 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:24:11,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:24:11,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:11,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:24:11,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:11,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:24:11,963 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:24:11,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:24:11,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:24:11,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:24:11,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:24:11,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:24:11,964 INFO L87 Difference]: Start difference. First operand 138656 states and 204397 transitions. Second operand 3 states. [2019-10-02 13:24:17,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:24:17,428 INFO L93 Difference]: Finished difference Result 289744 states and 431152 transitions. [2019-10-02 13:24:17,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:24:17,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 242 [2019-10-02 13:24:17,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:24:17,921 INFO L225 Difference]: With dead ends: 289744 [2019-10-02 13:24:17,921 INFO L226 Difference]: Without dead ends: 151338 [2019-10-02 13:24:18,133 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:24:18,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151338 states. [2019-10-02 13:24:28,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151338 to 151332. [2019-10-02 13:24:28,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151332 states. [2019-10-02 13:24:29,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151332 states to 151332 states and 226671 transitions. [2019-10-02 13:24:29,211 INFO L78 Accepts]: Start accepts. Automaton has 151332 states and 226671 transitions. Word has length 242 [2019-10-02 13:24:29,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:24:29,212 INFO L475 AbstractCegarLoop]: Abstraction has 151332 states and 226671 transitions. [2019-10-02 13:24:29,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:24:29,212 INFO L276 IsEmpty]: Start isEmpty. Operand 151332 states and 226671 transitions. [2019-10-02 13:24:29,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-10-02 13:24:29,328 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:24:29,328 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-10-02 13:24:29,328 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:24:29,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:24:29,328 INFO L82 PathProgramCache]: Analyzing trace with hash 82249146, now seen corresponding path program 1 times [2019-10-02 13:24:29,329 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:24:29,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:24:29,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:29,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:24:29,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:29,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:24:29,552 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-02 13:24:29,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:24:29,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 13:24:29,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 13:24:29,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 13:24:29,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:24:29,554 INFO L87 Difference]: Start difference. First operand 151332 states and 226671 transitions. Second operand 13 states. [2019-10-02 13:24:36,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:24:36,295 INFO L93 Difference]: Finished difference Result 261132 states and 390704 transitions. [2019-10-02 13:24:36,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 13:24:36,296 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 249 [2019-10-02 13:24:36,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:24:36,822 INFO L225 Difference]: With dead ends: 261132 [2019-10-02 13:24:36,823 INFO L226 Difference]: Without dead ends: 170182 [2019-10-02 13:24:36,980 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:24:37,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170182 states. [2019-10-02 13:24:49,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170182 to 167260. [2019-10-02 13:24:49,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167260 states. [2019-10-02 13:24:49,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167260 states to 167260 states and 252915 transitions. [2019-10-02 13:24:49,649 INFO L78 Accepts]: Start accepts. Automaton has 167260 states and 252915 transitions. Word has length 249 [2019-10-02 13:24:49,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:24:49,650 INFO L475 AbstractCegarLoop]: Abstraction has 167260 states and 252915 transitions. [2019-10-02 13:24:49,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 13:24:49,650 INFO L276 IsEmpty]: Start isEmpty. Operand 167260 states and 252915 transitions. [2019-10-02 13:24:49,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-10-02 13:24:49,768 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:24:49,768 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-10-02 13:24:49,768 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:24:49,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:24:49,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1513339055, now seen corresponding path program 1 times [2019-10-02 13:24:49,769 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:24:49,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:24:49,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:49,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:24:49,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:49,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:24:50,221 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-10-02 13:24:50,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:24:50,221 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:24:50,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:24:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:24:51,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 3102 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 13:24:51,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:24:51,734 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 13:24:51,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:24:51,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 5] total 31 [2019-10-02 13:24:51,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-02 13:24:51,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-02 13:24:51,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=863, Unknown=0, NotChecked=0, Total=930 [2019-10-02 13:24:51,754 INFO L87 Difference]: Start difference. First operand 167260 states and 252915 transitions. Second operand 31 states. [2019-10-02 13:26:09,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:26:09,500 INFO L93 Difference]: Finished difference Result 978699 states and 1500305 transitions. [2019-10-02 13:26:09,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-10-02 13:26:09,501 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 249 [2019-10-02 13:26:09,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:26:12,588 INFO L225 Difference]: With dead ends: 978699 [2019-10-02 13:26:12,589 INFO L226 Difference]: Without dead ends: 839241 [2019-10-02 13:26:13,077 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2026 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=877, Invalid=8053, Unknown=0, NotChecked=0, Total=8930 [2019-10-02 13:26:13,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839241 states. [2019-10-02 13:27:20,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839241 to 818968. [2019-10-02 13:27:20,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 818968 states. [2019-10-02 13:27:25,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818968 states to 818968 states and 1249187 transitions. [2019-10-02 13:27:25,143 INFO L78 Accepts]: Start accepts. Automaton has 818968 states and 1249187 transitions. Word has length 249 [2019-10-02 13:27:25,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:27:25,144 INFO L475 AbstractCegarLoop]: Abstraction has 818968 states and 1249187 transitions. [2019-10-02 13:27:25,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-02 13:27:25,144 INFO L276 IsEmpty]: Start isEmpty. Operand 818968 states and 1249187 transitions. [2019-10-02 13:27:25,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-10-02 13:27:25,707 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:27:25,708 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:27:25,708 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:27:25,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:27:25,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1424510337, now seen corresponding path program 1 times [2019-10-02 13:27:25,708 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:27:25,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:27:25,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:27:25,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:27:25,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:27:25,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:27:25,848 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:27:25,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:27:25,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:27:25,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:27:25,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:27:25,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:27:25,849 INFO L87 Difference]: Start difference. First operand 818968 states and 1249187 transitions. Second operand 3 states. [2019-10-02 13:28:32,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:28:32,073 INFO L93 Difference]: Finished difference Result 1732137 states and 2673479 transitions. [2019-10-02 13:28:32,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:28:32,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2019-10-02 13:28:32,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:28:35,642 INFO L225 Difference]: With dead ends: 1732137 [2019-10-02 13:28:35,643 INFO L226 Difference]: Without dead ends: 916140 [2019-10-02 13:28:38,152 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:28:38,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916140 states.