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_spec9_product35.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 14:15:24,152 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 14:15:24,154 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 14:15:24,167 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 14:15:24,168 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 14:15:24,169 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 14:15:24,172 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 14:15:24,175 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 14:15:24,184 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 14:15:24,185 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 14:15:24,187 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 14:15:24,188 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 14:15:24,189 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 14:15:24,190 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 14:15:24,193 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 14:15:24,194 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 14:15:24,195 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 14:15:24,199 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 14:15:24,203 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 14:15:24,205 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 14:15:24,206 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 14:15:24,208 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 14:15:24,210 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 14:15:24,212 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 14:15:24,216 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 14:15:24,216 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 14:15:24,217 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 14:15:24,219 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 14:15:24,221 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 14:15:24,224 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 14:15:24,224 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 14:15:24,225 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 14:15:24,225 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 14:15:24,226 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 14:15:24,231 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 14:15:24,231 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 14:15:24,232 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 14:15:24,232 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 14:15:24,233 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 14:15:24,233 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 14:15:24,236 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 14:15:24,238 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 14:15:24,261 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 14:15:24,262 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 14:15:24,264 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 14:15:24,264 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 14:15:24,265 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 14:15:24,265 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 14:15:24,265 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 14:15:24,265 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 14:15:24,265 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 14:15:24,266 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 14:15:24,267 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 14:15:24,267 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 14:15:24,267 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 14:15:24,268 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 14:15:24,268 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 14:15:24,268 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 14:15:24,268 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 14:15:24,269 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 14:15:24,269 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 14:15:24,269 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 14:15:24,269 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 14:15:24,269 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 14:15:24,270 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 14:15:24,270 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 14:15:24,270 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 14:15:24,270 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 14:15:24,270 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 14:15:24,271 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 14:15:24,271 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 14:15:24,316 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 14:15:24,332 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 14:15:24,336 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 14:15:24,337 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 14:15:24,338 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 14:15:24,338 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec9_product35.cil.c [2019-10-02 14:15:24,417 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e868c10c4/798bb73fb8ed44928c38251428c3b83f/FLAGa907d4b99 [2019-10-02 14:15:25,146 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 14:15:25,147 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec9_product35.cil.c [2019-10-02 14:15:25,175 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e868c10c4/798bb73fb8ed44928c38251428c3b83f/FLAGa907d4b99 [2019-10-02 14:15:25,299 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e868c10c4/798bb73fb8ed44928c38251428c3b83f [2019-10-02 14:15:25,314 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 14:15:25,316 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 14:15:25,318 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 14:15:25,318 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 14:15:25,322 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 14:15:25,323 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:15:25" (1/1) ... [2019-10-02 14:15:25,326 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ae326e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:15:25, skipping insertion in model container [2019-10-02 14:15:25,326 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:15:25" (1/1) ... [2019-10-02 14:15:25,334 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 14:15:25,428 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 14:15:26,211 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:15:26,229 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 14:15:26,435 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:15:26,588 INFO L192 MainTranslator]: Completed translation [2019-10-02 14:15:26,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:15:26 WrapperNode [2019-10-02 14:15:26,590 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 14:15:26,591 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 14:15:26,591 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 14:15:26,592 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 14:15:26,607 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:15:26" (1/1) ... [2019-10-02 14:15:26,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:15:26" (1/1) ... [2019-10-02 14:15:26,651 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:15:26" (1/1) ... [2019-10-02 14:15:26,651 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:15:26" (1/1) ... [2019-10-02 14:15:26,710 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:15:26" (1/1) ... [2019-10-02 14:15:26,747 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:15:26" (1/1) ... [2019-10-02 14:15:26,781 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:15:26" (1/1) ... [2019-10-02 14:15:26,807 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 14:15:26,808 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 14:15:26,808 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 14:15:26,809 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 14:15:26,811 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:15:26" (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 14:15:26,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 14:15:26,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 14:15:26,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 14:15:26,900 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 14:15:26,901 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 14:15:26,901 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 14:15:26,901 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 14:15:26,901 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 14:15:26,901 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 14:15:26,902 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 14:15:26,902 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 14:15:26,902 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 14:15:26,903 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 14:15:26,903 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 14:15:26,904 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 14:15:26,904 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 14:15:26,906 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 14:15:26,906 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 14:15:26,907 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 14:15:26,907 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 14:15:26,907 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 14:15:26,907 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 14:15:26,907 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-02 14:15:26,908 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-02 14:15:26,908 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-02 14:15:26,908 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 14:15:26,908 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 14:15:26,908 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 14:15:26,908 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 14:15:26,909 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 14:15:26,909 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 14:15:26,909 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 14:15:26,909 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 14:15:26,909 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 14:15:26,909 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 14:15:26,910 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 14:15:26,910 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 14:15:26,910 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 14:15:26,910 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 14:15:26,910 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 14:15:26,910 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 14:15:26,910 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 14:15:26,911 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 14:15:26,911 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 14:15:26,911 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 14:15:26,911 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 14:15:26,911 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 14:15:26,911 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 14:15:26,911 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 14:15:26,912 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 14:15:26,912 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 14:15:26,912 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 14:15:26,912 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 14:15:26,912 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 14:15:26,912 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 14:15:26,912 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 14:15:26,913 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 14:15:26,913 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 14:15:26,913 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 14:15:26,913 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AddressBook [2019-10-02 14:15:26,914 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Forward [2019-10-02 14:15:26,914 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 14:15:26,914 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 14:15:26,914 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 14:15:26,914 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 14:15:26,914 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 14:15:26,915 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptForward_spec__1 [2019-10-02 14:15:26,915 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptForward_spec__2 [2019-10-02 14:15:26,915 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 14:15:26,915 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 14:15:26,916 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 14:15:26,916 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 14:15:26,916 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 14:15:26,916 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 14:15:26,917 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 14:15:26,917 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 14:15:26,917 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 14:15:26,917 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 14:15:26,917 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-10-02 14:15:26,917 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AddressBook [2019-10-02 14:15:26,918 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 14:15:26,918 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 14:15:26,918 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-10-02 14:15:26,919 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-10-02 14:15:26,919 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-10-02 14:15:26,919 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-10-02 14:15:26,919 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 14:15:26,920 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 14:15:26,920 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 14:15:26,920 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 14:15:26,920 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 14:15:26,921 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 14:15:26,921 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 14:15:26,921 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 14:15:26,922 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 14:15:26,922 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-02 14:15:26,922 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-02 14:15:26,922 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-02 14:15:26,922 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-02 14:15:26,922 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-02 14:15:26,923 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 14:15:26,923 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 14:15:26,923 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 14:15:26,923 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 14:15:26,923 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 14:15:26,923 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 14:15:26,923 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 14:15:26,924 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 14:15:26,924 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 14:15:26,924 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 14:15:26,924 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 14:15:26,924 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 14:15:26,924 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 14:15:26,924 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 14:15:26,925 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 14:15:26,925 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 14:15:26,925 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 14:15:26,925 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 14:15:26,925 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 14:15:26,926 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 14:15:26,926 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 14:15:26,926 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 14:15:26,926 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 14:15:26,927 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 14:15:26,928 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 14:15:26,928 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 14:15:26,928 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 14:15:26,928 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 14:15:26,929 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 14:15:26,929 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 14:15:26,929 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 14:15:26,930 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 14:15:26,930 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 14:15:26,930 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 14:15:26,930 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 14:15:26,930 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 14:15:26,930 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 14:15:26,931 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 14:15:26,931 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 14:15:26,932 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 14:15:26,935 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 14:15:26,935 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 14:15:26,936 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 14:15:26,936 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 14:15:26,942 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 14:15:26,943 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 14:15:26,943 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 14:15:26,943 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 14:15:26,943 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 14:15:26,943 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 14:15:26,943 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 14:15:26,944 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 14:15:26,944 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 14:15:26,944 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 14:15:26,944 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 14:15:26,945 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 14:15:26,946 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 14:15:26,946 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 14:15:26,946 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 14:15:26,946 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 14:15:26,946 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 14:15:26,946 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 14:15:26,947 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 14:15:26,947 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 14:15:26,947 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-02 14:15:26,947 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-02 14:15:26,947 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-02 14:15:26,947 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 14:15:26,947 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 14:15:26,948 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 14:15:26,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 14:15:26,948 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 14:15:26,948 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 14:15:26,948 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 14:15:26,948 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 14:15:26,949 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 14:15:26,949 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 14:15:26,949 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 14:15:26,949 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 14:15:26,949 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 14:15:26,949 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 14:15:26,949 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 14:15:26,950 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 14:15:26,950 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 14:15:26,950 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 14:15:26,950 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 14:15:26,950 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 14:15:26,950 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 14:15:26,951 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 14:15:26,951 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 14:15:26,951 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 14:15:26,951 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 14:15:26,951 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 14:15:26,951 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 14:15:26,951 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 14:15:26,952 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 14:15:26,952 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 14:15:26,952 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 14:15:26,952 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 14:15:26,952 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 14:15:26,952 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 14:15:26,953 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 14:15:26,953 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 14:15:26,953 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 14:15:26,953 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AddressBook [2019-10-02 14:15:26,953 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Forward [2019-10-02 14:15:26,953 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 14:15:26,954 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 14:15:26,954 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptForward_spec__1 [2019-10-02 14:15:26,954 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptForward_spec__2 [2019-10-02 14:15:26,954 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 14:15:26,954 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 14:15:26,954 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 14:15:26,954 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 14:15:26,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 14:15:26,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 14:15:26,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 14:15:26,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 14:15:26,955 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 14:15:26,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 14:15:26,956 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 14:15:26,956 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 14:15:26,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 14:15:26,956 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 14:15:26,956 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 14:15:26,956 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 14:15:26,957 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 14:15:26,957 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 14:15:26,957 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 14:15:26,957 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 14:15:26,957 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 14:15:26,957 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 14:15:26,958 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 14:15:26,958 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 14:15:26,958 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 14:15:26,958 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 14:15:26,958 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 14:15:26,958 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-02 14:15:26,959 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-02 14:15:26,959 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-02 14:15:26,959 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-02 14:15:26,959 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-02 14:15:26,959 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 14:15:26,959 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-10-02 14:15:26,959 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AddressBook [2019-10-02 14:15:26,960 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-10-02 14:15:26,960 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-10-02 14:15:26,960 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-10-02 14:15:26,960 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-10-02 14:15:26,960 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 14:15:26,960 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 14:15:26,961 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 14:15:26,961 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 14:15:26,961 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 14:15:26,961 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 14:15:26,961 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 14:15:26,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 14:15:26,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 14:15:26,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 14:15:29,286 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 14:15:29,287 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 14:15:29,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:15:29 BoogieIcfgContainer [2019-10-02 14:15:29,289 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 14:15:29,290 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 14:15:29,290 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 14:15:29,294 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 14:15:29,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 02:15:25" (1/3) ... [2019-10-02 14:15:29,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b9967c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:15:29, skipping insertion in model container [2019-10-02 14:15:29,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:15:26" (2/3) ... [2019-10-02 14:15:29,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b9967c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:15:29, skipping insertion in model container [2019-10-02 14:15:29,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:15:29" (3/3) ... [2019-10-02 14:15:29,303 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec9_product35.cil.c [2019-10-02 14:15:29,316 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 14:15:29,329 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 14:15:29,346 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 14:15:29,391 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 14:15:29,392 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 14:15:29,392 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 14:15:29,392 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 14:15:29,392 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 14:15:29,392 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 14:15:29,392 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 14:15:29,392 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 14:15:29,393 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 14:15:29,438 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states. [2019-10-02 14:15:29,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-02 14:15:29,469 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:15:29,470 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:15:29,472 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:15:29,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:15:29,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1796376026, now seen corresponding path program 1 times [2019-10-02 14:15:29,480 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:15:29,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:15:29,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:29,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:15:29,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:29,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:15:30,222 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 14:15:30,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:15:30,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 14:15:30,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 14:15:30,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 14:15:30,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 14:15:30,249 INFO L87 Difference]: Start difference. First operand 687 states. Second operand 2 states. [2019-10-02 14:15:30,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:15:30,346 INFO L93 Difference]: Finished difference Result 1049 states and 1409 transitions. [2019-10-02 14:15:30,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 14:15:30,348 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 167 [2019-10-02 14:15:30,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:15:30,394 INFO L225 Difference]: With dead ends: 1049 [2019-10-02 14:15:30,395 INFO L226 Difference]: Without dead ends: 658 [2019-10-02 14:15:30,403 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 14:15:30,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2019-10-02 14:15:30,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 658. [2019-10-02 14:15:30,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-10-02 14:15:30,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 890 transitions. [2019-10-02 14:15:30,533 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 890 transitions. Word has length 167 [2019-10-02 14:15:30,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:15:30,536 INFO L475 AbstractCegarLoop]: Abstraction has 658 states and 890 transitions. [2019-10-02 14:15:30,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 14:15:30,536 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 890 transitions. [2019-10-02 14:15:30,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-02 14:15:30,548 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:15:30,549 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:15:30,549 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:15:30,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:15:30,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1669127173, now seen corresponding path program 1 times [2019-10-02 14:15:30,551 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:15:30,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:15:30,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:30,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:15:30,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:30,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:15:30,913 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 14:15:30,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:15:30,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:15:30,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:15:30,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:15:30,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:15:30,922 INFO L87 Difference]: Start difference. First operand 658 states and 890 transitions. Second operand 3 states. [2019-10-02 14:15:31,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:15:31,031 INFO L93 Difference]: Finished difference Result 1032 states and 1374 transitions. [2019-10-02 14:15:31,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:15:31,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-10-02 14:15:31,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:15:31,046 INFO L225 Difference]: With dead ends: 1032 [2019-10-02 14:15:31,046 INFO L226 Difference]: Without dead ends: 661 [2019-10-02 14:15:31,052 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:15:31,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2019-10-02 14:15:31,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 660. [2019-10-02 14:15:31,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2019-10-02 14:15:31,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 892 transitions. [2019-10-02 14:15:31,112 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 892 transitions. Word has length 168 [2019-10-02 14:15:31,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:15:31,113 INFO L475 AbstractCegarLoop]: Abstraction has 660 states and 892 transitions. [2019-10-02 14:15:31,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:15:31,113 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 892 transitions. [2019-10-02 14:15:31,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-02 14:15:31,118 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:15:31,118 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:15:31,119 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:15:31,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:15:31,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1780408052, now seen corresponding path program 1 times [2019-10-02 14:15:31,119 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:15:31,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:15:31,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:31,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:15:31,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:15:31,332 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 14:15:31,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:15:31,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:15:31,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:15:31,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:15:31,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:15:31,338 INFO L87 Difference]: Start difference. First operand 660 states and 892 transitions. Second operand 3 states. [2019-10-02 14:15:31,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:15:31,391 INFO L93 Difference]: Finished difference Result 1300 states and 1788 transitions. [2019-10-02 14:15:31,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:15:31,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-10-02 14:15:31,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:15:31,402 INFO L225 Difference]: With dead ends: 1300 [2019-10-02 14:15:31,402 INFO L226 Difference]: Without dead ends: 705 [2019-10-02 14:15:31,405 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:15:31,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2019-10-02 14:15:31,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 704. [2019-10-02 14:15:31,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2019-10-02 14:15:31,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 967 transitions. [2019-10-02 14:15:31,440 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 967 transitions. Word has length 180 [2019-10-02 14:15:31,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:15:31,442 INFO L475 AbstractCegarLoop]: Abstraction has 704 states and 967 transitions. [2019-10-02 14:15:31,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:15:31,442 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 967 transitions. [2019-10-02 14:15:31,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-02 14:15:31,448 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:15:31,449 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:15:31,449 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:15:31,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:15:31,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1102871673, now seen corresponding path program 1 times [2019-10-02 14:15:31,450 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:15:31,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:15:31,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:31,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:15:31,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:31,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:15:31,630 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 14:15:31,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:15:31,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:15:31,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:15:31,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:15:31,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:15:31,632 INFO L87 Difference]: Start difference. First operand 704 states and 967 transitions. Second operand 3 states. [2019-10-02 14:15:31,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:15:31,678 INFO L93 Difference]: Finished difference Result 1429 states and 2008 transitions. [2019-10-02 14:15:31,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:15:31,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-10-02 14:15:31,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:15:31,687 INFO L225 Difference]: With dead ends: 1429 [2019-10-02 14:15:31,687 INFO L226 Difference]: Without dead ends: 790 [2019-10-02 14:15:31,690 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:15:31,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-10-02 14:15:31,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 789. [2019-10-02 14:15:31,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-10-02 14:15:31,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1111 transitions. [2019-10-02 14:15:31,744 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1111 transitions. Word has length 181 [2019-10-02 14:15:31,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:15:31,745 INFO L475 AbstractCegarLoop]: Abstraction has 789 states and 1111 transitions. [2019-10-02 14:15:31,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:15:31,745 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1111 transitions. [2019-10-02 14:15:31,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-10-02 14:15:31,749 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:15:31,750 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:15:31,750 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:15:31,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:15:31,750 INFO L82 PathProgramCache]: Analyzing trace with hash -441168396, now seen corresponding path program 1 times [2019-10-02 14:15:31,750 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:15:31,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:15:31,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:31,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:15:31,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:31,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:15:32,002 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 14:15:32,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:15:32,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:15:32,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:15:32,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:15:32,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:15:32,004 INFO L87 Difference]: Start difference. First operand 789 states and 1111 transitions. Second operand 3 states. [2019-10-02 14:15:32,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:15:32,056 INFO L93 Difference]: Finished difference Result 1678 states and 2430 transitions. [2019-10-02 14:15:32,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:15:32,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-10-02 14:15:32,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:15:32,062 INFO L225 Difference]: With dead ends: 1678 [2019-10-02 14:15:32,063 INFO L226 Difference]: Without dead ends: 954 [2019-10-02 14:15:32,066 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:15:32,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2019-10-02 14:15:32,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 953. [2019-10-02 14:15:32,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2019-10-02 14:15:32,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1387 transitions. [2019-10-02 14:15:32,112 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1387 transitions. Word has length 182 [2019-10-02 14:15:32,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:15:32,113 INFO L475 AbstractCegarLoop]: Abstraction has 953 states and 1387 transitions. [2019-10-02 14:15:32,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:15:32,113 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1387 transitions. [2019-10-02 14:15:32,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-10-02 14:15:32,119 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:15:32,119 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:15:32,119 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:15:32,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:15:32,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1717289379, now seen corresponding path program 1 times [2019-10-02 14:15:32,120 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:15:32,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:15:32,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:32,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:15:32,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:32,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:15:32,363 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 14:15:32,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:15:32,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:15:32,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:15:32,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:15:32,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:15:32,366 INFO L87 Difference]: Start difference. First operand 953 states and 1387 transitions. Second operand 3 states. [2019-10-02 14:15:32,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:15:32,422 INFO L93 Difference]: Finished difference Result 1452 states and 2059 transitions. [2019-10-02 14:15:32,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:15:32,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-10-02 14:15:32,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:15:32,429 INFO L225 Difference]: With dead ends: 1452 [2019-10-02 14:15:32,430 INFO L226 Difference]: Without dead ends: 1094 [2019-10-02 14:15:32,435 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:15:32,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2019-10-02 14:15:32,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 1093. [2019-10-02 14:15:32,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1093 states. [2019-10-02 14:15:32,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 1584 transitions. [2019-10-02 14:15:32,488 INFO L78 Accepts]: Start accepts. Automaton has 1093 states and 1584 transitions. Word has length 184 [2019-10-02 14:15:32,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:15:32,490 INFO L475 AbstractCegarLoop]: Abstraction has 1093 states and 1584 transitions. [2019-10-02 14:15:32,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:15:32,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1584 transitions. [2019-10-02 14:15:32,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-10-02 14:15:32,499 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:15:32,500 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:15:32,500 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:15:32,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:15:32,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1766872220, now seen corresponding path program 1 times [2019-10-02 14:15:32,501 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:15:32,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:15:32,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:32,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:15:32,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:32,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:15:32,936 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-10-02 14:15:32,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:15:32,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 14:15:32,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:15:32,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:15:32,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:15:32,939 INFO L87 Difference]: Start difference. First operand 1093 states and 1584 transitions. Second operand 6 states. [2019-10-02 14:15:33,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:15:33,896 INFO L93 Difference]: Finished difference Result 2597 states and 3733 transitions. [2019-10-02 14:15:33,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 14:15:33,896 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 340 [2019-10-02 14:15:33,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:15:33,924 INFO L225 Difference]: With dead ends: 2597 [2019-10-02 14:15:33,924 INFO L226 Difference]: Without dead ends: 2137 [2019-10-02 14:15:33,928 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:15:33,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2137 states. [2019-10-02 14:15:34,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2137 to 2126. [2019-10-02 14:15:34,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2126 states. [2019-10-02 14:15:34,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2126 states to 2126 states and 3110 transitions. [2019-10-02 14:15:34,072 INFO L78 Accepts]: Start accepts. Automaton has 2126 states and 3110 transitions. Word has length 340 [2019-10-02 14:15:34,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:15:34,073 INFO L475 AbstractCegarLoop]: Abstraction has 2126 states and 3110 transitions. [2019-10-02 14:15:34,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:15:34,074 INFO L276 IsEmpty]: Start isEmpty. Operand 2126 states and 3110 transitions. [2019-10-02 14:15:34,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2019-10-02 14:15:34,086 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:15:34,087 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:15:34,087 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:15:34,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:15:34,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1623250226, now seen corresponding path program 1 times [2019-10-02 14:15:34,088 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:15:34,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:15:34,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:34,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:15:34,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:34,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:15:34,374 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-10-02 14:15:34,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:15:34,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 14:15:34,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 14:15:34,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 14:15:34,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:15:34,376 INFO L87 Difference]: Start difference. First operand 2126 states and 3110 transitions. Second operand 11 states. [2019-10-02 14:15:34,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:15:34,919 INFO L93 Difference]: Finished difference Result 3043 states and 4319 transitions. [2019-10-02 14:15:34,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 14:15:34,920 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 341 [2019-10-02 14:15:34,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:15:34,936 INFO L225 Difference]: With dead ends: 3043 [2019-10-02 14:15:34,936 INFO L226 Difference]: Without dead ends: 2100 [2019-10-02 14:15:34,941 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-10-02 14:15:34,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2019-10-02 14:15:35,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 2096. [2019-10-02 14:15:35,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2096 states. [2019-10-02 14:15:35,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2096 states to 2096 states and 3059 transitions. [2019-10-02 14:15:35,102 INFO L78 Accepts]: Start accepts. Automaton has 2096 states and 3059 transitions. Word has length 341 [2019-10-02 14:15:35,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:15:35,103 INFO L475 AbstractCegarLoop]: Abstraction has 2096 states and 3059 transitions. [2019-10-02 14:15:35,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 14:15:35,104 INFO L276 IsEmpty]: Start isEmpty. Operand 2096 states and 3059 transitions. [2019-10-02 14:15:35,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-10-02 14:15:35,129 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:15:35,130 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:15:35,130 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:15:35,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:15:35,131 INFO L82 PathProgramCache]: Analyzing trace with hash 2058916794, now seen corresponding path program 1 times [2019-10-02 14:15:35,131 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:15:35,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:15:35,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:35,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:15:35,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:35,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:15:35,419 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-10-02 14:15:35,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:15:35,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:15:35,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:15:35,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:15:35,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:15:35,422 INFO L87 Difference]: Start difference. First operand 2096 states and 3059 transitions. Second operand 3 states. [2019-10-02 14:15:35,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:15:35,557 INFO L93 Difference]: Finished difference Result 4761 states and 7127 transitions. [2019-10-02 14:15:35,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:15:35,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 366 [2019-10-02 14:15:35,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:15:35,574 INFO L225 Difference]: With dead ends: 4761 [2019-10-02 14:15:35,574 INFO L226 Difference]: Without dead ends: 2730 [2019-10-02 14:15:35,581 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:15:35,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2730 states. [2019-10-02 14:15:35,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2730 to 2728. [2019-10-02 14:15:35,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2728 states. [2019-10-02 14:15:35,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2728 states to 2728 states and 4123 transitions. [2019-10-02 14:15:35,794 INFO L78 Accepts]: Start accepts. Automaton has 2728 states and 4123 transitions. Word has length 366 [2019-10-02 14:15:35,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:15:35,794 INFO L475 AbstractCegarLoop]: Abstraction has 2728 states and 4123 transitions. [2019-10-02 14:15:35,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:15:35,795 INFO L276 IsEmpty]: Start isEmpty. Operand 2728 states and 4123 transitions. [2019-10-02 14:15:35,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-10-02 14:15:35,813 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:15:35,814 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:15:35,814 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:15:35,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:15:35,814 INFO L82 PathProgramCache]: Analyzing trace with hash -2007324846, now seen corresponding path program 1 times [2019-10-02 14:15:35,815 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:15:35,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:15:35,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:35,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:15:35,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:35,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:15:36,040 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-10-02 14:15:36,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:15:36,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:15:36,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:15:36,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:15:36,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:15:36,042 INFO L87 Difference]: Start difference. First operand 2728 states and 4123 transitions. Second operand 3 states. [2019-10-02 14:15:36,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:15:36,206 INFO L93 Difference]: Finished difference Result 6609 states and 10239 transitions. [2019-10-02 14:15:36,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:15:36,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 382 [2019-10-02 14:15:36,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:15:36,240 INFO L225 Difference]: With dead ends: 6609 [2019-10-02 14:15:36,240 INFO L226 Difference]: Without dead ends: 3946 [2019-10-02 14:15:36,253 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:15:36,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3946 states. [2019-10-02 14:15:36,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3946 to 3944. [2019-10-02 14:15:36,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3944 states. [2019-10-02 14:15:36,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3944 states to 3944 states and 6155 transitions. [2019-10-02 14:15:36,592 INFO L78 Accepts]: Start accepts. Automaton has 3944 states and 6155 transitions. Word has length 382 [2019-10-02 14:15:36,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:15:36,592 INFO L475 AbstractCegarLoop]: Abstraction has 3944 states and 6155 transitions. [2019-10-02 14:15:36,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:15:36,593 INFO L276 IsEmpty]: Start isEmpty. Operand 3944 states and 6155 transitions. [2019-10-02 14:15:36,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2019-10-02 14:15:36,627 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:15:36,628 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:15:36,628 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:15:36,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:15:36,628 INFO L82 PathProgramCache]: Analyzing trace with hash 997408426, now seen corresponding path program 1 times [2019-10-02 14:15:36,629 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:15:36,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:15:36,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:36,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:15:36,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:36,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:15:36,888 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-10-02 14:15:36,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:15:36,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:15:36,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:15:36,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:15:36,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:15:36,890 INFO L87 Difference]: Start difference. First operand 3944 states and 6155 transitions. Second operand 3 states. [2019-10-02 14:15:37,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:15:37,106 INFO L93 Difference]: Finished difference Result 10161 states and 16175 transitions. [2019-10-02 14:15:37,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:15:37,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 385 [2019-10-02 14:15:37,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:15:37,150 INFO L225 Difference]: With dead ends: 10161 [2019-10-02 14:15:37,150 INFO L226 Difference]: Without dead ends: 6282 [2019-10-02 14:15:37,168 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:15:37,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6282 states. [2019-10-02 14:15:37,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6282 to 6280. [2019-10-02 14:15:37,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6280 states. [2019-10-02 14:15:37,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6280 states to 6280 states and 10027 transitions. [2019-10-02 14:15:37,621 INFO L78 Accepts]: Start accepts. Automaton has 6280 states and 10027 transitions. Word has length 385 [2019-10-02 14:15:37,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:15:37,623 INFO L475 AbstractCegarLoop]: Abstraction has 6280 states and 10027 transitions. [2019-10-02 14:15:37,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:15:37,623 INFO L276 IsEmpty]: Start isEmpty. Operand 6280 states and 10027 transitions. [2019-10-02 14:15:37,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2019-10-02 14:15:37,660 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:15:37,661 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:15:37,662 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:15:37,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:15:37,662 INFO L82 PathProgramCache]: Analyzing trace with hash -463136878, now seen corresponding path program 1 times [2019-10-02 14:15:37,662 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:15:37,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:15:37,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:37,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:15:37,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:37,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:15:37,881 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-10-02 14:15:37,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:15:37,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:15:37,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:15:37,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:15:37,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:15:37,884 INFO L87 Difference]: Start difference. First operand 6280 states and 10027 transitions. Second operand 3 states. [2019-10-02 14:15:38,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:15:38,206 INFO L93 Difference]: Finished difference Result 16977 states and 27471 transitions. [2019-10-02 14:15:38,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:15:38,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 384 [2019-10-02 14:15:38,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:15:38,291 INFO L225 Difference]: With dead ends: 16977 [2019-10-02 14:15:38,291 INFO L226 Difference]: Without dead ends: 10762 [2019-10-02 14:15:38,322 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:15:38,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10762 states. [2019-10-02 14:15:38,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10762 to 10760. [2019-10-02 14:15:38,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10760 states. [2019-10-02 14:15:39,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10760 states to 10760 states and 17387 transitions. [2019-10-02 14:15:39,018 INFO L78 Accepts]: Start accepts. Automaton has 10760 states and 17387 transitions. Word has length 384 [2019-10-02 14:15:39,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:15:39,019 INFO L475 AbstractCegarLoop]: Abstraction has 10760 states and 17387 transitions. [2019-10-02 14:15:39,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:15:39,019 INFO L276 IsEmpty]: Start isEmpty. Operand 10760 states and 17387 transitions. [2019-10-02 14:15:39,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2019-10-02 14:15:39,095 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:15:39,096 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 14:15:39,096 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:15:39,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:15:39,097 INFO L82 PathProgramCache]: Analyzing trace with hash -2032256724, now seen corresponding path program 1 times [2019-10-02 14:15:39,097 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:15:39,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:15:39,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:39,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:15:39,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:39,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:15:39,645 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-10-02 14:15:39,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:15:39,646 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 14:15:39,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:15:41,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:15:41,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 3986 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 14:15:41,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:15:41,538 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-10-02 14:15:41,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:15:41,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [22] total 29 [2019-10-02 14:15:41,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-02 14:15:41,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-02 14:15:41,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=746, Unknown=0, NotChecked=0, Total=812 [2019-10-02 14:15:41,553 INFO L87 Difference]: Start difference. First operand 10760 states and 17387 transitions. Second operand 29 states. [2019-10-02 14:16:38,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:16:38,626 INFO L93 Difference]: Finished difference Result 38352 states and 61988 transitions. [2019-10-02 14:16:38,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-10-02 14:16:38,627 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 349 [2019-10-02 14:16:38,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:16:38,766 INFO L225 Difference]: With dead ends: 38352 [2019-10-02 14:16:38,767 INFO L226 Difference]: Without dead ends: 27361 [2019-10-02 14:16:38,821 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 555 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10462 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2054, Invalid=28048, Unknown=0, NotChecked=0, Total=30102 [2019-10-02 14:16:38,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27361 states. [2019-10-02 14:16:40,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27361 to 26931. [2019-10-02 14:16:40,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26931 states. [2019-10-02 14:16:40,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26931 states to 26931 states and 43396 transitions. [2019-10-02 14:16:40,500 INFO L78 Accepts]: Start accepts. Automaton has 26931 states and 43396 transitions. Word has length 349 [2019-10-02 14:16:40,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:16:40,500 INFO L475 AbstractCegarLoop]: Abstraction has 26931 states and 43396 transitions. [2019-10-02 14:16:40,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-02 14:16:40,501 INFO L276 IsEmpty]: Start isEmpty. Operand 26931 states and 43396 transitions. [2019-10-02 14:16:40,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-10-02 14:16:40,629 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:16:40,629 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 14:16:40,630 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:16:40,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:16:40,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1191578470, now seen corresponding path program 1 times [2019-10-02 14:16:40,630 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:16:40,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:16:40,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:16:40,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:16:40,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:16:40,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:16:40,870 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-10-02 14:16:40,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:16:40,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 14:16:40,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:16:40,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:16:40,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:16:40,874 INFO L87 Difference]: Start difference. First operand 26931 states and 43396 transitions. Second operand 5 states. [2019-10-02 14:16:41,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:16:41,541 INFO L93 Difference]: Finished difference Result 33825 states and 52946 transitions. [2019-10-02 14:16:41,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:16:41,542 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 352 [2019-10-02 14:16:41,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:16:41,699 INFO L225 Difference]: With dead ends: 33825 [2019-10-02 14:16:41,700 INFO L226 Difference]: Without dead ends: 26341 [2019-10-02 14:16:41,740 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:16:41,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26341 states. [2019-10-02 14:16:43,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26341 to 26251. [2019-10-02 14:16:43,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26251 states. [2019-10-02 14:16:44,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26251 states to 26251 states and 42412 transitions. [2019-10-02 14:16:44,022 INFO L78 Accepts]: Start accepts. Automaton has 26251 states and 42412 transitions. Word has length 352 [2019-10-02 14:16:44,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:16:44,023 INFO L475 AbstractCegarLoop]: Abstraction has 26251 states and 42412 transitions. [2019-10-02 14:16:44,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:16:44,023 INFO L276 IsEmpty]: Start isEmpty. Operand 26251 states and 42412 transitions. [2019-10-02 14:16:44,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2019-10-02 14:16:44,166 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:16:44,166 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:16:44,167 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:16:44,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:16:44,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1505516427, now seen corresponding path program 1 times [2019-10-02 14:16:44,167 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:16:44,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:16:44,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:16:44,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:16:44,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:16:44,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:16:44,632 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 27 proven. 4 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-10-02 14:16:44,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:16:44,632 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 14:16:44,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:16:45,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:16:45,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 3989 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 14:16:45,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:16:45,781 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-10-02 14:16:45,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:16:45,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [18] total 23 [2019-10-02 14:16:45,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 14:16:45,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 14:16:45,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2019-10-02 14:16:45,795 INFO L87 Difference]: Start difference. First operand 26251 states and 42412 transitions. Second operand 23 states. [2019-10-02 14:16:49,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:16:49,215 INFO L93 Difference]: Finished difference Result 53149 states and 86675 transitions. [2019-10-02 14:16:49,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-02 14:16:49,216 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 354 [2019-10-02 14:16:49,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:16:49,351 INFO L225 Difference]: With dead ends: 53149 [2019-10-02 14:16:49,351 INFO L226 Difference]: Without dead ends: 26763 [2019-10-02 14:16:49,449 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=155, Invalid=1825, Unknown=0, NotChecked=0, Total=1980 [2019-10-02 14:16:49,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26763 states. [2019-10-02 14:16:50,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26763 to 26721. [2019-10-02 14:16:50,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26721 states. [2019-10-02 14:16:50,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26721 states to 26721 states and 43190 transitions. [2019-10-02 14:16:50,995 INFO L78 Accepts]: Start accepts. Automaton has 26721 states and 43190 transitions. Word has length 354 [2019-10-02 14:16:50,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:16:50,996 INFO L475 AbstractCegarLoop]: Abstraction has 26721 states and 43190 transitions. [2019-10-02 14:16:50,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 14:16:50,996 INFO L276 IsEmpty]: Start isEmpty. Operand 26721 states and 43190 transitions. [2019-10-02 14:16:51,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-10-02 14:16:51,084 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:16:51,084 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:16:51,085 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:16:51,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:16:51,085 INFO L82 PathProgramCache]: Analyzing trace with hash 399984455, now seen corresponding path program 1 times [2019-10-02 14:16:51,085 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:16:51,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:16:51,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:16:51,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:16:51,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:16:51,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:16:51,556 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-10-02 14:16:51,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:16:51,556 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 14:16:51,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:16:52,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:16:52,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 3989 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 14:16:52,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:16:52,536 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-10-02 14:16:52,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:16:52,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 25 [2019-10-02 14:16:52,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-02 14:16:52,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-02 14:16:52,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2019-10-02 14:16:52,546 INFO L87 Difference]: Start difference. First operand 26721 states and 43190 transitions. Second operand 25 states. [2019-10-02 14:17:42,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:17:42,024 INFO L93 Difference]: Finished difference Result 61906 states and 98851 transitions. [2019-10-02 14:17:42,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-10-02 14:17:42,024 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 352 [2019-10-02 14:17:42,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:17:42,157 INFO L225 Difference]: With dead ends: 61906 [2019-10-02 14:17:42,157 INFO L226 Difference]: Without dead ends: 32195 [2019-10-02 14:17:42,245 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 394 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9627 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1939, Invalid=25451, Unknown=0, NotChecked=0, Total=27390 [2019-10-02 14:17:42,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32195 states. [2019-10-02 14:17:43,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32195 to 30925. [2019-10-02 14:17:43,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30925 states. [2019-10-02 14:17:43,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30925 states to 30925 states and 49232 transitions. [2019-10-02 14:17:43,635 INFO L78 Accepts]: Start accepts. Automaton has 30925 states and 49232 transitions. Word has length 352 [2019-10-02 14:17:43,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:17:43,636 INFO L475 AbstractCegarLoop]: Abstraction has 30925 states and 49232 transitions. [2019-10-02 14:17:43,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-02 14:17:43,636 INFO L276 IsEmpty]: Start isEmpty. Operand 30925 states and 49232 transitions. [2019-10-02 14:17:43,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-10-02 14:17:43,696 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:17:43,697 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:17:43,697 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:17:43,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:17:43,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1221800427, now seen corresponding path program 1 times [2019-10-02 14:17:43,698 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:17:43,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:17:43,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:17:43,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:17:43,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:17:43,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:17:44,070 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-10-02 14:17:44,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:17:44,071 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 14:17:44,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:17:44,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:17:44,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 3991 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 14:17:44,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:17:45,121 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-02 14:17:45,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:17:45,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 25 [2019-10-02 14:17:45,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-02 14:17:45,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-02 14:17:45,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2019-10-02 14:17:45,132 INFO L87 Difference]: Start difference. First operand 30925 states and 49232 transitions. Second operand 25 states. [2019-10-02 14:18:36,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:18:36,606 INFO L93 Difference]: Finished difference Result 72098 states and 113591 transitions. [2019-10-02 14:18:36,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-10-02 14:18:36,606 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 356 [2019-10-02 14:18:36,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:18:36,718 INFO L225 Difference]: With dead ends: 72098 [2019-10-02 14:18:36,718 INFO L226 Difference]: Without dead ends: 36594 [2019-10-02 14:18:36,792 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9621 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1939, Invalid=25451, Unknown=0, NotChecked=0, Total=27390 [2019-10-02 14:18:36,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36594 states. [2019-10-02 14:18:38,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36594 to 34299. [2019-10-02 14:18:38,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34299 states. [2019-10-02 14:18:38,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34299 states to 34299 states and 54028 transitions. [2019-10-02 14:18:38,413 INFO L78 Accepts]: Start accepts. Automaton has 34299 states and 54028 transitions. Word has length 356 [2019-10-02 14:18:38,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:18:38,413 INFO L475 AbstractCegarLoop]: Abstraction has 34299 states and 54028 transitions. [2019-10-02 14:18:38,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-02 14:18:38,414 INFO L276 IsEmpty]: Start isEmpty. Operand 34299 states and 54028 transitions. [2019-10-02 14:18:38,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-10-02 14:18:38,483 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:18:38,484 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:18:38,484 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:18:38,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:18:38,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1205263567, now seen corresponding path program 1 times [2019-10-02 14:18:38,484 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:18:38,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:18:38,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:18:38,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:18:38,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:18:38,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:18:38,841 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-10-02 14:18:38,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:18:38,842 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:18:38,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:18:39,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:18:39,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 3988 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 14:18:39,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:18:39,810 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-02 14:18:39,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:18:39,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2019-10-02 14:18:39,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 14:18:39,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 14:18:39,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-02 14:18:39,832 INFO L87 Difference]: Start difference. First operand 34299 states and 54028 transitions. Second operand 14 states. [2019-10-02 14:18:55,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:18:55,253 INFO L93 Difference]: Finished difference Result 104796 states and 180901 transitions. [2019-10-02 14:18:55,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-02 14:18:55,254 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 357 [2019-10-02 14:18:55,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:18:55,502 INFO L225 Difference]: With dead ends: 104796 [2019-10-02 14:18:55,502 INFO L226 Difference]: Without dead ends: 70577 [2019-10-02 14:18:55,590 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=215, Invalid=1045, Unknown=0, NotChecked=0, Total=1260 [2019-10-02 14:18:55,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70577 states. [2019-10-02 14:19:01,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70577 to 68431. [2019-10-02 14:19:01,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68431 states. [2019-10-02 14:19:01,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68431 states to 68431 states and 116659 transitions. [2019-10-02 14:19:01,494 INFO L78 Accepts]: Start accepts. Automaton has 68431 states and 116659 transitions. Word has length 357 [2019-10-02 14:19:01,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:19:01,494 INFO L475 AbstractCegarLoop]: Abstraction has 68431 states and 116659 transitions. [2019-10-02 14:19:01,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 14:19:01,495 INFO L276 IsEmpty]: Start isEmpty. Operand 68431 states and 116659 transitions. [2019-10-02 14:19:01,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-10-02 14:19:01,586 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:19:01,587 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:19:01,587 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:19:01,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:19:01,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1971877415, now seen corresponding path program 1 times [2019-10-02 14:19:01,588 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:19:01,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:19:01,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:19:01,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:19:01,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:19:01,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:19:02,081 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-10-02 14:19:02,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:19:02,082 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 14:19:02,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:19:02,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:19:02,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 3990 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 14:19:02,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:19:03,150 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:19:03,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:19:03,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [26] total 31 [2019-10-02 14:19:03,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-02 14:19:03,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-02 14:19:03,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=867, Unknown=0, NotChecked=0, Total=930 [2019-10-02 14:19:03,177 INFO L87 Difference]: Start difference. First operand 68431 states and 116659 transitions. Second operand 31 states. [2019-10-02 14:19:11,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:19:11,310 INFO L93 Difference]: Finished difference Result 150687 states and 306401 transitions. [2019-10-02 14:19:11,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-02 14:19:11,311 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 357 [2019-10-02 14:19:11,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:19:11,739 INFO L225 Difference]: With dead ends: 150687 [2019-10-02 14:19:11,739 INFO L226 Difference]: Without dead ends: 77572 [2019-10-02 14:19:11,976 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=231, Invalid=3929, Unknown=0, NotChecked=0, Total=4160 [2019-10-02 14:19:12,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77572 states. [2019-10-02 14:19:20,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77572 to 74698. [2019-10-02 14:19:20,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74698 states. [2019-10-02 14:19:20,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74698 states to 74698 states and 131572 transitions. [2019-10-02 14:19:20,716 INFO L78 Accepts]: Start accepts. Automaton has 74698 states and 131572 transitions. Word has length 357 [2019-10-02 14:19:20,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:19:20,716 INFO L475 AbstractCegarLoop]: Abstraction has 74698 states and 131572 transitions. [2019-10-02 14:19:20,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-02 14:19:20,717 INFO L276 IsEmpty]: Start isEmpty. Operand 74698 states and 131572 transitions. [2019-10-02 14:19:20,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2019-10-02 14:19:20,817 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:19:20,817 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:19:20,817 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:19:20,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:19:20,818 INFO L82 PathProgramCache]: Analyzing trace with hash -234129496, now seen corresponding path program 1 times [2019-10-02 14:19:20,818 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:19:20,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:19:20,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:19:20,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:19:20,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:19:20,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:19:21,077 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-10-02 14:19:21,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:19:21,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 14:19:21,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 14:19:21,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 14:19:21,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:19:21,079 INFO L87 Difference]: Start difference. First operand 74698 states and 131572 transitions. Second operand 10 states. [2019-10-02 14:19:24,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:19:24,192 INFO L93 Difference]: Finished difference Result 129618 states and 251615 transitions. [2019-10-02 14:19:24,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 14:19:24,193 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 362 [2019-10-02 14:19:24,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:19:24,545 INFO L225 Difference]: With dead ends: 129618 [2019-10-02 14:19:24,545 INFO L226 Difference]: Without dead ends: 76102 [2019-10-02 14:19:24,725 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:19:24,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76102 states. [2019-10-02 14:19:30,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76102 to 74946. [2019-10-02 14:19:30,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74946 states. [2019-10-02 14:19:31,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74946 states to 74946 states and 131917 transitions. [2019-10-02 14:19:31,239 INFO L78 Accepts]: Start accepts. Automaton has 74946 states and 131917 transitions. Word has length 362 [2019-10-02 14:19:31,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:19:31,239 INFO L475 AbstractCegarLoop]: Abstraction has 74946 states and 131917 transitions. [2019-10-02 14:19:31,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 14:19:31,239 INFO L276 IsEmpty]: Start isEmpty. Operand 74946 states and 131917 transitions. [2019-10-02 14:19:31,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2019-10-02 14:19:31,326 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:19:31,327 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:19:31,327 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:19:31,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:19:31,327 INFO L82 PathProgramCache]: Analyzing trace with hash -394836837, now seen corresponding path program 1 times [2019-10-02 14:19:31,327 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:19:31,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:19:31,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:19:31,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:19:31,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:19:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:19:31,555 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-10-02 14:19:31,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:19:31,555 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 14:19:32,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:19:32,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:19:32,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 4179 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 14:19:32,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:19:32,910 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Stream closed [2019-10-02 14:19:32,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:19:32,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 9 [2019-10-02 14:19:32,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:19:32,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:19:32,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:19:32,933 INFO L87 Difference]: Start difference. First operand 74946 states and 131917 transitions. Second operand 9 states. [2019-10-02 14:19:42,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:19:42,520 INFO L93 Difference]: Finished difference Result 226187 states and 413293 transitions. [2019-10-02 14:19:42,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 14:19:42,520 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 409 [2019-10-02 14:19:42,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:19:43,387 INFO L225 Difference]: With dead ends: 226187 [2019-10-02 14:19:43,387 INFO L226 Difference]: Without dead ends: 167498 [2019-10-02 14:19:43,640 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-10-02 14:19:43,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167498 states. [2019-10-02 14:19:51,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167498 to 162512. [2019-10-02 14:19:51,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162512 states. [2019-10-02 14:19:52,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162512 states to 162512 states and 293139 transitions. [2019-10-02 14:19:52,660 INFO L78 Accepts]: Start accepts. Automaton has 162512 states and 293139 transitions. Word has length 409 [2019-10-02 14:19:52,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:19:52,660 INFO L475 AbstractCegarLoop]: Abstraction has 162512 states and 293139 transitions. [2019-10-02 14:19:52,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:19:52,660 INFO L276 IsEmpty]: Start isEmpty. Operand 162512 states and 293139 transitions. [2019-10-02 14:19:52,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2019-10-02 14:19:52,912 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:19:52,912 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:19:52,913 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:19:52,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:19:52,913 INFO L82 PathProgramCache]: Analyzing trace with hash -51719450, now seen corresponding path program 1 times [2019-10-02 14:19:52,913 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:19:52,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:19:52,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:19:52,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:19:52,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:19:52,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:19:53,299 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-10-02 14:19:53,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:19:53,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 14:19:53,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 14:19:53,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 14:19:53,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:19:53,302 INFO L87 Difference]: Start difference. First operand 162512 states and 293139 transitions. Second operand 8 states. [2019-10-02 14:20:18,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:20:18,722 INFO L93 Difference]: Finished difference Result 488248 states and 913005 transitions. [2019-10-02 14:20:18,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 14:20:18,723 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 444 [2019-10-02 14:20:18,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:20:21,296 INFO L225 Difference]: With dead ends: 488248 [2019-10-02 14:20:21,296 INFO L226 Difference]: Without dead ends: 325876 [2019-10-02 14:20:21,712 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-02 14:20:21,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325876 states. [2019-10-02 14:20:41,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325876 to 229891. [2019-10-02 14:20:41,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229891 states. [2019-10-02 14:20:43,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229891 states to 229891 states and 428596 transitions. [2019-10-02 14:20:43,897 INFO L78 Accepts]: Start accepts. Automaton has 229891 states and 428596 transitions. Word has length 444 [2019-10-02 14:20:43,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:20:43,898 INFO L475 AbstractCegarLoop]: Abstraction has 229891 states and 428596 transitions. [2019-10-02 14:20:43,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 14:20:43,898 INFO L276 IsEmpty]: Start isEmpty. Operand 229891 states and 428596 transitions. [2019-10-02 14:20:44,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2019-10-02 14:20:44,434 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:20:44,435 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:20:44,435 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:20:44,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:20:44,435 INFO L82 PathProgramCache]: Analyzing trace with hash 2027531837, now seen corresponding path program 1 times [2019-10-02 14:20:44,435 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:20:44,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:20:44,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:20:44,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:20:44,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:20:44,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:20:44,648 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-10-02 14:20:44,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:20:44,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 14:20:44,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:20:44,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:20:44,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:20:44,650 INFO L87 Difference]: Start difference. First operand 229891 states and 428596 transitions. Second operand 6 states. [2019-10-02 14:20:59,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:20:59,769 INFO L93 Difference]: Finished difference Result 459550 states and 856886 transitions. [2019-10-02 14:20:59,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 14:20:59,770 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 410 [2019-10-02 14:20:59,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:21:01,766 INFO L225 Difference]: With dead ends: 459550 [2019-10-02 14:21:01,766 INFO L226 Difference]: Without dead ends: 229903 [2019-10-02 14:21:02,285 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:21:02,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229903 states. [2019-10-02 14:21:22,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229903 to 219371. [2019-10-02 14:21:22,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219371 states. [2019-10-02 14:21:31,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219371 states to 219371 states and 408820 transitions. [2019-10-02 14:21:31,664 INFO L78 Accepts]: Start accepts. Automaton has 219371 states and 408820 transitions. Word has length 410 [2019-10-02 14:21:31,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:21:31,665 INFO L475 AbstractCegarLoop]: Abstraction has 219371 states and 408820 transitions. [2019-10-02 14:21:31,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:21:31,665 INFO L276 IsEmpty]: Start isEmpty. Operand 219371 states and 408820 transitions. [2019-10-02 14:21:32,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-10-02 14:21:32,167 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:21:32,168 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:21:32,168 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:21:32,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:21:32,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1298661082, now seen corresponding path program 1 times [2019-10-02 14:21:32,168 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:21:32,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:21:32,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:21:32,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:21:32,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:21:32,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:21:32,415 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-10-02 14:21:32,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:21:32,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 14:21:32,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 14:21:32,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 14:21:32,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 14:21:32,420 INFO L87 Difference]: Start difference. First operand 219371 states and 408820 transitions. Second operand 7 states. [2019-10-02 14:21:43,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:21:43,421 INFO L93 Difference]: Finished difference Result 438648 states and 820658 transitions. [2019-10-02 14:21:43,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 14:21:43,421 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 403 [2019-10-02 14:21:43,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:21:44,347 INFO L225 Difference]: With dead ends: 438648 [2019-10-02 14:21:44,347 INFO L226 Difference]: Without dead ends: 219515 [2019-10-02 14:21:44,828 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:21:44,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219515 states. [2019-10-02 14:22:03,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219515 to 219515. [2019-10-02 14:22:03,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219515 states. [2019-10-02 14:22:06,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219515 states to 219515 states and 408996 transitions. [2019-10-02 14:22:06,128 INFO L78 Accepts]: Start accepts. Automaton has 219515 states and 408996 transitions. Word has length 403 [2019-10-02 14:22:06,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:22:06,129 INFO L475 AbstractCegarLoop]: Abstraction has 219515 states and 408996 transitions. [2019-10-02 14:22:06,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 14:22:06,129 INFO L276 IsEmpty]: Start isEmpty. Operand 219515 states and 408996 transitions. [2019-10-02 14:22:06,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2019-10-02 14:22:06,608 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:22:06,608 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:22:06,609 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:22:06,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:22:06,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1385475657, now seen corresponding path program 1 times [2019-10-02 14:22:06,609 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:22:06,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:22:06,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:22:06,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:22:06,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:22:06,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:22:06,877 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-10-02 14:22:06,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:22:06,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 14:22:06,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 14:22:06,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 14:22:06,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:22:06,879 INFO L87 Difference]: Start difference. First operand 219515 states and 408996 transitions. Second operand 8 states. [2019-10-02 14:22:45,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:22:45,828 INFO L93 Difference]: Finished difference Result 660225 states and 1294592 transitions. [2019-10-02 14:22:45,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 14:22:45,828 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 432 [2019-10-02 14:22:45,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:22:47,976 INFO L225 Difference]: With dead ends: 660225 [2019-10-02 14:22:47,977 INFO L226 Difference]: Without dead ends: 440902 [2019-10-02 14:22:49,191 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-02 14:22:49,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440902 states. [2019-10-02 14:23:26,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440902 to 309721. [2019-10-02 14:23:26,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309721 states. [2019-10-02 14:23:27,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309721 states to 309721 states and 615545 transitions. [2019-10-02 14:23:27,765 INFO L78 Accepts]: Start accepts. Automaton has 309721 states and 615545 transitions. Word has length 432 [2019-10-02 14:23:27,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:23:27,766 INFO L475 AbstractCegarLoop]: Abstraction has 309721 states and 615545 transitions. [2019-10-02 14:23:27,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 14:23:27,766 INFO L276 IsEmpty]: Start isEmpty. Operand 309721 states and 615545 transitions. [2019-10-02 14:23:31,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-10-02 14:23:31,257 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:23:31,257 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:23:31,258 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:23:31,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:23:31,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1718934507, now seen corresponding path program 1 times [2019-10-02 14:23:31,258 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:23:31,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:23:31,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:23:31,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:23:31,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:23:31,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:23:31,471 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-10-02 14:23:31,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:23:31,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 14:23:31,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:23:31,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:23:31,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:23:31,473 INFO L87 Difference]: Start difference. First operand 309721 states and 615545 transitions. Second operand 6 states. [2019-10-02 14:23:52,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:23:52,427 INFO L93 Difference]: Finished difference Result 619158 states and 1230712 transitions. [2019-10-02 14:23:52,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 14:23:52,427 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 400 [2019-10-02 14:23:52,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:23:53,845 INFO L225 Difference]: With dead ends: 619158 [2019-10-02 14:23:53,846 INFO L226 Difference]: Without dead ends: 309733 [2019-10-02 14:23:55,676 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:23:55,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309733 states. [2019-10-02 14:24:27,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309733 to 309721. [2019-10-02 14:24:27,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309721 states. [2019-10-02 14:24:29,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309721 states to 309721 states and 613497 transitions. [2019-10-02 14:24:29,367 INFO L78 Accepts]: Start accepts. Automaton has 309721 states and 613497 transitions. Word has length 400 [2019-10-02 14:24:29,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:24:29,367 INFO L475 AbstractCegarLoop]: Abstraction has 309721 states and 613497 transitions. [2019-10-02 14:24:29,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:24:29,367 INFO L276 IsEmpty]: Start isEmpty. Operand 309721 states and 613497 transitions. [2019-10-02 14:24:32,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2019-10-02 14:24:32,326 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:24:32,326 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:24:32,326 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:24:32,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:24:32,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1165566008, now seen corresponding path program 1 times [2019-10-02 14:24:32,327 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:24:32,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:24:32,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:24:32,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:24:32,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:24:32,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:24:32,615 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-10-02 14:24:32,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:24:32,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 14:24:32,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 14:24:32,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 14:24:32,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:24:32,617 INFO L87 Difference]: Start difference. First operand 309721 states and 613497 transitions. Second operand 8 states. [2019-10-02 14:25:26,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:25:26,301 INFO L93 Difference]: Finished difference Result 932707 states and 1976183 transitions. [2019-10-02 14:25:26,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 14:25:26,301 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 460 [2019-10-02 14:25:26,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:25:29,524 INFO L225 Difference]: With dead ends: 932707 [2019-10-02 14:25:29,524 INFO L226 Difference]: Without dead ends: 623230 [2019-10-02 14:25:42,464 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-02 14:25:42,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623230 states.